![]() | ||||||||||||||||||||
Go to Overview >> | ||||||||||||||||||||
Reading Instructions: | ||||||||||||||||||||
The first two links are compulsory reading and are overviews that will give a good hint of the basics of PPP. They are not enough to complete the lab, though. The other links are RFC's about every state in the "PPP-circle". The most important regions of the text are blue-colored to decrease the time spent on finding them. Below these links there are shortcut links to some frequent used parts of the RFC's. | ||||||||||||||||||||
Links to subjects in the documents above: Frame format | State graph LCP codes | LCP Configure-Request | LCP options | MRU | Magic Number | PAP | Authenticate codes | Authenticate-Request | IPCP codes | IP address | Bitstuffing | CRC calculation | Link termination | | ||||||||||||||||||||
PPP Quick Reference Guide. Print it out and bring to the lab! | ||||||||||||||||||||
Homework Problems | ||||||||||||||||||||
1. Assemble a complete LCP-frame with code set to Configure-Request and the following options: MRU, Authentication-Protocol (using PAP), Magic-number. CRC is not required. 2. Draw a diagram, see Figure 7.13 under link [2], showing the traffic between peer A and B starting with the frame in 1) till you reach OPENED in Establish state, see state graph. 3. The Identifier field in e.g. a LCP frame has a specific task. What is it? 4. What is possible to do when you have reached substate OPENED in Network state? 5. Draw the traffic between peer A and B in Network state till you reach substate OPENED. 6. Decode the IP-packet in fig. 1, by naming the fields. You may use this in the lab. | ||||||||||||||||||||
| ||||||||||||||||||||
| ||||||||||||||||||||
References |