ACM Home Page
Please provide us with feedback. Feedback
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks
Full text PdfPdf (77 KB)
Source International Conference On Emerging Networking Experiments And Technologies archive
Proceedings of the 2006 ACM CoNEXT conference table of contents
Lisboa, Portugal
POSTER SESSION: Poster session 1 table of contents
Article No. 39  
Year of Publication: 2006
ISBN:1-59593-456-1
Authors
Alessandro Ordine  Univ. Rome "Tor Vergata"
Fabio Feuli  Univ. Rome "Tor Vergata"
Giuseppe Bianchi  Univ. Rome "Tor Vergata"
Sponsors
: CISCO
: Fundacao para a Ciencia e Tecnologia
: Thomson
: ACM SIGCOMM
: Intel
Microsoft : Microsoft
: Associacao de Turismo de Lisboa
: E-Next
: ISCTE
: Camara Municipal de Lisboa
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 81,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1368436.1368483
What is a DOI?

ABSTRACT

This work presents a general layer-2 approach for routing and load balancing in Wireless Infrastructure Mesh Network The key idea is dynamic select routes among a set of slowly changing alternative network paths. Our approach decouples the routing and load balancing problem into two distinct sub-problems: path creation and path selection. Paths are created through the reuse of classical 802.1Q multiple spanning tree mechanisms. This guarantees that, for each formed tree, a path is deployed from each mesh node to the Mesh Gateway. Moreover, each tree (path) is assigned a Virtual LAN identifier. Path selection is driven by a local algorithm running at each mesh node, fed by measurements (taken along each path connecting the mesh node to the gateway) which allow to dynamically determine which are the best paths. In order to route a packet it is sufficient to mark the packet with the VLAN tag corresponding to the chosen path. The described approach provides a very general and flexible framework: performance/stability trade-offs can be tuned through the choice of i) the mechanism used to measure the path quality; ii) the algorithm employed to select the path, and iii) the system parameter used (link costs and link weights) for the multiple spanning tree formation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized Link State Routing Protocol. IEEE INMIC Pakistan, 2001.
 
3
C. E. Perkins et al. Ad hoc networking. Addison-Wesley Boston, 2001. Chapter: Ad hoc On-Demand Distance Vector Routing.
 
4
5
 
6
B. Awerbuch, D. Holmer, and H. Rubens. High throughput route selection in multi-rate ad hoc wireless networks. First Working Conference on Wireless On-demand Network Systems (WONS), 2004.
7
Collaborative Colleagues:
Alessandro Ordine: colleagues
Fabio Feuli: colleagues
Giuseppe Bianchi: colleagues