Name
Abstract | ||
|---|---|---|
Understanding how packets are routed in Internet is significantly important to Internet measurement and modeling. The conventional solution for route simulation is based on the assumption of unweighted shortest path. However, it has been found and widely accepted that a packet in Internet is usually not transmitted along the unweighted shortest path between its source and destination. To better simulate the routing behavior of a packet, we thoroughly explore the real-world Internet routes and present a novel local information based simulation model, with a tuning parameter, which assigns weights to links based on local information and then simulates the Internet route with weighted shortest path. Comparisons with baseline approaches show its capability in well replicating the route length distribution and other structural properties of the Internet topology. Meanwhile, the optimal parameter of this model locates in the range of (0, 2), which implies that a packet inside the Internet inclines to move to nodes with small degrees. This behavior actually reflects the design philosophy of Internet routing, balancing between network efficiency and traffic congestion. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Default-free zone,Equal-cost multi-path routing,Link-state routing protocol,Internet traffic engineering,Computer science,Constrained Shortest Path First,Computer network,Source routing,Default route,Distributed computing,K shortest path routing |
DocType | Volume | Citations |
Journal | abs/1409.7984 | 0 |
PageRank | References | Authors |
0.34 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingming Chen | 1 | 11 | 1.65 |
| Jichang Zhao | 2 | 326 | 22.52 |
| Xiao Liang 0004 | 3 | 0 | 0.34 |
| Ke Xu | 4 | 1433 | 99.79 |