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.
|Publication status||Published - 2005|
|Event||25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005 - Columbus, OH, United States|
Duration: 6 Jun 2005 → 10 Jun 2005
|Conference||25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005|
|Period||6/06/05 → 10/06/05|