15 views

Uploaded by ahmaddarawshi

CPWS201415_Exercise2

CPWS201415_Exercise2

© All Rights Reserved

- FSM Testing
- Network Evolution
- 6. Physical Layer-Switching
- Statement of Purpose
- Multiplexing
- Network Design
- Testi 8
- TeleTraffic for Beginners
- IT Support Analyst CV
- NPM Administrator Guide
- Chapter 1 Managing the Digital Firm
- High Performance Networks
- TopAccess Guide
- Datasheet-Guidewire-GuidewireLiveSecurity
- Minimize Dfa
- RTN 950 V100R011C10 Product Description 02.pdf
- C1006 Chapter 6
- wanarch.pdf
- Module C Power Point > ModC_ch02_eng
- Ciss100.Com-Wide Area Networking

You are on page 1of 3

Exercise 2

22.10.2014

1. Consider a factory where tennis balls are manufactured. At the end of

the production chain a machine M1 prints the brand logo on each tennis

ball. Consider that the machine can stamp just one ball at a time. After

stamping a ball, the machine drops the ball on a tray and is ready to

stamp another ball. Then, another machine, M2, takes the balls from the

tray and fills empty cans with three balls per can. Finally, the machine

M2 pressurizes and seals each can. Draw a Petri Net that describes the

operation of the two machines, M1 and M2.

2. Calculate the end-to-end delay for the following:

(a) Consider the network topology illustrated in Figure 1. Host A sends

a 5000-bit file to Host B. The switch S1 operates in a store-and-forward

manner, i.e., it begins retransmitting immediately after it has fully

received the packet. The transmission rate is R = 10 Mbps (for all

devices), and the propagation speed is s = 2.5 108 . Ignore all

processing and queuing delays.

(b) Same as (a) for the network topology of Figure 2.

(c) Same as (a) (for the topology for Figure 1), but assume the switch S1

implements cut-through switching: it is able to begin retransmitting the packet after the first 200 bits have been received.

3. Circuit-switched Vs. Packet-switched network

100m

100m

S1

Host A

Host B

100m

100m

S1

100m

S2

Host A

Host B

Consider the simple network topology of Figure 3, where Hosts A, B, and

C are connected to Host D through Router R. The capacities of the links

are as illustrated in the figure. Assume a scenario where hosts A, B and C

generate saturated traffic destined for Host D (i.e. Hosts A, B and C want

to send packets non-stop to Host D).

Host A

4 Mbps

R

4 Mbps

Host B

Host C

11 Mbps

Host D

4 Mbps

(a) Would you employ a circuit-switched or a packet-switched network

in order to utilize more efficiently the available capacity of the network? Explain your answer.

(b) What could be the maximum data rate on the link between R and D

in the case of (a) circuit switched network, and (b) packet-switched

network?

4. Even More on Circuit-switched Vs. Packet-switched networks

Compare the performance of circuit-switched and packet-switched networks in the following situations:

(a) Host A is sending data to Host B over N links connected by intermediate switches. Assuming a propagation speed of 2 108 meters per second, link distance of 100 meters per link, packet length

of 1000 bytes, and data rate of 10 Mbps for each link compute the

end-to-end delay for both circuit-switched network and store-andforward packet-switched network. What happens to the delay if

packet length is reduced to 100 bytes?

(b) Assume that N hosts are transmitting data to a server over a single bottleneck link with capacity of 10 Mbps, and that each host has

a bandwidth requirement of 1 Mbps for its transmission, but only

2

transmits 10 of the time. How many users can the network serve in

the circuit-switched case? Assuming that N = 50, what is the probability (i.e. percentage of time) that the network cannot serve all the

active users in the packet-switched case?

5. Designing Finite State Machines for Networking Problems

Consider the usage of Finite State Machines (FSMs) for recognizing simple input patterns. In the following we assume that FSMs are used to

analyze a stream of bits that contains 0s and 1s (that is, the input alphabet consists of one and zero, I = {0, 1})

(a) Design an FSM that computes the even parity bit for the stream of

bits accepted so far.

(b) Design an FSM that recognizes when three consecutive 1s are applied in the input. After receiving three consecutive 1s the FSM outputs the string FOUND and initializes (i.e., restarts) the counting

procedure.

- FSM TestingUploaded byLam Phuong
- Network EvolutionUploaded byFouad Goraieb
- 6. Physical Layer-SwitchingUploaded byPalashAhuja
- Statement of PurposeUploaded bypriyatimmon
- MultiplexingUploaded byJason
- Network DesignUploaded byEdwin Raul Sanchez Hiciano
- Testi 8Uploaded bybimi
- TeleTraffic for BeginnersUploaded bySaadat Rehman
- IT Support Analyst CVUploaded byalbertus_adrian_1
- NPM Administrator GuideUploaded byseyedone
- Chapter 1 Managing the Digital FirmUploaded byzakia_poomun
- High Performance NetworksUploaded bykarthickklr32
- TopAccess GuideUploaded byatif385
- Datasheet-Guidewire-GuidewireLiveSecurityUploaded bySaiKiran Tanikanti
- Minimize DfaUploaded byJaved Mala
- RTN 950 V100R011C10 Product Description 02.pdfUploaded byCorreat
- C1006 Chapter 6Uploaded byfeezy1
- wanarch.pdfUploaded byEngr Ayaz Khan
- Module C Power Point > ModC_ch02_engUploaded byapi-3812894
- Ciss100.Com-Wide Area NetworkingUploaded byKashif Amjad
- Telecommunications and NetworksUploaded bymmikakz
- eric munoz resumeUploaded byapi-332581468
- Zohaib Shaikh - IT-NetworkingUploaded bycdeeky
- ch1Uploaded byNomad1971
- TH OF COMPUTATION DEC 2002Uploaded byapi-3782519
- MB0039-Business Communication.docxUploaded bySanjeev Kumar Singh
- dudakUploaded bySocaciu Viorica
- Interviewing SrUploaded byParvez Qureshi
- a2Uploaded byapi-414562140
- Raudra TimetableUploaded bySumanth_Yedoti

- 93104v00 RF Whitepaper-finalUploaded bySrinivas Chary
- low-overhead dynamic tcamUploaded byAnon543
- 185077074 CommunicationUploaded byalirrehman
- EFM-0109.pdfUploaded byTestronicparts
- lab4Uploaded bymrgrace1
- Sailor Fbb 500 User ManualUploaded byNikita Ryabchuk
- Speed CastUploaded bytelesatellitepor
- Prognostic Monitoring of Mobile PatientsUploaded byIRJET Journal
- mehran.pdfUploaded byMehran
- HP 3585A DatasheetUploaded byFloren Delgado
- PE - 1973-02Uploaded byAnonymous kdqf49qb
- BT601F Intelligent Dispensing Peristaltic PumpUploaded bydernivaljr
- Ece 496 Assignment4Uploaded byPolitik Itu Kejam
- MULTIPLEXINGUploaded byLarish Landicho
- 5358651-1en rev.8[386]Uploaded byPatriciaAraujo
- X-10 Automatizacion Del Hogar Usando El PIC16F877A. Burroughs, J. (2000). AN236Uploaded byEuro Fuenmayor
- Cisco Switching FamilyUploaded byDmytro Borovyk
- Simple Telecom SystemUploaded byShowkat Hossen Sabuj
- Capacitor Bank SchneiderUploaded bySaran Sri
- Advanced Motion Controls DPRAHIE-100A400Uploaded byServo2Go
- 30bq040pbf - Schottky IRUploaded byisc44242
- Routine_AAM spring 2017.docUploaded byAhmed Al Mansur
- ISB23B 909 01 English ManualUploaded byKeith Rodgers
- Introduction to advanced OSUploaded byPrathamesh Kshirsagar
- EZOSD RSSI CalibrationUploaded byKittikun Jitpairod
- uCOS pptUploaded bykishan1234
- 1734-SG001D-EN-P - September 2010Uploaded byjesusortegav
- Foundation Network 1Uploaded byNantawan Gantong
- M-Track - User Guide - V1.1Uploaded byEliton Pereira
- Adv.emb.(Using ARM)Uploaded byMohd Nafish