Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 248))

  • 2279 Accesses

Abstract

Multi-Protocol Label Switching (MPLS) netwoks transfers the data whith the help of labels. MPLS creates "virtual links" between distant nodes. MPLS can encapsulate packets of various network protocols. In MPLS packet-forwarding decisions are made solely on the contents of this label, without the need to examine the packet itself. This allows to create end-to-end circuits using any protocol. Congestion Control and Congestion avoidence is the main task in Traffic Engineering. Slow Start, ECN, RED, AIMD are some of the techniques available for congestion management. This paper compares the response time in MPLS network using Ant Colony Optimization (ACO) technique to avoid congestion and gives good results in terms of response time.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Chou, C.T.: Traffic engineering for MPLS-based virtual private networks. Computer Networks 44, 319–333 (2004)

    Article  MATH  Google Scholar 

  2. Srivastava, S., van de Liefvoort, A., Medhi, D.: Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams. Computer Networks 53, 2688–2702 (2009)

    Article  MATH  Google Scholar 

  3. Palmieri, F.: An MPLS-based architecture for scalable QoS and traffic engineering in converged multiservice mobile IP networks. Computer Networks 47, 257–269 (2005)

    Article  Google Scholar 

  4. Boscoa, A., Bottab, A., Conteb, G., Iovannaa, P., Sabellaa, R., Salsanoc, S.: Internet like control for MPLS based traffic engineering: performance evaluation. Performance Evaluation 59, 121–136 (2005)

    Article  Google Scholar 

  5. Iovanna, P., Sabella, R., Settembre, M.: Traffic engineering strategy for multi-layer networks based on the GMPLS paradigm. IEEE Netw. 17(2), 28–37 (2003)

    Article  Google Scholar 

  6. Di Caro, G., Dorigo, M.: AntNet: A Mobile Agents Approach to Adaptive Routing. Tech. Rep. IRIDIA/97-12, Univ. Libre de Bruxelles, Brussels, Belgium (1997)

    Google Scholar 

  7. Schoonderwoerd, R., Holland, O., Bruten, J.: Ant like agents for load balancing in tele-communication networks. In: Proceedings of the First Int. Conf. on Autonomous Agents, pp. 209–216. ACM Press, New York (1997)

    Chapter  Google Scholar 

  8. Duan, H., Yu, X.: Hybrid Ant Colony Optimization Using Memetic Algorithm for Traveling Salesman Problem. In: Proceedings of the IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning, pp. 92–95 (2007)

    Google Scholar 

  9. Subramanian, D., Druschel, P., Chen, J.: Ants and reinforcement learning: A case study in routing in dynamic networks. In: Proceedings of the 15th Int. Joint Conf. on Artificial Intelligence, pp. 823–838. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  10. Sim, K.M., Sun, W.H.: Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions. IEEE Transactions on Systems, Man, and Cybernetics 33(5), 560–572 (2003)

    Article  Google Scholar 

  11. Xing, L.-N., Chen, Y.-W., Wang, P., Zhao, Q.-S., Xiong, J.: A Knowl-edge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems. Applied Soft Computing 10, 888–896 (2010)

    Article  Google Scholar 

  12. Lopez-Ibanez, M., Blum, C.: Beam ACO for the traveling sales man problem with time windows. Computers & Operations Research 37, 1570–1583 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chandra Mohan, B., Sandeep, R., Sridharan, D.: A Data Mining Approach for Predicting Reliable Path for Congestion Free Routing Using Self-motivated Neural Network. In: Lee, R. (ed.) Soft. Eng., Arti. Intel., Net. & Para./Distri. Comp., vol. 149, pp. 237–246. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Chandra Mohan, B., Baskaran, R.: Redundant Link Avoidance Algorithm for improving Network Efficiency. International Journal of Computer Science Issues 7(3) (May 2010)

    Google Scholar 

  15. Rajagopalan, S., Naganathan, E.R., Herbert Raj, P.: Ant Colony Optimization Based Congestion Control Algorithm for MPLS Network. In: Mantri, A., Nandi, S., Kumar, G., Kumar, S. (eds.) HPAGC 2011. CCIS, vol. 169, pp. 214–223. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. R. Naganathan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Naganathan, E.R., Rajagopalan, S., Narayanan, S. (2014). Response Time Comparison in Multi Protocol Label Switching Network Using Ant Colony Optimization Algorithm. In: Satapathy, S., Avadhani, P., Udgata, S., Lakshminarayana, S. (eds) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol I. Advances in Intelligent Systems and Computing, vol 248. Springer, Cham. https://doi.org/10.1007/978-3-319-03107-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03107-1_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03106-4

  • Online ISBN: 978-3-319-03107-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics