By Topic

Bandwidth clustering for reliable and prioritized network routing using split agent-based method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mavromoustakis, C.X. ; Dept. of Informatics, Aristotelian Univ. of Thessaloniki, Greece ; Karatza, H.D.

Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resources. While several centralized schemes have been proposed for efficient path marking and capacity reservation, the decentralized approach is one of the motivating reasons for employing adaptive behavior of swarm-based agents. Algorithmically complex problems such as reliable network routing need to be faced with a dynamically adaptive approach. In this work the bandwidth clustering method is presented, a method developed using the split agent-based routing technique (SART). The SART method is applied in the network, performing path marking activating at the same time the bandwidth clustering method by which nodes within paths are clustered with respect to several levels of available bandwidth. A path freshness degree is estimated and modeled in order to ensure reliability of data traffic flow. Thorough examination is carried out for the performance, path survivability and recoverability using a SART-bandwidth clustering scheme.

Published in:

Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference on

Date of Conference:

6-10 June 2005