Abstract
An agent-based dynamic routing strategy for a generic automated material handling systems (AMHS) is developed. The strategy employs an agent-based paradigm in which the control points of a network of AMHS components are modelled as cooperating node agents. With the inherent features of route discovery a set of shortest and near-shortest path, an average-flow route selection algorithm is developed to scatter the load of an AMHS. Their performance is investigated through a detailed simulation study. The performance of the proposed dynamic routing strategy is benchmarked with the shortest path algorithm. The results of the simulation experiments are presented and their performance compared under a number of performance indices including the hop count, flow and ability to balance network loading.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ash, G.R.: Dynamic Routing in Telecommunication Networks. McGraw-Hill, New York (1998)
Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: Proceedings of IEEE Multi Topic Conference: Technology for the 21st Century, pp. 62 – 68 (2001)
Chen, T., Gerla, M.: Global State Routing: A new routing scheme for ad hoc wireless networks. In: Proceedings of IEEE International conference of communication (1998)
Boppana, R. V., Konduru, S. P.: An adaptive distance vector routing algorithm for mobile, ad hoc networks. In: Proceedings of 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1753–1762 (2001)
Wang, L., Zhang, L. F., Shu, Y. T., Dong, M.: Multi-path source routing in wireless ad hoc networks. In: Proceedings of Canadian Conference on Electrical and Computer Engineering, vol. 1, pp. 479–483 (2000)
Marzo, J. L., Calle, E., Scoglio, C., Anjali, T.: QoS online routing and MPLS multi-level protection: A survey. IEEE Communications Magazine, 126–132 (2003)
Wang, F.K., Lin, J.T.: Performance evaluation of an automated material handling system for a wafer fab. Robotics and Computer Integrated Manufacturing 20, 91–100 (2004)
Griss, M.L., Pour, G.: Accelerating development with agent components. IEEE Computation Magazine 35(5), 37–41 (2002)
Evans, J. R., Minieka, E.: Optimization Algorithms for Networks and Graphs. M. Dekker, New York, 2nd edition (1992)
Chen, Z., Berger, T.: Performace Analysis of Random Routing algorithm for n-D connected networks. In: Proceedings of the IEEE Region 10 Annual International Conference 1993, pp. 233–236 (1993)
Qi, W. D., Dong, M., Shen, Q. G., Chen, H.: How smooth is Smoothed Round Robin. In: Proceedings of International Conference on Communication Technology 2003, pp. 421–428 (2003)
Gokhale, S. S., Tripathi, S. K.: Routing metrics for best-effort traffic. In: Proceedings of Eleventh International Conference on Computer Communications and Networks, pp. 595–598 (2002)
Elsayed, K.M.F.: A framework for end-to-end deterministic-delay service provisioning in multiservice packet networks. IEEE Transactions on Multimedia 7(3), 563–571 (2003)
Sobrinho, J.L.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. IEEE/ACM Transactions on Networking 10(4), 541–550 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, A.K.S., Efstathiou, J., Lau, H.Y.K. (2007). A Load Scattering Algorithm for Dynamic Routing of Automated Material Handling Systems. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-74377-4_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74376-7
Online ISBN: 978-3-540-74377-4
eBook Packages: Computer ScienceComputer Science (R0)