EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P22P
Program Plan Intro
WFQ:
- Weighted Fair Queueing is
algorithm that is flow based. - It performs two activities simultaneously and they are:
- It reduces the response time by scheduling the traffic to the front of queue.
- It shares the bandwidth that is remaining between the bandwidth flows that are high.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
2. On a p-node linear array there are two packets at each node to begin
with. Assume p is even. Packets at node 1 are destined for node + 1,
packets at node 2 are destined for + 2, and so on. Let each packet
take the shortest path from its origin to its destination. Compute the
routing time for this problem under the following priority schemes:
farthest origin first, farthest destination first, FIFO, and LIFO.
Please explain VERY DETAILED this question
After running Dijkstra's algorithm in a link state protocol, a router Xdetermines that the predecessor of A is Y, the predecessor of Z is X, and thepredecessor of Y is Z. What is the path from X to A?
Ans: X->Z->Y->A
For nodes 0000 and 1111, there exists four node-disjoint paths of length 4 (which happens to be the hamming distance between them). These paths are listed as travel from source 0000 through dimension 0-1-2-3 or 1-2-3-0 or 2-3-0-1 or 3-0-1-2 to the destination 1111.
Question 1: how many node-disjoint paths between nodes 0000 and 1010 and what are their length?
Question 2: for any two arbitrary nodes with the hamming distance r, how many node-disjoint paths among them with the distance r and what are they?
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
- Describe the Split-Horison and Split-Horison with Poison Reverse heuristics used by RIP. Explain how they address the problem of routing loops.arrow_forwardAn input string S of length N is transferred through the network using a special protocol. The protocol can send the string through a series of operations. In one operation, we can choose a lowercase english alphabet and do one of the following: Transfer 1 copy of C through the network. Transfer 2 copies of C through the network. Each of the above transfers take 1 unit of time. Find the minimum time in which we can transfer the entire string S through the network. Note: Please Answer Python only Input 1 5 cbcdc Output 5arrow_forwardLet G = (V, E) represent a p-node, degree-d network. Any oblivious routing algorithm for routing p packets in G needs (√p/d) time in the worst case.arrow_forward
- Provided graph G=(N,E), in which N denotes the collection of routers and E, the collection of links. Calculate the least costly route from node U to all other nodes using Dijkstra's link-state routing mechanism, and then display the final lowest graph from U?arrow_forwardIn the generic SR protocol, the sender transmits a message as soon as it is available (if it is in the window) without waiting for an acknowledgment. Suppose now that we want an SR protocol that sends messages two at a time. That is, the sender will send a pair of messages and will send the next pair of messages only when it knows that both messages in the first pair have been received correctly.Supposethat the channel may lose messages but will not corrupt or reorder messages. i) Outline an error-control protocol for the unidirectional rdt of messages. ii) Give an FSM description of the sender and receiver. iii) Describe the format of the packets sent between sender and receiver and vice versa. iv) If you use any procedure calls other than those in SR protocol (for example, udt_send(), start_timer(), rdt_rcv(), and so on),clearly state their actions. v) Give an example (a timeline trace of sender and receiver) showing how your protocol recovers from a lost packetarrow_forwardWhat is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.arrow_forward
- If the WFQ mechanism is used in scheduling the following queues. When does each packet leave the system. ((i, h) means h-th packetof the i-th queue). The weight of the i-th queue is twice the weight of the queues k, j and it must be serviced twice. The size of each input packet is specified on it. Qk A 25 3 2 A A 1 0 WFQ 0- 1 unit/sec Arrival timearrow_forwardWe observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster than the input line rate. Suppose all packets have the same duration, n packets are sent to n entry ports at the same time, and all n packets are sent to separate exit ports. What is the maximum delay for a memory packet?arrow_forwardIn an RPC-like protocol, where numerous requests can be active at the same time and responses can be given in any sequence, the following is possible: Pretend requests are sequentially numbered, and that ACKIN] confirms the receipt of reply[N]. Should the number of ACKS be cumulative? If not, what should happen in the event that an ACK is not received?|arrow_forward
- In 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_forward2. Find the costs of the cheapest paths from all nodes to F using Bellman-Ford algorithm. Show your work. В 3 4 3 A 1 F D Earrow_forwardIN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.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