Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Hierarchical Routing in Dynamic $\alpha$-Doubling Networks
 
report

Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

Tschopp, Dominique
•
Diggavi, Suhas  
•
Grossglauser, Matthias  
2007

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric properties, motivating the model for finite doubling dimension. Since wireless network bandwidth is precious, we consider communication cost required to set up the routing on such dynamic networks. We show that under appropriate modeling on time-changes of the dynamic network, we can build addressing with small total overhead and maintain routing with constant stretch for dynamic doubling metric networks.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

TDGdoubling.pdf

Access type

openaccess

Size

335.04 KB

Format

Adobe PDF

Checksum (MD5)

e8b965d64eb689436a3f7551888678ff

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés