NDLI: Using multi-objective domain optimization for routing in hierarchical networks

Content Provider	IEEE Xplore Digital Library
Author	Manousakis, K. McAuley, T. Morera, R. Baras, J.
Copyright Year	2005
Description	Author affiliation: Inst. for Syst. Res., Maryland Univ., College Park, MD, USA (Manousakis, K.)
Abstract	Network hierarchy makes network protocols more scalable and robust, but also makes the network more complex and reduces performance. With routing protocols, hierarchy reduces overhead, routing table size, and convergence time, but can also cause sub-optimality (stretch) of the routing path length compared to the flat networks. With OSPF, for example, adding routing areas, with route aggregation done in area border routers, can significantly reduce link state advertisements, link state database and convergence time, but can also increase interarea path length. Existing research has produced many excellent intra- and inter-domain routing schemes and different proposals for aggregation at border routers. As important, however, is the design of the routing hierarchy itself. This paper presents quantified comparisons of different hierarchical construction techniques for a simple hierarchical routing protocol in a 100 node network. When the hierarchy does not take into account routing path length suboptimality, we show the potential for significant stretch (e.g., on average more than doubling the shortest path for nodes under 6 hops apart). When we use multi-objective optimization, that includes the goal of minimizing stretch, the stretch is significantly reduced (e.g., reducing the stretch by approximately 50% for the above example). In large or dynamic environments, a modified simulated annealing is able to produce optimized hierarchies quickly by trading a small loss in optimality for a large reduction in optimization time. The paper analyzes the choice of multi-objective cost function in this environment and concludes that simpler functions produce the best overall results.
Starting Page	1460
Ending Page	1465
File Size	2948343
Page Count	6
File Format	PDF
ISBN	0780393058
DOI	10.1109/WIRLES.2005.1549628
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-06-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scalability Space technology Government Collaboration Bandwidth Size measurement Routing protocols Robustness Delay Convergence
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Designing OSPF Routing Areas to Meet Diverse End-to-End Performance

Domain based hierarchical routing for large heterogeneous MANETs

Adaptive tree-based recovery for scalable reliable multicast

A Shim6-Based Dynamic Path-Selection Mechanism for Multi-homing

Virtual Direction Routing for overlay networks

On hierarchical routing in wireless sensor networks

A novel routing approach for WCDL backbones

Application of GA and Multi-objective Optimization for QoS Routing in Ad-Hoc Networks

New topology aggregation mechanisms for delay-bandwidth sensitive networks

Using multi-objective domain optimization for routing in hierarchical networks

Similar Documents

Designing OSPF Routing Areas to Meet Diverse End-to-End Performance

Domain based hierarchical routing for large heterogeneous MANETs

Adaptive tree-based recovery for scalable reliable multicast

A Shim6-Based Dynamic Path-Selection Mechanism for Multi-homing

Virtual Direction Routing for overlay networks

On hierarchical routing in wireless sensor networks

A novel routing approach for WCDL backbones

Application of GA and Multi-objective Optimization for QoS Routing in Ad-Hoc Networks

New topology aggregation mechanisms for delay-bandwidth sensitive networks

Using multi-objective domain optimization for routing in hierarchical networks