Q 1. In asynchronous transfer mode (ATM) (a communications protocol used on backbonenetworks), data are organized into cells of 53 bytes. How many ATM cells can be transmitted in10 seconds over a link operating at the following rates?i) 128 kilobits per second (1 kilobit = 1000 bits)ii) 300 kilobits per secondiii) 1 megabit per second (1 megabit =1,000,000 bits) Q 2. A battle between four players of the martial arts is under way. The following facts areknown:(e) The good Lord Alpha will not survive if the evil Count Gamma survives(f) Either the evil Count Delta will die, or the good Lord Beta will die(g) Lord Alpha is the master of Kung Fu, while none of the other three are masters, and it is a factthat a master can only be beaten by another master(h) Count Gamma will die if and only if either Lord Alpha dies or Count Delta diesExactly two players survive. Who are they?

Q 1. In asynchronous transfer mode (ATM) (a communications protocol used on backbone networks), data are organized into cells of 53 bytes. How many ATM cells can be transmitted in 10 seconds over a link operating at the following rates? i) 128 kilobits per second (1 kilobit = 1000 bits) ii) 300 kilobits per second iii) 1 megabit per second (1 megabit =1,000,000 bits)

Q 1. In asynchronous transfer mode (ATM) (a communications protocol used on backbone networks), data are organized into cells of 53 bytes. How many ATM cells can be transmitted in 10 seconds over a link operating at the following rates? i) 128 kilobits per second (1 kilobit = 1000 bits) ii) 300 kilobits per second iii) 1 megabit per second (1 megabit =1,000,000 bits)

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

Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
Assume a shared connection of 1 Mbps (for example, an Ethernet bus). How long does it take (in microseconds) to transmit a 1000-bit frame over this connection?
Suppose there is a shared link (e.g. Ethernet bus) of 1 Mbps. How much time is needed (in microseconds) to transmit a 1000 bits long frame on this link?
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…
Skype is a well‑known VoIP system used not only for peer‑to‑peer conversations but also for audio and video conferencing involving three or more callers. Assume a video conference with a central server on Skype has N callers, and each caller generates a constant data stream at rate r bps. How many bits per second does the call initiator need to send? How many bits does each of other N‑1 callers need to send?
Find correct answers referes to data and networking communication: 1. In ethernet frame, sending adapter encapsulates IP datagram (or other network layer protocol packet) and it uses preamble whick consists of :a. 4 bytes with pattern 10101010 followed by one byte with pattern 10101011.b. 7 bytes with pattern 1010111 followed by one byte with pattern 10101011.c. 2 bytes with pattern 10101010 followed by one byte with pattern 10101011.d. 7 bytes with pattern 10101011 followed by one byte wit pattern 10101010.e. 6 bytes with pattern 10101010 followed by one byte with pattern 10101011.f. 7 bytes with pattern 10101011 followed one byte with pattern 10101010.g. 7 bytes with pattern 10101010 followed by one byte with pattern 10101011. 2. The method of communication in which transaction takes place in both directions but only in one direction at a time is called?a. three answers are correctb. two answers are correctc. Multi-duplexd. Full-duplexe. four wire circuitf. simplexg. half-duplexh.…
Q. Determine the efficiency of a token ring with a data rate of 250Mbps, a ring latency of120 µsec and 5000 bit packets. Assume N hosts want to transmit and each host holds the token for a maximum of frame transmission time.
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?
Topic: Network Delay Assume two hosts, A and B, that are linked by a single link with a rate of R bps and are spaced m meters away from one another. A packet of size L bits is being sent from Host A to Host B. Suppose that the propagation through the connection is occurring at s meters/second. (Answer the following question while showing work) 1) When d-prop is bigger than d-trans, where is the packet's first bit at time t = d-trans? 2) At time t = d-trans, where d-prop is less than d-trans, where is the packet's first bit?
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
The following character encoding is used in a data link protocol: A: 01000111; B: 11100011; FLAG: 01111110; ESC: 11100000 Show the bit sequence transmitted in binary for the four character frame: A B ESC FLAG when each of the following framing methods is used: a) Character count b) Flag bytes with byte stuffing c) Starting and ending flag bytes, with bit stuffing. Please solve within 30 minutes. Asap.
Consider sending real-time data from Host A to Host B over a packet-switched network. Host A takes an 8-bit measurement every millisecond, and Host A collects these into 64-byte packets. There is one link between Hosts A and B; its transmission rate is 5 Mbps, its propagation delay is 2 × 108 meters/sec, and its length is 3 km. As soon as Host A gathers a packet, it sends the packet to Host B. How much time elapses from the time that Host A begins to take the first measurement in a packet until the entire packet reaches Host B?