EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 7, Problem P14P
Explanation of Solution
Chaining used in direct routing:
As in the section 7.7.2, suppose the chaining is used in indirect routing via home agent, the following events would occur:
- The node “A” will get the mobile node then “A” alerts the home agent that the mobile node currently visiting “A”. The datagram to the mobile is forwarded to the particular COA (care-of-address).
- The mobile node is moved to the node “B”. The foreign agent at node “B” will alerts the foreign agent at node “A” and in node “A” the mobile node is no longer stayed, but in fact is resident in node “B” and that has the specified care-of-address in node “B”. Forward the datagrams by the foreign agent in node “A” and it receives that are addressed to the mobile care-of-address in node “A” to the mobile care-of-address in node “B”.
- The mobile node is moved to the node “C”. The foreign agent at node “C” will alerts the foreign agent at node “B” and in node “b” the mobile node is no longer stayed, but in fact is resident in node “C” and that has the specified care-of-address in node “C”. Forward the datagrams by the foreign agent in node “B” and it receives that are addressed to the mobile care-of-address in node “B” to the mobile care-of-address in node “C”.
If the mobile node returns to the home agent or it goes offline, the datagram forwarding state must be maintained by the foreign agents in “A”, “B” and “C” are removed.
Chaining not used in direct routing:
Suppose the chaining is not used in indirect routing via home agent, the following events would occur:
- The node “A” will get the mobile node then “A” alerts the home agent that the mobile node currently visiting “A”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Part A: There are two different friends who want to send some informative data to each other. A friend Abdul Hadi first sends the data and check whether other friend, Abdul Basit is available or not.
The communication process is,
Abdul Hadi has to check the availability of Abdul Basit.
Abdul Hadi has sent three different information’s (frame 1 to 3), to Abdul Basit after positive response each time.
After all the successful communication, the session has been terminated by Abdul Hadi.
In your opinion, which one will be better choice from ENQ/ACK and Poll/Select? Draw the proper diagram of above scenario to support your answer.
Part A: There are two different friends who want to send some informative data to each other. A friend Abdul Hadi first sends the data and check whether other friend, Abdul Basit is available or not.
The communication process is,
Abdul Hadi has to check the availability of Abdul Basit.
Abdul Hadi has sent three different information’s (frame 1 to 3), to Abdul Basit after positive response each time.
After all the successful communication, the session has been terminated by Abdul Hadi.
In your opinion, which one will be better choice from ENQ/ACK and Poll/Select? Draw the proper diagram of above scenario to support your answer.
Part B: Refer to above scenario, also draw the diagram for Stop and Wait method in Flow Control.
Part C: Refer to above scenario of Part A; if the acknowledgement has been lost of data 2 during transmission and Abdul Hadi could not receive this then what will happen? Draw the appropriate diagram for Sliding Window ARQ by using Go-Back-n method
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.56
Chapter 7 Solutions
EBK COMPUTER NETWORKING
Ch. 7 - Prob. R1RQCh. 7 - Prob. R2RQCh. 7 - Prob. R3RQCh. 7 - Prob. R4RQCh. 7 - Prob. R5RQCh. 7 - Prob. R6RQCh. 7 - Prob. R7RQCh. 7 - Prob. R8RQCh. 7 - Prob. R9RQCh. 7 - Prob. R10RQ
Ch. 7 - Prob. R11RQCh. 7 - Prob. R12RQCh. 7 - Prob. R13RQCh. 7 - Prob. R14RQCh. 7 - Prob. R15RQCh. 7 - Prob. R16RQCh. 7 - Prob. R17RQCh. 7 - Prob. R18RQCh. 7 - Prob. R19RQCh. 7 - Prob. R20RQCh. 7 - Prob. R21RQCh. 7 - Prob. R22RQCh. 7 - Prob. R23RQCh. 7 - Prob. P1PCh. 7 - Prob. P2PCh. 7 - Prob. P3PCh. 7 - Prob. P5PCh. 7 - Prob. P6PCh. 7 - Prob. P7PCh. 7 - Prob. P8PCh. 7 - Prob. P10PCh. 7 - Prob. P11PCh. 7 - Prob. P12PCh. 7 - Prob. P13PCh. 7 - Prob. P14PCh. 7 - Prob. P15PCh. 7 - Prob. P16P
Knowledge Booster
Similar questions
- 1 (a) Consider the situation as mentioned below: Alice, from his host “A" wants to send an email to Bob's host "B" where, the service providers for Alice and Bob are AirTel and Reliance respectively. With suitable diagram, explain the different process that happens during the entire communication between the hosts assuming the Alice was working with "Windows" and Bob was working with “Linux" platform.arrow_forwardAssume there is a Certificate Authority (CA) with a well-known public key. Further assume every user is issued a certificate for his/her public key. For convenience, we use PKu and SKu to represent user’s public key and private key, respectively. Draw diagrams to answer the following questions. a) Suppose Alice wants to send a large secret message M to Bob. Describe how Alice should send M in an authenticated way. b) Assume Bob receives the message sent by Alice. Describe how Bob should process the message. c) Suppose Alice needs to send a number of large secret messages to Bob. Alice would like to avoid signing digital signatures for all these messages. Develop a protocol for Alice and Bob so that all the messages can be sent in a confidential and authenticated way. Briefly describe the intuition of your protocol first and then draw a diagram.arrow_forwardConsider a set of mobile computing clients in a certain town who each need to be connected to one of several possible base stations. Suppose there are n clients, with the position of each client specified by its (x, y) coordinate in the plane. There are also k base stations; the position of each of these is also specified by its (x, y) coordinate in the plane. For each client, we wish to connect it to exactly one of the base stations. Our choice of connections is constrained in the following ways: (i) there is a range parameter r, and a client can only be connected to a base station that is within distance r, (ii) there is a load parameter L, and no more than L clients can be connected to any single base station. Your goal is to design a polynomial time algorithm for the following problem – given the above data, decide whether it is possible to assign every client to a base station subject to the two constraints.arrow_forward
- Imagine that a two-way handshake rather than a three-way handshake were used to set up connections. In other words, the third message was not required. Are deadlocks now possible? Give an example or show that none exist.arrow_forwardLet's assume we have ten people standing around in a circle. Each person may speak only to the person on his or her right. Any time a person hears something from the left, he or she must immediately repeat it to the person on his or her right, and the person who originated a message expects to hear what he or she originally said to the person on his or her right be eventually repeated by the person on his or her left. That way, it is certain that the message got through the group without any errors. Being a real time analogy for one of the multiple access technique and local area technology. Identify it and explain its working and frame format in detail.arrow_forward. Suppose that a system uses PKI based on a tree-structured hierarchy of CAS. Alice wants to communicate with Bob, and receives a certificate from Bob signed by a CA X after establishing a communication channel with Bob. Suppose Alice has never heard of X. What steps does Alice take to verify that she is talking to Bob?arrow_forward
- Give an example of activities of the last network construction. (A must finish before B can start, and A and C must finish before D can start.arrow_forwardThe message validation server is able to validate two types of messages - type A and type B messages correspondingly. It is commonly believed that the validation time of type B message is somewhat longer than the validation of type A message. Additionally, it's commonly believed that the actual validation time depends largely only on the type of messages (A and B types) and doesn't depend in an essential amount on the message content. However, nobody hasn't checked these claims in practice. We have reliable statistics for four different sessions: • 1st session - 17,648 of type A messages and 11,414 type B messages were validated, session lasted 6 minutes and 7.90 seconds. . 2nd session - 6836 of type A messages and 12,618 type B messages were validated, session lasted 4 minutes and 23.80 seconds. • 3rd session - 24,616 of type A messages and 17,648 type B messages were validated, session lasted 8 minutes and 56.10 seconds. . 4th session - 10,684 of type A messages and 12,684 type B…arrow_forwardLet's consider the operation of a learning switch in the context of a network in which 6 nodes labeled A through Fare star connected into an Ethernet switch. Suppose that (i) B sends a frame to E, (ii) E replies with a frame to B, (i) A sends a frame to B, (iv) B replies with a frame to A. The switch table is initially empty. Show the state of the switch table before and after each of these events. For each of these events, identify the link(s) on which the transmitted frame will be forwarded, and briefly justify your answers.arrow_forward
- Suppose N people want to communicate with each of N – 1 other people using symmetric key encryption. All communication between any two people, i and j, is visible to all other people in this group of N, and no other person in this group should be able to decode their communication. How many keys are required in the system as a whole? Now suppose that public key encryption is used. How many keys are required in this case?arrow_forward2. Recall the concept of Physically Unclonable Functions, which are an importantcomponent of hardware based security. Here is a simple scenario and simple protocol usingPUFs for authenticating a tag. In the protocol below, the Reader stores ALL possiblecombinations of Challenge-Response pairs for every tag it needs to authenticate. Duringauthentication, the Reader broadcasts the ID of the tag, and a greeting (Gn ). Every tag maysee this message, but only the one with the right ID will process the message. The right tagwith the ID in the message will then feed the greeting to its PUF and compute the responseSn. The response is then sent to the Reader. This should be clear from the Figure below. Forthe next round of authenticating the same Tag, the process repeats with a new Greeting(G n+1 ). Since the Reader has the responses, authentication is straightforward. Recall thatChallenges and Responses are typically 128 or 256 bit strings for RFIDs.From the protocol, and class, it should be…arrow_forward25. When a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.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