Capstone - 03 - Shortest Path Computation

More informationontraceroutecanbefoundonthewebeg

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: le ISP network, we can run Dijkstra’s shortest path algorithm (or similar algorithms) to figure out the “best” paths within the ISP network. But, the problem is that Internet paths go over many ISPs, and each ISP makes its (routing) decisions independently and without knowledge of other ISPs’ (routing) decisions. 34 So, how do ISPs relate to one another? Basically, there are two possible business relationships between ISPs: It is either a “customer‐provider” relationship where one ISP is a customer and the other is the provider (i.e., the customer gets internet connectivity by paying a fee to the provider), or else it is a “peer‐to‐peer” relationship (i.e., the two ISPs agree to exchange traffic without having to pay each other any fees). Typically, these peering relationships exist between the larger ISPs (e.g., AT&T peering up with Sprint). In a customer‐provider relationship, all Internet traffic (packets...
View Full Document

This note was uploaded on 02/10/2014 for the course CS 109 taught by Professor Azerbestavros during the Spring '13 term at BU.

Ask a homework question - tutors are online