1061 search results - page 27 / 213 » On Compact Routing for the Internet |
SIGMETRICS
2009
ACM
15 years 4 months ago
2009
ACM
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
FC
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
76
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
PDPTA
2008
14 years 11 months ago
2008
- The rising popularity of Mobile Computing creates new methods for accessing Web content. At the same time Really Simple Syndication (RSS) feed is another new trend of constantly ...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...