Please use this identifier to cite or link to this item: http://ktisis.cut.ac.cy/handle/10488/1049
Title: Bandwidth clustering for reliable and prioritized network routing using split agent-based method
Authors: Mavromoustakis, Constandinos X.
Karatza, Helen D.
Issue Date: 2005
Publisher: IEEE Computer Society
Source: Distributed Computing Systems Workshops, 2005. 25th IEEE International Conference on, pp. 89-94
Abstract: 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.
URI: http://ktisis.cut.ac.cy/handle/10488/1049
http://172.16.21.12:8080/jspui/handle/10488/1049
http://hdl.handle.net/10488/1049
ISBN: 0769523285
DOI: 10.1109/ICDCSW.2005.46
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Show full item record

Page view(s)

4
checked on Mar 24, 2017

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons