Skip to main content

A New Problem-Solving Method for Multi-agent Systems and Computer Networks: Solitary Wave Propagation

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5227))

Included in the following conference series:

  • 1499 Accesses

Abstract

A new problem-solving method for multi-agent systems and computer networks is proposed, which transforms the problem-solving process into the parallel solitary wave propagation process in non-linear space.This paper discusses the basic principle of the solitary wave method and proves its properties theoretically. Due to the paper length limitation, the algorithm based on solitary waves and simulations are given in other related papers. The theoretical analysis and practical experiments show the advantages of the proposed method in terms of the high-degree parallelism, the suitability for complex environment, and the powerful processing ability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vedantham, S., Iyengar, S.: The Bandwidth Allocation Problem in The ATM Network Model Is NP-Complete. Information Processing Letters 65(4), 179–182 (1998)

    Article  MathSciNet  Google Scholar 

  2. Huang, Yin-Fu, Chao, Bo-Wei: A Priority-Based Resource Rllocation Strategy in Distributed Computing Networks. Journal of Systems and Software 58, 221–233 (2001)

    Google Scholar 

  3. Abdel-Wahab, H., Youssef, A., Maly, K.: Distributed Management of Exclusive Resources in Collaborative Multimedia Systems. In: Proceedings of 3rd IEEE Symposium on Computers and Communications, pp. 115–119. IEEE Press, Los Alamitos (1998)

    Google Scholar 

  4. Racz, A., Fias, N., Racz, P.: Effective Bandwidth And Associated CAC Procedure for Traffic Streams Multiplexed over a VBR Link. Computer Communications 24, 781–789 (2001)

    Article  Google Scholar 

  5. Shuai, D.X., Zhao, H.B.: A New Generalized Cellular Automata Approach to Optimization of Fast Packet Switching. Computer Networks 45(4), 399–419 (2004)

    Article  MATH  Google Scholar 

  6. Thomas, H.Y., Li, B., Shivendra, S.P., Henry, T.: On Network Bandwidth Allocation Policies And Feedback Control Algorithms for Packet Networks. Computer Networks 34, 481–501 (2000)

    Article  Google Scholar 

  7. Chandramathi, S., Shanmugavel, S.: Fuzzy-Based Dynamic Bandwidth Allocation for Heterogeneous Sources in ATM Network. Applied Soft Computing Journal 3(1), 53–70 (2003)

    Article  Google Scholar 

  8. Cheng, T.H., Sze, Y.K., Tan, C.W.: A Heuristic Algorithm for Allocating Virtual Path Bandwidth in an ATM Network. Computer Communications 22(9), 803–810 (1999)

    Article  Google Scholar 

  9. James, E.B., Teunis, J.O., Anthony, E.K., Karen, E.M.: Path Selection And Bandwidth Allocation in MPLS Networks. Performance Evaluation 52(2-3), 133–152 (2003)

    Article  Google Scholar 

  10. Ahn, K.M., Kim, S.H.: Optimal Bandwidth Allocation for Bandwidth Adaptation in Wireless Multimedia Networks. Computers and Operations Research 30(13), 1917–1929 (2003)

    Article  MATH  Google Scholar 

  11. Han, D.H., Park, C.G., Baik, K.H.: Performance Analysis of an AAL Multiplexer with Dynamic Bandwidth Allocation in an IP/ATM Environment. Computers and Operations Research 30(12), 1851–1864 (2003)

    Article  MATH  Google Scholar 

  12. Kelly, F.P.: Mathematical Modeling of the Internet, pp. 685–702. Springer, Berlin (2001)

    Google Scholar 

  13. Low, S.H.: A Duality Model of TCP And Queue Management Algorithms. IEEE ACM Trans. on Networking 11(4), 525–536 (2003)

    Article  MathSciNet  Google Scholar 

  14. Low, S.H., Paganini, F., Doyle, J.C.: Internet Congestion Control. IEEE Control Syst. Mag. 22(2), 28–43 (2002)

    Article  Google Scholar 

  15. Massonlie, L., Roberts, J.: Bandwidth Sharing: Objectives And Algorithms. IEEE/ACM Transactions on Networking 10(3), 320–328 (2002)

    Article  Google Scholar 

  16. Ito, A., Yano, H.: The Emergence of Cooperation in a Society of Autonomous Agents – The prisoner’s Dilemma Game under the Disclosure of Contract Histories. In: ICMAS 1995, San Francisco (1995)

    Google Scholar 

  17. Shehory, O., Kraus, S.: Methods for Task Allocation via Agent Coalition Formation. Artificial Intelligence 101, 165–200 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kraus, S., Jonathan, W., Gilad, Z.: Multiagent Negotiation under Time Constraints. Artificial Intelligence 75, 297–345 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shuai, D. (2008). A New Problem-Solving Method for Multi-agent Systems and Computer Networks: Solitary Wave Propagation. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

  • Online ISBN: 978-3-540-85984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics