Routing in telecommunications networks with ant-like agents
IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Looking up data in P2P systems
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
This conceptual paper presents the Ant-based Data Traffic Splitting (ADTS) that uses self-organizing nodes with peer-to-peer properties. ADTS is an addition to the conventional ant-based routing, which belongs to the new defined application-based routing class, whose prime importance is showed by this paper, too. The publication transforms latest biological test results by Dirk Helbing et al. [1] into the field of computer science: If a main path of walking ants is narrowed, natural ants will chose a second path on a given fork. Therefore, if no transmission capacity is available, ADTS nodes will split the data traffic autonomously. Local algorithms realize an interaction of a node only with its direct neighbors inside an ADTS system; this new approach facilitates the organization of large distributed networks. ADTS offers an opportunity to increase the data throughput in nets by automatic path splitting, too. ADTS is divided into two variants, which this paper shortly describes: the Preventive ADTS (PADTS) and the Stream-oriented ADTS (SADTS).