EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 7, Problem P10P
a.
Program Plan Intro
LTE:
- The LTE is the combination of time division multiplexing and frequency division multiplexing on the downstream channel.
- In LTE, every mobile node is allocated one or more 0.5 ms time slots in one or more of the channel frequencies.
Given:
The A, B, C and D are the four nodes are reachable from the base station at rates of 10 Mbps, 5 Mbps, 2.5 Mbps and 1 Mbps on the downstream channel. The base station can send more amount of data to any of the node among these four nodes using F frequencies.
b.
Program Plan Intro
LTE:
- The LTE is the combination of time division multiplexing and frequency division multiplexing on the downstream channel.
- In LTE, every mobile node is allocated one or more 0.5 ms time slots in one or more of the channel frequencies.
Given:
The A, B, C and D are the four nodes are reachable from the base station at rates of 10 Mbps, 5 Mbps, 2.5 Mbps and 1 Mbps on the downstream channel. The base station can send more amounts of data to any of the node among these four nodes using F frequencies.
c.
Program Plan Intro
LTE:
- The LTE is the combination of time division multiplexing and frequency division multiplexing on the downstream channel.
- In LTE, every mobile node is allocated one or more 0.5 ms time slots in one or more of the channel frequencies.
Given:
The A, B, C and D are the four nodes are reachable from the base station at rates of 10 Mbps, 5 Mbps, 2.5 Mbps and 1 Mbps on the downstream channel. The base station can send more amounts of data to any of the node among these four nodes using F frequencies.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Consider a full-duplex 512 kbps link with length 36,000Km connecting two hosts. The data frames carry a useful payload of size 6000 bits. Assume that both ACK and data frames have 400 bits of header information, and that ACK frames carry no data. The propagation speed along this link is 3×108 m/sec. a) What is the RTT on this link? b) What is the effective useful data throughput, in kbps, when using Stop-and-Wait?
2. Consider a bus-topology network with five stations. A reservation access method is used. Each
station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1
microsecond = 106 second). For each station, one data transmission sends 1000 bits. The
transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit
"Mbps")?
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?
Chapter 7 Solutions
EBK COMPUTER NETWORKING
Ch. 7 - Prob. R1RQCh. 7 - Prob. R2RQCh. 7 - Prob. R3RQCh. 7 - Prob. R4RQCh. 7 - Prob. R5RQCh. 7 - Prob. R6RQCh. 7 - Prob. R7RQCh. 7 - Prob. R8RQCh. 7 - Prob. R9RQCh. 7 - Prob. R10RQ
Ch. 7 - Prob. R11RQCh. 7 - Prob. R12RQCh. 7 - Prob. R13RQCh. 7 - Prob. R14RQCh. 7 - Prob. R15RQCh. 7 - Prob. R16RQCh. 7 - Prob. R17RQCh. 7 - Prob. R18RQCh. 7 - Prob. R19RQCh. 7 - Prob. R20RQCh. 7 - Prob. R21RQCh. 7 - Prob. R22RQCh. 7 - Prob. R23RQCh. 7 - Prob. P1PCh. 7 - Prob. P2PCh. 7 - Prob. P3PCh. 7 - Prob. P5PCh. 7 - Prob. P6PCh. 7 - Prob. P7PCh. 7 - Prob. P8PCh. 7 - Prob. P10PCh. 7 - Prob. P11PCh. 7 - Prob. P12PCh. 7 - Prob. P13PCh. 7 - Prob. P14PCh. 7 - Prob. P15PCh. 7 - Prob. P16P
Knowledge Booster
Similar questions
- Question 6: Consider a 5 Km, 10Mbps, shared Ethernet segment running CSMA/CD protocol with Station A at one end, Station D at the other, and Stations B and C equally spaced between A and D. Assume bits propagate through the link at speed 200,000Km/sec; and assume the frames sent on this segment have all 10,000 bytes. A B с D a) If A sends a frame to D, what is the transmission time of this frame? Show your detailed work b) What is the efficiency of the CSMA/CD protocol used in this LAN? Show your detailed workarrow_forward6. Suppose two nodes, A and B, are attached to opposite ends of an 800 m cable, and that they each have one frame of 1,500 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time t=0. Suppose there are four repeaters between A and B, each inserting a 20-bit delay. Assume the transmission rate is 100 Mbps, and CSMA/CD with backoff intervals of multiples of 512 bits is used. After the first collision, A draws K=0 and B draws K=1 in the exponential backoff protocol. Ignore the jam signal and the 96-bit time delay. (a) What is the one-way propagation delay (including repeater delays) between A and B in seconds? Assume that the signal propagation speed is 2.108 m/sec. (b) At what time (in seconds) is As frame completely delivered at B? (c) Now suppose that the repeaters are replaced with switches/routers. That is, each switch incurs a store-and-forward delay in addition to the 20-bit time delay. Also, suppose that only A has a frame to send…arrow_forwardConsider the following Aloha systems.(a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Poisson rateof one 1000-bit packet every 100 sec, even if the previous one has not yet been sent. What is themaximum value of N (Hint: The pure Aloha maximum channel utilization is 18.4%)? (b) Ten thousand airline reservation stations are competing for the use of a single slotted Alohachannel. The average station makes 18 requests/hour. A slot is 125 μsec. What is the approximatetotal channel load (requests per slot)?arrow_forward
- Figure 3(c) d) Assume that, in a Stop-and-Wait ARQ system, the bandwidth of the line is 5 Mbps, and 1 bit takes 80 ms to make a round trip. Calculate its bandwidth-delay product. ii. Determine and discuss the utilization percentage of the link if the system data frames are 1200 bits in length. Solve for the utilization percentage of the link if we have a protocol that can send up to 48 frames before stopping and worrying about the acknowledgments.arrow_forwardThe following figure shows that, using relays can extend communication distances. Assume the Decode-and-Forward relays are utilized, and application traffic is FTP/TCP. The peak Throughput (TP) is 42 Mbps for a single Access Point (AP) without using relays. Briefly explain why the peak Throughput (TP) drops to around 20 Mbps using 1 relay, around 14 Mbps using 2 relays and approximate 10 Mbps using 3 relays.arrow_forwardWe have a 4 km down CSMA / CD channel with a capacity of 10 Mbps. Assume the average is negotiablelength interval 2 ∗ ∆? and that the propagation rate is 2 ∗ 10^8 m/s What is the minimum length of frames that are transmitted over a given CSMA / CD network?arrow_forward
- A data channel at 5 Gbps is shared by two users. Assume that each user is transmitting at 2.5Gbps data rate continuously. Each user only transmits only 30% of the time. (a) If circuit switching is used, how many users can be supported? (b) If packet switching is used, would there be queuing delay to accommodate these two users? If a third identical user is added will there be a queuing delay? (c) What is the probability that a user is sending data? (d) Now assume three users under packet switching. Compute the probability that at any given time all three are transmitting at the same time. What is the fraction of time when the queue is growing?arrow_forwardConsider a network which uses a frame size oTRlo send data on a 1.5 Mbps link with a one-way latency of 50 msec. In order to increase link utilization to 60%, determine the minimum number of bits required to be transmitted using an effective flow control protocol such that less latency is achieved. Explain the approach and determine the latency / throughput for user defined service. 988 x 151arrow_forwardConsider two systems are connected with LAN cable. The length of the cable is 3 kilometers and the data transmitted at a rate of 30 MB/s. The signal speed in the cable is 2.5 x 108 m/s. What is the minimum frame size in bits in the CSMA/CD network?arrow_forward
- 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?arrow_forwardA packet with 88MB long is generated at node A and sent to node C through node B. The distance betẃeen A and B is 6500km, distance between B and C is 880km in this arrangement. Data rate between A and B is 100kbs. The propagation delay is 2.9µ/km. Determine the minimum data required between data rate required between node B and C so that the buffer of node B are not flooded.arrow_forwardFrames 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.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole