17824 bits of data is to be transferred from a station A to station B. Assume a call setup time of 0.01 seconds for a switching network. Calculate the total data times needed when the following switching technology are used: (a) Virtual circuit and datagram packet switching. [The stations are separated by 3 hops (1 hop=4km), the signal propagation speed is 2000 km/s and the line capacity for each hop is 2400bps. Assume that each packet is 512 bits long with only 12 bits of overhead.]

17824 bits of data is to be transferred from a station A to station B. Assume a call setup time of 0.01 seconds for a switching network. Calculate the total data times needed when the following switching technology are used: (a) Virtual circuit and datagram packet switching. [The stations are separated by 3 hops (1 hop=4km), the signal propagation speed is 2000 km/s and the line capacity for each hop is 2400bps. Assume that each packet is 512 bits long with only 12 bits of overhead.]

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

17824 bits of data is to be transferred from a station A to station B. Assume a call setup time of 0.01 seconds for a switching network. Calculate the total data times needed when the following switching technologies are used: (a) Circuit switching; (b) Virtual circuit and datagram packet switching. The stations are separated by 3 hops (1 hop=4km), the signal propagation speed is 2000 km/s and the line capacity for each hop is 2400bps. Assume that each packet is 512 bits long with only 12 bits of overhead.
17824 bits of data is to be transferred from a station A to station B. Assume a call setup time of 0.01 seconds for a switching network. Calculate the total data times needed when the following switching technologies are used: (i) Circuit switching; (ii) Virtual circuit and datagram packet switching. The stations are separated by 3 hops (1 hop=4km), the signal propagation speed is 2000 km/s and the line capacity for each hop is 2400bps. Assume that each packet is 512 bits long with only 12 bits of overhead.
A TCP connection is established through 10 wireless hops in an acoustic underwater ad hoc network. Assume that each hop is 100 meter in the average, acoustic signals travel 1500 meter per second, 10 kilobit data can be sent per second over a link, the source node has one megabyte of data to send, the receiver window size is 64 kilobytes, the maximum segment size is 1 kilobyte and the average processing delay for routing at each node is one millisecond. Assume also that the following segments do not reach the destination: 67, 112, 137. What would be the average utilization of the links for this connection if there is not another communications through them? Explain an alternative approach to increase the bandwidth utilization?
Assume that the propagation speed in a coaxial cable is 2 ∙108 m/s a. Packets are transmitted using the ABP (alternate bit protocol) over a full-duplex 5-km coaxial cable with a 5 Mbps transmission rate. The packets and ACKs are 1500 bits long. The transmitter and receiver use a CRC chip and their processing time is negligible. How many packets are transmitted every second when there is no transmission error? b. Five transmission lines identical to the one discussed in a) are connected in series. A buffer is used at each connection between the links to store packets as required. How many packets will go through the five lines every second when there are no transmission errors? Now assume that a packet or its acknowledgement is corrupted on any given link with probability p. What is the new packet transmission rate through the five links? Comment. Assume the processing delays and queuing delays for both ends are negligible.
A 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions: a. What is the minimum length of a contention slot in μsec? b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…
5 points Find the latency of Token Ring (in bits) where data rate of link is 20 Mbps and 40 stations separated by 100 meters and bit delay at each station is 1 bit. (Assume propagation speed as 2x105 m/sec)
19 10 Mbps half-duplex ethernet network consists of two segments connected by a repeater. It introduces a delay corresponding to a transmission time of 4 bytes. The signal speed in both segments is shown in the figures. The length of one segment is fixed. Calculate the permissible length of the second segment, taking into account only the collision detection mechanism delay 4 bytes 1500 m ? m v=200 000 v=250 000 km/s km/s 2505 m 3700 m 3985 m 3725 2925 m 2002 m 4250 m 1325 m 525 m 3005 m none of the above
Consider the following design problem concerning implementation of virtual-circuit service. If virtual circuits are used internal to the subnet, each data packet must have a 3-byte header and each router must tie up 8 bytes of storage for circuit identification. If datagrams are used internally, 15-byte headers are needed but no router table space is required. Transmission capacity costs 1 cent per 106 bytes, per hop. Very fast router memory can be purchased for 1 cent per byte and is depreciated over two years, assuming a 40-hour business week. The statistically average session runs for 1000 sec, in which time 200 packets are transmitted. The mean packet requires four hops. Which implementation is cheaper, and by how much?
Consider two nodes, A and B are attached to opposite ends of an 1200 meter cable with signal propagation speed is 2 x 10^8 m/sec. Frame size used by both nodes is 1500 bits including header and preambles. Assume transmission rate is 100 Mbps and there are four switches between node A and B each insert 20 bit delay as a processing time in addition to store and forward delay. If only A has packet to send, then the time taken to reach A's packet at B is?
What is the delay of sending a data file from a source station to a destination station? Suppose that the length of the data file is 2 Mbytes and the bandwidth of the channel is 1600 bps, and the network link between the sender and receiver is 20000 Km and the speed of the light inside the link is 2x108 meters/second? Assume that the delay is composed of only transmission time and propagation time.
Design a leaky bucket (LB) scheme to police the traffic flow on a user line in an ATM network to ensure the following traffic contract: Peak Cell Rate (PCR) = 22 cells/millisecond Sustainable Cell Rate (SCR) = 11 cells/millisecond Maximum Burst Size (MBS) = 4 cells Consider the line on which the leaky bucket scheme is installed to have a speed of ? = 88 cells/millisecond and the leak rate of every leaky bucket used to be 1 liquid unit per cell time. Also, assuming that the user continuously sends traffic at 88 cells/millisecond (i.e., at the speed of the line, thereby violating the contract), draw a diagram to show the output traffic pattern of every leaky bucket used in your scheme.
A TCP PDU of length 40,513 octets (including the TCP header) is to be transmitted over a physical link between two nodes at 1,064,218,818 bps using 802.3 with an MTU of 826 octets. Assume a LLC-PDU has an overhead of 4 octets and that the IP-PDU has no options. i) How many bits are sent over the connection from the source to destination assuming only full frames are sent? ii) What is the effective data rate from the TCP-PDU point of view (to nearest integer)? iii) If the propagation time between the two nodes is 5 microseconds what is the line efficiency to 3 decimal places assuming stop and wait is used between the two nodes?