Assume that a SONET receiver resynchronizes its clock whenever a 1 bit appears; otherwise, the receiver samples the signal in the middle of what it believes is the bit's time slot. (a) What relative accuracy of the sender's and receiver's clocks is required in order to receive correctly 48 zero bytes (one ATM cell's worth) in a row? (b) Consider a forwarding station A on a SONET STS-1 line, receiving frames from the downstream end B and retransmitting them upstream. What relative accuracy of A's and B's clocks is required to keep A from accumulating more than one extra frame per minute?

Assume that a SONET receiver resynchronizes its clock whenever a 1 bit appears; otherwise, the receiver samples the signal in the middle of what it believes is the bit's time slot. (a) What relative accuracy of the sender's and receiver's clocks is required in order to receive correctly 48 zero bytes (one ATM cell's worth) in a row? (b) Consider a forwarding station A on a SONET STS-1 line, receiving frames from the downstream end B and retransmitting them upstream. What relative accuracy of A's and B's clocks is required to keep A from accumulating more than one extra frame per minute?

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

Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, at which time (in seconds) does the first bit arrive at the switch connecting link 1 and link 2?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
not handwritten A 3000-km long, 1 Mbps link is used to transmit 1000-bit data packets using the Selective Repeat protocol. If the speed of light in this link is 2 x 105 km/second. What is the minimum number of bits the sequence numbers should be? Assume no flow control, and negligible transmission and processing times for acknowledgments. (Take 1M = 1000,000.)
Consider a network with a data rate of 10 Mbps. Messages sent on this network have a maximum size of 1000 bits, including a 16-bit control field. What is the number of messages required to send a file F of 4 Mbits from one station to another? Assuming that a station cannot send a new message until it receives an acknowledgment of the successful reception of the previously sent message. The acknowledgment takes the form of a 16-bit message. A timer is set to a duration T after the sending of each message. If time T expires before receiving an acknowledgment, the sending station resends the same message. The distance between the two farthest stations in the network is 1 km. The signal propagation speed is v = 200,000 km/s. What is the minimum value of T? (You ignore the queuing time and the processing time and use only the propagation time and the transmission time)
Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
Data Communication & Computer Network Suppose that Jon's and Jenny's computers are connected by an 8 Kbps link (note, 1 Kbps = 103 bps) that uses circuit switching and that Jon sent some number of bits to Jenny over the link. Suppose that circuit switching on the link connecting Jon’s and Jenny’s computers is implemented using Time Division Multiplexing (TDM), that a frame is 1 sec in duration, and that a frame consists of 16 slots. Jon is assigned one slot in every frame. Considering that it took 12 minutes for Jon to send all bits to Jenny, find how many bits were sent by Jon to Jenny.
q7- Consider a Code Division Multiple Access system in which transmitting users A, B & C have the codes (1 1 1 1 -1 -1 -1 1), (1 1 1 1 1 1 1 1) and (1 1 1 -1 1 1 1 1) respectively similar to the Walsh codes of other users. The receiver intends to receive data transmitted by user C a) Find the bit transmitted if A, B are transmitting 1 and C is idle Result is 6, hence output is 1 Result is -14, hence output is 0 Result is 14, hence output is 1 Result is -6, hence output is 0 Result is Answer, hence output is Answer b) Find the bit transmitted if A, B and C are transmitting 1 Result is 6, hence output is 1 Result is -14, hence output is 0 Result is 14, hence output is 1 Result is -6, hence output is 0 Result is Answer, hence output is Answer
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
Computer Science Assume the length of each message is L=5, the access link has a speed of X=180 Mbps, and there are B=6 messages per second on average. What is the total average delay for receiving a message when no cache is used, i.e., the sum of LAN delay, access delay, and internet delay? Give your answer in milliseconds.
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?