ITT650hw9 - find the shortest path between each node of an...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Darrin Wright Due: November 13, 2011 ITT 650 P9.2. What is the difference between OSI and TCP/IP protocol models? Explain clearly. The OSI defines the total aspect of protocol definitions and is associated with additional documents that provide international standard aspects of data communication and networking. It allows communication between many different data systems. Compatibility based protocol layers. It has 7 different layers. (Standard model) The TCP/IP transfers data from one network device to another by using the internet. Have independent protocols that do not have to match one another when it comes to specific requirements (non-compatible). This protocol suite has 5 layers. (Custom model) P9.5. What is the difference between path-vector routing and shortest-path routing? Explain Clearly. Path-vector routing is a protocol consisting of entries on a routing table that contains the destination network, the next router, and the path to reach that destination. Shortest-path routing is the opposite of a distance vector protocol that uses algorithms to
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: find the shortest path between each node of an area. P9.15 What is the operational difference between standard ACKs used in conventional TCP and SACKs used in wireless TCP? What improvement in performance does it provide for wireless networks? The ACKs are sent to fix the host after its timestamp value is changed. Helps hide the wireless link errors from the fixed sender. The SACKs are send back by the TCP to inform the sender of the data has been received. After this, only missing data segments can be retransmitted by the sender. These operations improve time and clarification of actions taken in the wireless networks. P9.19 How many iterations are needed to calculate the shortest path to all nodes from node 3? Determine the shortest distance to each node and the path used for each one of them. 8 iterations are needed. Node 1: 2 Node 2: 5 Node 3: 0 Node 4: 3 Node 5: 3 Node 6: 3, 6(9) Node 7: 3,7 (10)...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online