A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 anddoi:10.1109/iscc.2013.6755040 dblp:conf/iscc/WangXKU13 fatcat:pxyyic6jrfb55lynvn7wikypfq