A QoS-based flow assignment for traffic engineering in software-defined networks

In order to meet a tremendous amount of data storage requirement in next-generation wireless networks, an increasing number of cloud data centers has been deployed around the world. The underlying core networks are expected to provide the ability to store data in a dynamic and scalable computing environment. The traditional Internet Protocol (IP) has shown to be restricted due to its static architecture, which accordingly motivates the development of Software-Defined Networks (SDNs). In the SDNs, Traffic Engineering (TE) is simpler and programmable with a controller without the requirement of reconfiguration for all network devices. However, the existing TE algorithm of the SDNs rejects a number of requested flows caused by their undetermined routing paths where only flow bandwidth is considered in path determination. This paper proposes a Quality-of-Service (QoS) based Flow Assignment algorithm which enables the computation of end-to-end path for traffic flows guaranteeing the QoS requirements including bandwidth, end-to-end delay and packet loss probability. Through the Open Source Hybrid IP/SDNs platform, the proposed algorithm is validated and shown to significantly reduce flow rejection rate of up to 50% compared to the conventional approach, and therefore can be used to implement an effective DiffServ mechanism for flow allocation in the SDNs

A QoS-based flow assignment for traffic engineering in software-defined networks

In order to meet a tremendous amount of data storage requirement in next-generation wireless networks, an increasing number of cloud data centers has been deployed around the world. The underlying core networks are expected to provide the ability to store data in a dynamic and scalable computing environment. The traditional Internet Protocol (IP) has shown to be restricted due to its static architecture, which accordingly motivates the development of Software-Defined Networks (SDNs). In the SDNs, Traffic Engineering (TE) is simpler and programmable with a controller without the requirement of reconfiguration for all network devices. However, the existing TE algorithm of the SDNs rejects a number of requested flows caused by their undetermined routing paths where only flow bandwidth is considered in path determination. This paper proposes a Quality-of-Service (QoS) based Flow Assignment algorithm which enables the computation of end-to-end path for traffic flows guaranteeing the QoS requirements including bandwidth, end-to-end delay and packet loss probability. Through the Open Source Hybrid IP/SDNs platform, the proposed algorithm is validated and shown to significantly reduce flow rejection rate of up to 50% compared to the conventional approach, and therefore can be used to implement an effective DiffServ mechanism for flow allocation in the SDNs

A qos based flow assignment for traffic engineering in software defined networks

In order to meet a tremendous amount of data storage requirement in next-generation wireless networks, an increasing number of cloud data centers has been deployed around the world. The underlying core networks are expected to provide the ability to store data in a dynamic and scalable computing environment. The traditional Internet Protocol (IP) has shown to be restricted due to its static architecture, which accordingly motivates the development of Software-Defined Networks (SDNs). In the SDNs, Traffic Engineering (TE) is simpler and programmable with a controller without the requirement of reconfiguration for all network devices. However, the existing TE algorithm of the SDNs rejects a number of requested flows caused by their undetermined routing paths where only flow bandwidth is considered in path determination. This paper proposes a Quality-of-Service (QoS) based Flow Assignment algorithm which enables the computation of end-to-end path for traffic flows guaranteeing the QoS requirements including bandwidth, end-to-end delay and packet loss probability. Through the Open Source Hybrid IP/SDNs platform, the proposed algorithm is validated and shown to significantly reduce flow rejection rate of up to 50% compared to the conventional approach, and therefore can be used to implement an effective DiffServ mechanism for flow allocation in the SDNs. Document type: Part of book or chapter of boo

MPLS (Multi-Protocol Label Switching) assisted routing procedure in Software Defined Networking (SDN)

Thesis submitted in partial fulfillment of the requirements for the Degree of Master of Science in Information Technology (MSIT) at Strathmore UniversityMulti-protocol label switching has been incorporated into provider networks to provide quality of service. Owing to the design of the protocol, its ability to push and pop labels in packets, independent of their underlying protocol makes it popular in interconnecting multiple networks in to one transport pipeline. At the same time, multi-protocol label switching has proven to be a very fast procedure for forwarding devices because the central processing unit cycles required in making a forwarding decision is far less compared to traditional forwarding decision-making metrics like analyzing the internet protocol header. However, current multi-protocol label switching implementation is a complex configuration procedure and does not provide a central bird’s eye view of the network topology to network engineers. Logging in to every label switching router and loading multi-protocol label switching configurations to allow it to connect to neighboring label switching routers in the label switching path is required. Allowing network engineers to have a central view and control of the network topology while still providing multi-protocol label switching services in a simplistic approach will make them achieve adaptive routing and traffic engineering seamlessly. This will improve quality of service and quality of experience in transport networks. Software defined networking is the approach this research takes towards providing central control because of the flexibility, programmability, and adaptability of the technology. This work proposed the design of a routing procedure that will implement multi-protocol label switching on a software defined network via OpenFlow. Experimental synthesis and prototyping approach was used to achieve the research objectives. A simulated environment called Mininet provided the implementation test bed. Internet control message packets were the test data to show how multi-protocol label switching labels are added and stripped. An illustration of the packet capture information from the experiment was presented and analyzed