EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 1, Problem P9P
a.
Program Plan Intro
Circuit-switched network:
Circuit switched network is a process in which network nodes communicates with dedicated channel or circuit over the network. The data is divided into packets and transmitted over the network on requirement.
b.
Program Plan Intro
Packet-switched network:
Packet switched network is a process of aggregating the data packets to a single packet or device over the digital network. The data packets have a header which defines about the hardware used and a payload which is used in software applications.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Computer Networks
Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?
In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…
Computer Networks
Consider a packet of length L that begins at end system A and travels over three links to a
destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?
In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward…
Consider a network with a ring topology, link bandwidths of
100 Mbps, and propagation speed 2 × 108 m/s. What would the
circumference of the loop be to exactly contain one 1500-byte
packet, assuming nodes do not introduce delay? What would the
circumference be if there was a node every 100 m, and each node
introduced 10 bits of delay?
Chapter 1 Solutions
EBK COMPUTER NETWORKING
Ch. 1 - What is the difference between a host and an end...Ch. 1 - The word protocol is often used to describe...Ch. 1 - Why are standards important for protocols?Ch. 1 - Prob. R4RQCh. 1 - Prob. R5RQCh. 1 - Prob. R6RQCh. 1 - Prob. R7RQCh. 1 - Prob. R8RQCh. 1 - Prob. R9RQCh. 1 - Prob. R10RQ
Ch. 1 - Prob. R11RQCh. 1 - What advantage does a circuit-switched network...Ch. 1 - Prob. R13RQCh. 1 - Prob. R14RQCh. 1 - Prob. R15RQCh. 1 - Prob. R16RQCh. 1 - Prob. R17RQCh. 1 - Prob. R18RQCh. 1 - Suppose Host A wants to send a large file to Host...Ch. 1 - Prob. R20RQCh. 1 - Prob. R21RQCh. 1 - Prob. R22RQCh. 1 - What are the five layers in the Internet protocol...Ch. 1 - Prob. R24RQCh. 1 - Prob. R25RQCh. 1 - Prob. R26RQCh. 1 - Prob. R27RQCh. 1 - Prob. R28RQCh. 1 - Equation 1.1 gives a formula for the end-to-end...Ch. 1 - Prob. P3PCh. 1 - Prob. P4PCh. 1 - Prob. P5PCh. 1 - This elementary problem begins to explore...Ch. 1 - Prob. P7PCh. 1 - Suppose users share a 3 Mbps link. Also suppose...Ch. 1 - Prob. P9PCh. 1 - Prob. P10PCh. 1 - In the above problem, suppose R1 = R2 = R3 = R and...Ch. 1 - Prob. P13PCh. 1 - Consider the queuing delay in a router buffer. Let...Ch. 1 - Prob. P15PCh. 1 - Prob. P16PCh. 1 - Prob. P17PCh. 1 - Prob. P20PCh. 1 - Prob. P21PCh. 1 - Prob. P22PCh. 1 - Prob. P23PCh. 1 - Prob. P24PCh. 1 - Prob. P25PCh. 1 - Prob. P26PCh. 1 - Prob. P27PCh. 1 - Prob. P28PCh. 1 - Prob. P29PCh. 1 - Prob. P30PCh. 1 - Prob. P31PCh. 1 - Prob. P32PCh. 1 - Prob. P33PCh. 1 - Prob. P34P
Knowledge Booster
Similar questions
- Consider 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_forwardEach question is a judgment question. Write down your answer with T for True, F for False, and give theexplanation if the answer is False.a. Consider a system of bandwidth 10Mbps, with multiple users, each is active (i.e., have data to transmitat rate 1Mbps) with a low probability, e.g. 0.1. From the capacity perspective, packet switching isbetter than circuit switching because the former can support more users.b. Denial of Service (DoS) attack can be generated by a large number of (legitimate) TCP connectionrequests to the same targeted server at the same time. These TCP requests can be originated fromdifferent hosts in a botnet, which is controlled by the attacker.c. In VSAT systems the micro-stations do not have sufficient power to communicate directly with oneanother; hence, they use a ground station called a hub with a high gain antenna to relay traffic.d. In the current Internet, communication across the Atlantic Ocean between the USA and Europe ismostly done by wireless…arrow_forwardA telephone modem is used to connect a personal computer to a host computer. The speed of the modem is 56 kbps, the one-way propagation delay is 100 ms, the packet size is 256 bytes, and the probability of an error in a packet is 10^-4. Find the efficiency of stop-and-wait ARQ. What window size N is needed to keep the channel busy when there are no transmission errors. For this window size finds the efficiency of the go-back-N and selective repeat protocols. Note: Correct and detailed answer will be Upvoted else downvotedarrow_forward
- In a network, two systems are connected and the distance between the system is 5000 km. The propagation speed of the medium is 2 x 107 m/s. The bandwidth of the network is 500 MBps. If the average packet size is 108 bits and the network is used to its full capacity. The minimum size of the sequence number field is n bits. The processing delay at nodes is 0 ms. What is the value of n in case of Go-Back-N sliding window protocol?arrow_forwardConsider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?arrow_forwardSuppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.arrow_forward
- 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?arrow_forward2. 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")?arrow_forwardAssume a wireless network consists of an access point (denoted as X) and two wireless nodes (denoted as A and B respectively). Assume that wireless nodes A and B cannot hear each other's transmissions, but they can hear X (i.e. X can hear A and B). Suppose ● ● At time 0 µs, X is sending a packet to some other node and it completes sending this packet at time 100 µs. At time 20 µs, a packet becomes available for transmission at A. A needs 150 μs to send this packet. At time 60 µs, a packet becomes available for transmission at B. B needs 100 µs to send its packet. Let the value of the backoff timer for A be 40 µs and the value of the backoff timer for B be 60 μs. 1) Sketch the above described topology to include wireless nodes X, A, B, and their coverage. You may use tools such as Word, Paint, Visio, etc. to complete this topology.arrow_forward
- 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_forwardA 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_forwardConsider a broadcast channel with N nodes and a transmission rate of R bps. Suppose the broadcast channel uses polling (with an additional polling node) for multiple access. Suppose the amount of time from when a node completes transmission until the subsequent node is permitted to transmit (that is, the polling delay) is dpoll. Suppose that within a polling round, a given node is allowed to transmit at most Q bits. What is the maximum throughput of the broadcast channel?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