Bi-directional ring network having minimum spare bandwidth allocation and corresponding connection admission controls
View Patent ↗The present invention provides for a method for reserving spare bandwidth for a link in a communication network including a plurality of links. The method provides for monitoring the volume of traffic routed through each link of the communication network. A single link failure for each link is then simulated and the volume of traffic which would be rerouted through each link for maintaining communication and the volume of traffic removed from each link are determined for each simulated single link failure. The difference between the volume of traffic which would need to be rerouted through each link and the corresponding volume of traffic removed from each link is then computed, and a maximum difference value is determined for each link for all simulated single link failures. An amount of spare bandwidth equivalent to the determined maximum difference is then reserved for each link.
1. A method for reserving spare bandwidth for a link in a communication network including a plurality of links comprising the steps of:
monitoring the volume of traffic routed through each link of the communication network;
simulating a single link failure for each link of the communication network;
determining for each link the difference between a volume of traffic which would need to be rerouted through each link and a corresponding volume of traffic removed from each link for each of the simulated single link failures;
determining for each link the maximum value of the determined differences for all simulated single link failures;
reserving for each link an amount of spare bandwidth equivalent to the determined maximum difference;
receiving a request for a communication connection;
evaluating maximum additional spare bandwidth need for each link if the requested communication is accepted and in the event of a single link failure;
responsive to the evaluating, accepting the communication request only in the presence of sufficient available bandwidth for each of the links.
2. A method as in claim 1 where the communication network is configured using a self-healing ring architecture.
3. A method as in claim 2 where the self-healing ring employs one of 1:1 path switching, 1:1 line switching, or 1+1 path switching.
4. A method as in claim 1 where the accepted communication connection comprises a simplex communication.
5. A method as in claim 1 where the accepted communication connection comprises a duplex connection including multiple simplex communication components, and where bandwidth evaluating is carried out separately for each simplex component.
6. A method as in claim 5 where bandwidth evaluating is based on the sum of the bandwidth requirements determined for each of the simplex communication components.
7. A method as in claim 5 where bandwidth requirements for duplex connections are determined by evaluating simplex communication components.
8. A method as in claim 1 where the accepted communication connection includes at least one of point-to-point or point-to-multipoint communication connections.
9. A method as in claim 1 where the bandwidth requirements are updated in response to accepting a connection or removing a connection.
10. A method as in claim 1 which is implemented, at least in part, on a distributed basis.
11. A method for reserving spare bandwidth for a link in a communication network including a plurality of links comprising the steps of:
monitoring the volume of traffic routed through each link of the communication network;
simulating a single link failure for each link of the communication network;
determining for each link the difference between a volume of traffic which would need to be rerouted through each link and a corresponding volume of traffic removed from each link for each of the simulated single link failures;
determining for each link the maximum value of the determined differences for all simulated single link failures; and
reserving for each link an amount of spare bandwidth equivalent to the determined maximum difference.
12. A method as in claim 11 where determining includes:
determining the volume of traffic which would be rerouted through each link for maintaining existing communication after each of the simulated single link failures; and
determining the volume of traffic removed from each link after each of the simulated single link failures.
13. A method as in claim 11 where the communication network is configured using a self-healing ring architecture.
14. A method as in claim 13 where the self-healing ring employs one of 1:1 path switching, 1:1 line switching, or 1+1 path switching.
15. A method as in claim 14 where determining includes:
determining the volume of traffic which would be rerouted through each link for maintaining existing communication after each of the simulated single link failures; and
determining the volume of traffic removed from each link after each of the simulated single link failures.
16. A method as in claim 11 where the accepted communication connection comprises a simplex communication.
17. A method as in claim 11 where the accepted communication connection comprises a duplex connection including multiple simplex communication components, and where bandwidth evaluating is carried out separately for each simplex component.
18. A method as in claim 17 where bandwidth evaluating is based on the sum of the bandwidth requirements determined for each of the simplex communication components.
19. A method as in claim 17 where bandwidth requirements for duplex connections are determined by evaluating simplex communication components.
20. A method as in claim 11 where the accepted communication connection includes at least one of point-to-point or point-to-multipoint communication connections.
21. A method as in claim 11 where the bandwidth requirements are updated in response to accepting a connection or removing a connection.
22. A method as in claim 11 which is implemented, at least in part, on a distributed basis.