Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. Topologically complex networks must use efficient routing methods in order to route data traffic from a source to a destination. In this paper the Split Agent-based Routing Technique (SART) is applied to a network in which a certain amount of data traffic is injected to mark different paths. Split Agent-based Routing Technique (SART)  is a variant of swarm-based routing [9, 22] where agents are split after their departure to the next node on a hop-by-hop basis at the same time performing path marking. Packets that are delay sensitive are marked as prioritized. Agents recognize these packets as being a part of, and try to influence the two way routing tables. Thorough examination has been done for the performance and path recoverability using SART algorithm for marking any requested path, taking into account a number of metrics. It is shown that the split agent scheme offers an efficient on demand path marking and path-capacity reservation in a decentralized manner (particularly efficient for large scale networks). SART method undoubtedly represents a solution for significant network optimization particularly for the equal share of network resources. Also it is shown that this scheme offers a way to increase overall performance.
|Title of host publication||Proceedings of the Second International Workshop on Challenges of Large Applications in Distributed Environments|
|Number of pages||10|
|Publication status||Published - 2004|
|Event||of Large Applications in Distributed Environments - Honolulu, HI, United States|
Duration: 7 Jun 2004 → 7 Jun 2004
|Other||of Large Applications in Distributed Environments|
|Period||7/06/04 → 7/06/04|