EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem P33P
a.
Explanation of Solution
Given: Consider the data center in the figure “6.30” supports both e-mail and video distribution among other applications. Both the e-mail and video contains 4 racks of servers each. All the racks lie below single tier-2 switch.
To find: Time that the e-mail and video application uses the 4th rack.
Solution:
The fraction of time that the email and video applications uses the 4th rack is
b.
Explanation of Solution
Given: Consider the data center in the figure “6.30” supports both e-mail and video distribution among other applications. Both the e-mail and video contains 4 racks of servers each. All the racks lie below single tier-2 switch.
To find: Fraction of time that the e-mail and video application uses the 4th rack if both has independent usage.
Solution:
The probability to get the fraction of time that the e-mail and video application needs the 4th rack if both has independent usage is given below:
c.
Explanation of Solution
Given: Consider that the application can have a shortage of servers (for 0.001% of time).
To find:
Solution:
Consider that the 1st three racks are allotted for videos and the 4th rack is shared among both the video and e-mail...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Consider Figure 2.12, for which there is an institutional network connected to the Internet. Suppose that the average object size is 1,000,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use ∆/(1 - ∆b), where ∆ is the average time required to send an object over the access link and b is the arrival rate of objects to the access link.
Find the total average response time.
I get ∆=1000000/15000000= 1/15, then
∆/(1 - ∆b)= (1/15)/(1-(1/15)*16)=-1, so the finally answer is :
3+(-1)=2s or 3+0=3s?
Consider a local network containing 10 hosts. How many links are required in total for the following organization:
1) a full-mesh organization;
2) a bus organization;
3) a star organization.
1. Build a Router network which has three Generic
Routers and totally of Six networks in it. From each
Router the required switch shall be connected
through Fast Ethernet port and the switch is
connected to two users. On the whole there are '6'
networks in the configuration.
Along with the network diagram do the packet
transfer in simulation mode and write results
for three different combinations.
Chapter 6 Solutions
EBK COMPUTER NETWORKING
Ch. 6 - Consider the transportation analogy in Section...Ch. 6 - If all the links in the Internet were to provide...Ch. 6 - Prob. R3RQCh. 6 - Prob. R4RQCh. 6 - Prob. R5RQCh. 6 - Prob. R6RQCh. 6 - Prob. R7RQCh. 6 - Prob. R8RQCh. 6 - Prob. R9RQCh. 6 - Prob. R10RQ
Ch. 6 - Prob. R11RQCh. 6 - Prob. R12RQCh. 6 - Prob. R13RQCh. 6 - Prob. R14RQCh. 6 - Prob. R15RQCh. 6 - Prob. R16RQCh. 6 - Suppose the information content of a packet is the...Ch. 6 - Suppose the information portion of a packet (D in...Ch. 6 - Prob. P4PCh. 6 - Prob. P5PCh. 6 - Prob. P6PCh. 6 - Prob. P7PCh. 6 - Prob. P8PCh. 6 - Prob. P9PCh. 6 - Prob. P10PCh. 6 - Prob. P11PCh. 6 - Prob. P12PCh. 6 - Prob. P13PCh. 6 - Prob. P14PCh. 6 - Prob. P15PCh. 6 - Prob. P16PCh. 6 - Prob. P17PCh. 6 - Prob. P18PCh. 6 - Prob. P19PCh. 6 - Prob. P20PCh. 6 - Prob. P21PCh. 6 - Prob. P22PCh. 6 - Prob. P23PCh. 6 - Prob. P24PCh. 6 - Prob. P25PCh. 6 - Prob. P26PCh. 6 - Prob. P27PCh. 6 - Prob. P32PCh. 6 - Prob. P33P
Knowledge Booster
Similar questions
- Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answerarrow_forward4. The original HTTP protocol used TCP/IP as the underlying protocol. For each page, graphic, or applet, a separate TCP connection was constructed, used, and terminated. This caused several problems: one referred to as the elephant and mice problem and two aspects of connection overhead. Describe both problems. Why were separate connections used? Would UDP rather than TCP be a good alternative? What solution would you propose to these problems to improve HTTP performance?arrow_forwardA packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,500 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forward
- Consider the throughput example. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2, Rs3,Rs4 ,Rc1 ,Rc2 ,Rc3, Rc4 and R for the rates of the server links, client links, and network link. Assume all other links have abundant capacity and that there is no other traffic in the network besides the traffic generated by the 4 client-server pairs. Question: Assume that for i = {1,2,3,4}, Rsi = Rci = R , assume that all routers have infinite buffercapacity, meaning that packets are never dropped and are eventually forwarded by a router. Whatis the throughput for the Client Server pair 1? What is the throughput for Client Server pair 3?arrow_forwardIt is theoretically feasible for two hosts to communicate with one another by sending packets back and forth over the same connection. Please enumerate all of the components that are responsible for the overall amount of time required to process a single packet, starting to end. Is it to be anticipated that one of the delays will continue for a certain amount of time, while the duration of the other delay will be more unpredictable?arrow_forwardConsider 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?arrow_forward
- A single connection has the capability to transmit multiple packets between hosts. This inquiry seeks to elucidate the concept of freight processing times. Is there a fixed duration for one delay while the other can be modified?arrow_forwardAssignment 5: Both TCP and UDP are widely used IP transfer layer protocols. For applications requiring reliable transfers, TCP is generally preferred, while applications that value throughput more than reliability are best served using UDP. Most TCP/IP stacks provide both protocols, so the application can use whichever transfer protocol is more appropriate, even changing from one to the other as desired. Rather than rely solely on TCP, the network system developer might want to investigate the trade-offs related to use of UDP. Based upon the analysis list out why Some TCP/IP Applications Use UDP?arrow_forwardQUESTION 77 Consider the network topology shown below with routers labeled A through F, inclusive. Each link is labeled with its "cost" for routing purposes. The link state routing algorithm is used in this network. (a)Show how Djikstra's algorithm works to compute paths from Router E to all other routers (show your answer in a table format similar to the one used in the lectures). (b)Show the final forwarding table at Router E after completion of the algorithm.arrow_forward
- 2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?arrow_forwardSuppose Host A wants to send a large 8 million bytes of file to Host B. The path from Host A to Host B has three links, of rates R1 = 1.5 Mbps, R2 = 2 Mbps, and R3 = 1 Mbps. Assuming no other traffic in the network. Roughly how long will it take to transfer the file to Host B?arrow_forwardConsider the throughput example presented in the figure below. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2, Rs3,Rs4 ,Rc1 ,Rc2 ,Rc3, Rc4 and R for the rates of the server links, client links, and network link. Assume all other links have abundant capacity and that there is no other traffic in the network besides the traffic generated by the 4 client-server pairs. Question:derive a general expression for throughput for the Client Server pair 1, in terms of Rsi, ,Rciand R.arrow_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