Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
87
Voted
IPL
2007
55
views
more
IPL 2007
»
Name-independent compact routing in trees
15 years 3 months ago
Download
www.cs.tufts.edu
Kofi A. Laing
Real-time Traffic
IPL 2007
|
claim paper
Related Content
»
Compact routing with name independence
»
Name independent routing for growth bounded networks
»
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
»
A space lower bound for nameindependent compact routing in trees
»
On Compact Routing for the Internet
»
Compact Multicast Routing
»
Oblivious lowcongestion multicast routing in wireless networks
»
Compact roundtrip routing with topologyindependent node names
»
Collective Tree Spanners and Routing in ATfree Related Graphs
more »
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2007
Where
IPL
Authors
Kofi A. Laing
Comments
(0)
Researcher Info
IPL 2008 Study Group
Computer Vision