EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P6P
a)
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.
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
The maximum transmission unit on an Ethernet link is 4500 bytes. This means that the IP packets
sent over Ethernet cannot be larger than 4500 bytes including the IP header. Suppose the
application layer sends a 6500-byte message. The transport layer uses TCP with no options. The
network layer is using IP version 4. Obviously, the IP layer will have to fragment the data.
Provide the length of new datagrams (after fragmentation). Provide the Flag and offset of each of the
new datagrams.
Maximum Transmission Unit (MTU): Longest prefix matching: IP Fragmentation:
Consider sending a 2,400-byte datagram into a link with a MTU of 900 bytes.
Suppose the original datagram has the identification number 422.
(a) How many fragments are generated?
(b) For each fragment, what is its size, what is the value of its identification, fragment
offset, and fragment flag?
Length
ID
Fragment Flag
Offset
Networking question:
Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011
Draw the graph of the
i. differential Manchester scheme
using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
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
- Given that you are to transfer a total datagram of size 28939 bytes over a network that has an MTU of 3038 bytes. The given header size is 38 bytes. (a) Calculate the total number of packets required to send this data. (b) What is the data size of the last packet? (c) What would be the header size of the 8th packet and the offset value of the 4th packet?arrow_forward1. A protocol uses hierarchical slotted TDM techniques for various levels of networks. For the purpose of this question, assume header/trailer overhead to be zero, use the different DLC frame sizes as given. In this question we consider only DLC frames. At the level of Local Area Networks (LANS) containing each individual computer, the links operate at 10 Mbps and the frames (L-frames) are each 1500 bytes long. The LANs link to Metropolitan Area Networks (MANS) which use 15000 byte M-frames that are made by multiplexing 10 L-frames, one each from 10 different LANs. Every ten of these MANS feed into a Regional Area Network (RAN) that uses 1 Gbps links and uses a R- frame, and ten RANS feed into a Wide Area Network (WAN) using a W-frame, which is 32 times the size of an R-frame. (a) The transmission time of a bit or group of bits is sometimes referred to as their "width" on the line. What is the width of an L-frame on a LAN link? (b) How wide is an L-frame (as embedded inside larger…arrow_forwardA new architecture, with N layers, is proposed. User application at the top layer generates a message of M bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes trailer. In this architecture, the message M is not divided into smaller packets at any layer. • What is the size of the final message (in bytes) transferred by the lower layer? • If we consider the headers and trailers to be an overhead, what is the percentage of such overhead to the total size of the final message?arrow_forward
- Given a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NICarrow_forwardAsaparrow_forwardA 3200 bit long TCP message is transmitted to the IP layer and becomes a datagram after adding a 160 bit header. The following Internet is connected by two LANs through routers. But the data part of the longest data frame that the second LAN can transmit is only 1200 bits. Therefore, datagrams must be segmented in the router. How many bits of data does the second LAN transmit to its upper layer?arrow_forward
- TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.arrow_forwardCompare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols.arrow_forwardTCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKS sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender att = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. t=1 T data segment t=2+ data segment data segment-- t=3 TCP sender TCP receiver t=4+ t=5+ data segment - data segment t=6+ t36 data segment t=7 data segment t=8 data segment t=9 ACK + t=10 k -- ACK t=11 t=11 t=12 t=12 t=13 t=13 t=14 ACK -ACK ACK t=15 t=16 t=17 ACK t=18 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.arrow_forward
- Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packetarrow_forwardP5. Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: (refer to first image) a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (refer to second image)arrow_forwardSuppose an extension of TCP allows window size much larger than 64 KB. Assume the extended TCP runs over a 100-Mbps link with RTT 100 ms, segment size is 1 KB, and receiving window size is 1 MB. How long does it take to send a 200 KB file?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
Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning