Abstract
Research and education networks (RENs) worldwide, attracted by the benefits of software-defined networking (SDN) for services involving traffic engineering (TE) such as bandwidth on demand (BoD), have started to include SDN in their network evolution plans. BoD allows users to request end-to-end connectivity services of known duration with a guaranteed bandwidth. Considering such a scenario, this paper presents a set of algorithms and two novel data structures for provisioning of the BoD service in SDN-based RENs. First, network snapshots are used to represent a period of time during which resource availability remains constant. Second, the network snapshot tree (NSTree) allows for different network snapshots to be arranged hierarchically using a time-based node aggregation policy. Additionally, each network snapshot stores multiple alternative paths for each source-destination pair. This innovative approach allows for the network resource utilization and number of service requests being accepted in the network to be improved compared to the most common approach of a single shortest path being considered for each destination. As a result, our approach allows for network resource utilization to be improved by approximately 30%. Furthermore, the two-phase procedure used to pre-compute alternative paths and perform admission control makes it possible to achieve response times on the order of milliseconds, enabling the real-time provision of the service.
Highlights
The appearance of software-defined networking (SDN) has enabled the development of next-generation networks
2) EVALUATION OF THE IMPACT OF THE AGGREGATION POLICY This experiment evaluates the impact of the selected δ on the performance of the solution, where δ refers to the maximum time that may separate two nodes in the network snapshot tree (NSTree) for them to be aggregated into a CA
500 services have been requested with a random bandwidth between 100 Mbps and 2 Gbps, random start and end times ensuring a duration between 1 day and 4 weeks, and random source and destination nodes to ensure a uniform distribution of service requests
Summary
The appearance of software-defined networking (SDN) has enabled the development of next-generation networks. The emergence of SDN makes it possible to re-examine how TE should be supported and how the resource and timing constraints that facilitate advance reservations should be handled Considering such a scenario, this paper presents a set of algorithms and data structures that support advance reservations to provide an SDN-based BoD service in the REN environment. The solution is based on the generation of network snapshots, a data structure that represents a period of time during which resource consumption of a given set of concurrent service reservations remains stable. The proposed data structures (network snapshots and the NSTree) could be useful in the wider context of function split frameworks for QoS in SDN as a mechanism for representing the dynamic resource allocation status on the network.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
