Method and system for selecting path according to reserved and not reserved connections in a high speed packet switching network
First Claim
1. For use in a packet switching communication network comprising a plurality of nodes interconnected with transmission links, said network carrying both reserved data traffic on connections to which network resources have been allocated and non-reserved data traffic on connections to which no network resources are allocated, a method of determining a route for non-reserved data traffic between an origin node and a destination node, said method comprising the steps of:
- assigning a weight to each transmission link, said weight being directly related to both the existing allocation of resources on the link for reserved data traffic connections and the existing, actual utilization of the link for carrying both reserved and non-reserved data traffic; and
selecting an optimal path by determining the combined weights of feasible paths between the origin node and the destination node and selecting the least weight path from the set of feasible paths.
3 Assignments
0 Petitions
Accused Products
Abstract
The present invention is related to high speed packet switching networks and, more particularly, to a process for selecting an optimal path for packets transmission without bandwidth reservation in communication systems supporting both bandwidth-reserved and non-bandwidth-reserved connections. Non-reserved network connections do not have bandwidth set aside either implicitly or explicitly. The lowest delay priority is assigned to non-reserved traffic and the networks drops non-reserved packets when their buffer overflow at intermediate links. Because the data profile over the connections is bursty and non deterministic, reserved traffic does not lead to a full links utilization except on peaks. Therefore, non-reserved traffic can be transmitted when some bandwidth is available on the links. The purpose of an efficient bandwidth management is to reserve on the links as many bandwidth as possible with a guaranteed quality of service, and to use the inherent remaining bandwidth to transport traffic from the users who are just expecting a "best effort" service. The Path Selection algorithm for non-reserved connections comprises the step of weighing each transmission link with a weighing function dependent of both reserved non-reserved traffic.
152 Citations
7 Claims
-
1. For use in a packet switching communication network comprising a plurality of nodes interconnected with transmission links, said network carrying both reserved data traffic on connections to which network resources have been allocated and non-reserved data traffic on connections to which no network resources are allocated, a method of determining a route for non-reserved data traffic between an origin node and a destination node, said method comprising the steps of:
-
assigning a weight to each transmission link, said weight being directly related to both the existing allocation of resources on the link for reserved data traffic connections and the existing, actual utilization of the link for carrying both reserved and non-reserved data traffic; and selecting an optimal path by determining the combined weights of feasible paths between the origin node and the destination node and selecting the least weight path from the set of feasible paths. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification