EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P9P
a)
Program Plan Intro
Conversational voice and video-over-IP:
- The real time conversations that are made through internet are called as internet telephony and it is also called as VOIP (Voice over Internet Protocol).
- Conversional videos are similar where it includes the voice and video of the participants.
- The internet companies that uses conversational voice and video includes skype and google talk.
b)
Program Plan Intro
Conversational voice and video-over-IP:
- The real time conversations that are made through internet is called as internet telephony and it is also called as VOIP (Voice over Internet Protocol).
- Conversional videos are similar where it includes the voice and video of the participants.
- The internet companies that uses conversational voice and video includes skype and google talk.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Material must be played out in a specific time intervals in order to be correctly interpreted by the recipient. Real-time protocols take varying transit times to get from source to destination. Even if packets are sent with the correct intervals, they will arrive at the other end with varying arrival times. Jitter is referred to as a fluctuation of pause time. We can buffer the packets for jitter reduction Let us say that, for the sake of argument, the noise is random, and the buffer is adequate. Armed with this knowledge, tell us what other difficulties are there?
Material must be played out in a specific time intervals in order to be correctly interpreted by the recipient. Real-time protocols take varying transit times to get from source to destination. Even if packets are sent with the correct intervals, they will arrive at the other end with varying arrival times. Jitter is referred to as a fluctuation of pause time. We can buffer the packets for jitter reduction Let us say that, for the sake of argument, the noise is random, and the buffer is adequate. Armed with this knowledge, tell us what other difficulties we can face.
Consider a network connecting
two systems
located 4000 kilometers apart. The bandwidth of
the network is 500 x Mbps. The propagation
speed of the media is 4 × 106 meters per
second. It is needed to design a Go-Back-N
sliding window protocol for this network. The
average packet size is 107 bits. The network is to
be used to its full capacity. Assume that
processing delays at nodes are negligible. What
is the minimum size in bits of the sequence
number field?
Chapter 9 Solutions
EBK COMPUTER NETWORKING
Ch. 9 - Prob. R1RQCh. 9 - Prob. R2RQCh. 9 - Prob. R3RQCh. 9 - Prob. R4RQCh. 9 - Prob. R5RQCh. 9 - Prob. R6RQCh. 9 - Prob. R7RQCh. 9 - Prob. R8RQCh. 9 - Prob. R9RQCh. 9 - Prob. R10RQ
Ch. 9 - Prob. R11RQCh. 9 - Prob. R12RQCh. 9 - Prob. R13RQCh. 9 - Prob. P1PCh. 9 - Prob. P2PCh. 9 - Prob. P3PCh. 9 - Prob. P4PCh. 9 - Prob. P5PCh. 9 - Prob. P6PCh. 9 - Prob. P7PCh. 9 - Prob. P8PCh. 9 - Prob. P9PCh. 9 - Prob. P10PCh. 9 - Prob. P11PCh. 9 - Prob. P12PCh. 9 - Prob. P13PCh. 9 - Prob. P14PCh. 9 - Prob. P15PCh. 9 - Prob. P16PCh. 9 - Prob. P17PCh. 9 - Prob. P18PCh. 9 - Prob. P19PCh. 9 - Prob. P20PCh. 9 - Prob. P21PCh. 9 - Prob. P22P
Knowledge Booster
Similar questions
- A router receives packets from a group of users transmitting in a multiple access system by time division (TDMA), in which everyone uses the same frequency and transmit in instants of time many different. Assuming the packets arrive accordingly with the Poisson process at the rate of one packet every 4 ms (milliseconds) and assuming that the instants of Packet transmission time is exponentially distributed with a mean of 3 ms. Given this scenario, calculate:a)The average of packets on the system.(b) The average total system delay. (c) What percentage increase in the arrival rate results in a doubling of the delay average total calculated in part (a)?arrow_forwardGiven a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.arrow_forwardIn a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?arrow_forward
- Over a network using WEP, we were able to capture two frames with the sameInitialization Vector (IV). The following are the encrypted messages:• First frame encrypted message:1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 0 11 1 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0• Second frame encrypted message:1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 1 1 0 11 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0We also know that one of the messages is a control message with the following plaintext content:0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 01 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 01. Find the plaintext of the other message.2. If the captured messages were from two different stations on a network that usesTKIP, is it possible to find the plaintext of the other message? Explain why orwhy not possible.arrow_forwardConsider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.arrow_forwardComputer Science The probability that a packet is received in error is 0.6 in Selective Reject ARQ flow control protocol. What is the expected value for the total number of unsuccessful transmissions before the successful delivery of a packet?arrow_forward
- Suppose that we attempt to run the sliding window algorithm with SWS = RWS = 3 and with MaxSeqNum = 5. The Nth packet DATA[N] thus actually contains N mod 5 in its sequence number field. Give an example in which the algorithm becomes confused; that is, a scenario in which the receiver expects DATA[5] and accepts DATA[0]—which has the same transmitted sequence number in its stead. No packets may arrive out of order. Note that this implies MaxSeqNum ≥ 6 is necessary as well as sufficient.arrow_forwardUse the Route Inspection Algorithm to find a closed path of least distance that traverses all the roads, starting from A, then back to A. How long is this path?a=1, b=1, c=6, d=5, e=2, f=5.ab=1, bc=6, cd=30, de=10, ef=10, af=5.arrow_forwardWrite a program to simulate routing using ooding. Each packet should contain a counter that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, with each line handling one packet per time interval. Make three versions of this program: all lines are flooded, all lines except the input line are flooded, and only the (statically chosen) best k lines are flooded. Compare flooding with deterministic routing (k=1) in terms of both delay and the bandwidth used.arrow_forward
- When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56arrow_forwardConsider there are 4 stations in the token ring . There is only one packet in the ring. suppose if the station 1 holds the packet until it completes one revolution and return to it then what could be the token holding time(THT)arrow_forwardAsaparrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education