An Efficient Routing Algorithm based on Segment Routing in Software-Defined Networking
碩士 === 國立清華大學 === 資訊工程學系 === 104 === Software-Defined Networking (SDN) is an emerging architecture and it offers advantages over traditional network architecture. Segment Routing (SR) defines the path information through the network via an ordered list of MPLS labels on the packet header at the ingr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/70946088273679646512 |
| Summary: | 碩士 === 國立清華大學 === 資訊工程學系 === 104 === Software-Defined Networking (SDN) is an emerging architecture and it offers advantages over traditional network architecture. Segment Routing (SR) defines the path information through the network via an ordered list of MPLS labels on the packet header at the ingress device and makes SDN routing management more efficient and simple. It can also solve some scalability issues in SDN. In this thesis, we propose a routing algorithm for SDN with SR to serve the bandwidth requirement of a routing request. Our algorithm considers the balance of traffic load and reduces the extra cost of the packet header size in a network. Simulation results show that the performance of our algorithm is better than previous work in terms of average network throughput and average rejection rate of routing requests.
|
|---|