Dynamic Bandwidth Scheduling in Optical Burst Transport Rings
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing dynamic resource scheduling methods in Optical Burst Transport ring-Networks (OBTN) suffer from bandwidth collisions and inefficiencies due to distributed control management, leading to wasted resources and delayed processing times, particularly in timeslot division-based centralized control systems.
Innovation Solution
A dynamic bandwidth scheduling method where the master node prioritizes timeslots with the smallest hop count for source nodes, allocates bandwidths based on a bandwidth request matrix reduced to ensure maximum line rate compliance, and converts this allocation into a bandwidth map sent to slave nodes, optimizing resource utilization and reducing collisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If distributed MAC technology is used for medium access control, then node autonomy and simplicity are improved, but bandwidth resource waste and collision increase
Solution Approach 1:
The patent introduces a centralized controller as an intermediary between slave nodes and the optical burst ring. The controller collects bandwidth requests from slave nodes, performs centralized scheduling, and generates bandwidth maps that are distributed back to nodes. This intermediary resolves the contradiction by providing coordinated control that prevents collisions and optimizes bandwidth utilization while maintaining node simplicity in execution.
Solution Approach 2:
The patent segments the control function into a centralized controller that handles complex scheduling decisions separately from the slave nodes that only execute received bandwidth maps. This segmentation allows the system to benefit from centralized optimization while keeping individual nodes simple and autonomous in their data transmission operations.
2Productivity
If centralized MAC technology based on timeslot division is used, then network performance and bandwidth utilization are improved, but control complexity and processing delay increase
Solution Approach 1:
The centralized controller acts as an intermediary that consolidates all scheduling complexity in a single device. It collects bandwidth requests, performs timeslot division and resource allocation, and distributes the resulting bandwidth maps to slave nodes. This separates control complexity from node complexity, allowing high bandwidth utilization without increasing individual node complexity.
Solution Approach 2:
The controller performs preliminary scheduling actions by pre-calculating optimal timeslot assignments and generating bandwidth maps in advance. This preliminary action allows slave nodes to simply execute pre-determined schedules without needing to perform complex real-time scheduling decisions, thus reducing node complexity while maintaining high productivity.
3Reliability
If centralized control is used for bandwidth allocation, then fairness guarantee and collision reduction are improved, but processing time delay increases
Solution Approach 1:
The controller performs preliminary bandwidth allocation decisions by collecting all bandwidth requests and pre-calculating optimal assignments before actual data transmission occurs. This preliminary scheduling action ensures fairness and collision-free transmission while minimizing real-time processing delay, as nodes simply execute pre-determined bandwidth maps during data transmission.
Solution Approach 2:
The patent establishes continuous operation where the controller continuously collects bandwidth requests and updates bandwidth maps, ensuring that scheduling decisions are always current and optimal. This continuous useful action maintains fairness and efficiency while keeping processing delays minimal through ongoing rather than periodic re-evaluation.
Data Source
AI summary
Embodiments of the present disclosure disclose a dynamic bandwidth scheduling method and device, and a computer storage medium. The method is applied to each node in an Optical Burst Transport ring-Network (OBTN) and includes that: when a target node serves as a master node, for each source node in the OBTN, when a timeslot is allocated for a connection from the source node to a certain destination node, a timeslot occupied by a destination node having the smallest hop count to a destination node configured currently is selected preferentially among timeslots in which there exists an Optical Burst (OB) where there has been no drop operation; and when the target node serves as a master node, a timeslot allocation result is converted into a bandwidth map and the bandwidth map is sent to each slave node in the OBTN.