Abstract

The research on For CES technology has made a great progress. However current researches on For CES mainly focus on architecture and techniques. In order to ensure For CES architecture network works well, it is significant to take account of performance (such as routing) optimization for For CES architecture. In this paper, we introduced a minimizing sum of path-cost model based on multiple traffic matrices, combined with negative valence ring algorithm, to optimize the traffic at FE sides in For CES architecture. At last, we give the feasibility discussion of the routing optimization for For CES.

Highlights

  • Routing optimization adapts traffic distribution by adjusting routing, to achieve the goal of bandwidth allocating, network congestion relief, link load balancing

  • Routing optimization is the major application of traffic matrix in traffic engineering

  • The routing optimization steps are: let traffic matrix be the input; using local search (Roughan et al, 2003b; Zhang et al, 2005) to calculate and obtain a set of link weights, which applied to real network; at last we evaluate the routing optimization result by comparing the maximum link utilization before and after optimizing

Read more

Summary

Introduction

Routing optimization adapts traffic distribution by adjusting routing, to achieve the goal of bandwidth allocating, network congestion relief, link load balancing. We plan to propose a method based on IP routing and minimizing sum of path-cost model with multiple traffic matrices to solve routing optimization problems among FE in ForCES system. If congestion occurs at some link, routers automatically adjust the traffic between OD pairs and the probability of packets forwarded at different paths in order to decrease network cost and increase network bandwidth utilization.

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.