Abstract
The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today. Greedy routing, in which each node is assigned a locator used as a distance metric, recently received increased attention from researchers and is considered as a potential solution for scalable routing. In this paper, we propose LMD-A Local Minimum Driven method to compute the topology-based locator. As opposed to previous work, our algorithm employs a quasigreedy and self-organized embedding method, which outperforms similar decentralized algorithms by up to 20% in success rate. To eliminate the negative effect of the 'quasi' greedy property-transfer routes longer than the shortest routes, we introduce a two-stage routing strategy, which combines the greedy routing with source routing. The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage. Through extensive evaluations, based on synthetic topologies as well as on a snapshot of the real Internet AS topology, we show that LMD guarantees 100% delivery rate on large networks with a very low stretch.
Original language | English |
---|---|
Title of host publication | IEEE Symposium on Computers and Communications, ISCC 2013 |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 759-764 |
Number of pages | 6 |
ISBN (Electronic) | 9781479937554 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
Event | 18th IEEE Symposium on Computers and Communications, ISCC 2013 - Split, Croatia Duration: 7 Jul 2013 → 10 Jul 2013 |
Conference
Conference | 18th IEEE Symposium on Computers and Communications, ISCC 2013 |
---|---|
Country/Territory | Croatia |
City | Split |
Period | 7/07/13 → 10/07/13 |