Advanced search
2 files | 917.41 KB Add to list

Robust geometric forest routing with tunable load balancing

Rein Houthooft (UGent) , Seyedeh Sahel Sahhaf (UGent) , Wouter Tavernier (UGent) , Filip De Turck (UGent) , Didier Colle (UGent) and Mario Pickavet (UGent)
(2015) IEEE INFOCOM. p.1382-1390
Author
Organization
Abstract
Although geometric routing is proposed as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms, it still lacks: i) adequate mechanisms to trade stretch against load balancing, and ii) robustness to cope with network topology change. The main contribution of this paper involves the proposal of a family of routing schemes, called Forest Routing. These are based on the principles of geometric routing, adding flexibility in its load balancing characteristics. This is achieved by using an aggregation of greedy embeddings along with a configurable distance function. Incorporating link load information in the forwarding layer enables load balancing behavior while still attaining low path stretch. In addition, the proposed schemes are validated regarding their resilience towards network failures.
Keywords
WIRELESS NETWORKS, IBCN

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 585.19 KB
  • 6261 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 332.22 KB

Citation

Please use this url to cite or link to this publication:

MLA
Houthooft, Rein et al. “Robust Geometric Forest Routing with Tunable Load Balancing.” Ieee Infocom. 2015. 1382–1390. Print.
APA
Houthooft, R., Sahhaf, S. S., Tavernier, W., De Turck, F., Colle, D., & Pickavet, M. (2015). Robust geometric forest routing with tunable load balancing. IEEE INFOCOM (pp. 1382–1390). Presented at the 34th IEEE Conference on Computer Communications (INFOCOM).
Chicago author-date
Houthooft, Rein, Seyedeh Sahel Sahhaf, Wouter Tavernier, Filip De Turck, Didier Colle, and Mario Pickavet. 2015. “Robust Geometric Forest Routing with Tunable Load Balancing.” In Ieee Infocom, 1382–1390.
Chicago author-date (all authors)
Houthooft, Rein, Seyedeh Sahel Sahhaf, Wouter Tavernier, Filip De Turck, Didier Colle, and Mario Pickavet. 2015. “Robust Geometric Forest Routing with Tunable Load Balancing.” In Ieee Infocom, 1382–1390.
Vancouver
1.
Houthooft R, Sahhaf SS, Tavernier W, De Turck F, Colle D, Pickavet M. Robust geometric forest routing with tunable load balancing. IEEE INFOCOM. 2015. p. 1382–90.
IEEE
[1]
R. Houthooft, S. S. Sahhaf, W. Tavernier, F. De Turck, D. Colle, and M. Pickavet, “Robust geometric forest routing with tunable load balancing,” in IEEE INFOCOM, Hong Kong, China, 2015, pp. 1382–1390.
@inproceedings{5962786,
  abstract     = {Although geometric routing is proposed as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms, it still lacks: i) adequate mechanisms to trade stretch against load balancing, and ii) robustness to cope with network topology change. 

The main contribution of this paper involves the proposal of a family of routing schemes, called Forest Routing. These are based on the principles of geometric routing, adding flexibility in its load balancing characteristics. This is achieved by using an aggregation of greedy embeddings along with a configurable distance function. Incorporating link load information in the forwarding layer enables load balancing behavior while still attaining low path stretch. In addition, the proposed schemes are validated regarding their resilience towards network failures.},
  author       = {Houthooft, Rein and Sahhaf, Seyedeh Sahel and Tavernier, Wouter and De Turck, Filip and Colle, Didier and Pickavet, Mario},
  booktitle    = {IEEE INFOCOM},
  isbn         = {9781479983810},
  issn         = {0743-166X},
  keywords     = {WIRELESS NETWORKS,IBCN},
  language     = {eng},
  location     = {Hong Kong, China},
  pages        = {1382--1390},
  title        = {Robust geometric forest routing with tunable load balancing},
  year         = {2015},
}

Web of Science
Times cited: