Network Routing
Andre N. Costa, Nigel Geoffrey Bean · 2012
This chapter describes the problem of network routing. A number of agent-based routing algorithms are described, followed by a discussion and comparison of the algorithms. The chapter focuses on algorithms for packet-switched networks, as these comprise the majority of mobile agent-based routing algorithms that have been proposed during the last decade. It proposes two alternative approaches for the future development of mobile agent-based routing algorithms. The chapter proposes that a desirable hybrid of the algorithms surveyed in it should 1. have the ability to perform multipath routing; 2. target the Wardrop equilibrium as its routing goal; and 3. have an off-policy exploration mechanism. We conclude by noting that the trade-off between adaptive behavior and stability, first identified in early adaptive algorithms for the ARPANET, remains a pertinent issue for mobile agent routing systems and is notoriously difficult to study within a theoretical domain. Controlled Vocabulary Terms ARPANET; telecommunication network routing