Communication resource management method and node control device using priority control and admission control

• US 6,999,419 B2
• Filed: 10/14/2003
• Issued: 02/14/2006
• Est. Priority Date: 10/23/1997
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Shimojo, Yoshimitsu, Katsube, Yasuhiro, Ise, Kataro
• Primary Examiner(s): Pezzlo, John
• Assistant Examiner(s): Tsegaye, Saba
• Application Number:
  US10/682,893
• Publication Number:
  US 20040131013A1
• Time in Patent Office: 854 Days
• Field of Search: 370230-238, 370/241.1, 370252-253, 370/409, 370419-420, 370/463, 370/468, 709/226, 709/229, 709/249, 340/825
• US Class Current: 370/230
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/31 by tagging of packets, e.g. using discard eligibility [DE] bits
• CPC Class Codes: H04L 47/33 using forward notification
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/724 at intermediate nodes, e.g. resource reservation protocol [RSVP]
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/826 Involving periods of time

Abstract

A communication resource management scheme capable of guaranteeing the communication quality with respect to the flow while not requiring the processing for each flow to nodes other than edge nodes is disclosed. The edge node stores an information for obtaining an available amount of communication resources that can be newly allocated in the network to one set of flows which share at least a route from that edge node to an egress node of the network. Then, the edge node carries out an admission control by newly receiving a request for allocation of communication resources for one flow belonging to that one set of flows, judging whether or not to accept the request according to a requested amount of communication resources and the available amount of communication resources as obtained from the information stored for that one set of flows, and allocating requested communication resources to that one flow when it is judged that the request is to be accepted, while the edge node and the core node carry out the priority control.

Claims

1. A method for managing communication resources in a network containing edge nodes located at a boundary of the network and core nodes located inside the network, comprising the steps of:

(a) carrying out a priority control in which an edge node transmits packets by describing a priority level in each packet according to an amount of communication resources allocated to a flow of the packets, and a core node carries out a transfer processing with respect to received packets according to the priority level described in each received packet;

(b) transmitting from one edge node an allocated resource notification regarding an amount of communication resources allocated to one set of flows which include one flow and which share at least a route from said one edge node to an egress node of the network;

(c) sequentially transmitting a remaining resource notification regarding a remaining amount of communication resources that can be newly allocated to said one set of flows at each node, which is obtained at said each node according to the amount of communication resources allocated to said one flow by said one edge node or the allocated resource notification transmitted from said one edge node and a transfer capability of said each node, from said one edge node through any intermediate core codes, toward a downstream side of said one set of flows;

(d) notifying from the egress node to said one edge node an available amount of communication resources that can be newly allocated in the network to said one set of flows, which is obtained according to the allocated resource notification transmitted from said one edge node, a transfer capability of the egress node, and the remaining resource notification received from a neighboring core node on an upstream side of said one set of flows;

(e) obtaining at said one edge node an available amount of communication resources that can be newly allocated in the network to said one set of flows, according to the remaining resource notification received from a neighboring core node on a downstream side of said one set of flows; and

(f) interpreting a received packet in a resource reservation protocol, and allocating communication resources requested by using the resource reservation protocol to said one flow indicated by the resource reservation protocol, at said one edge node,

wherein at the step a), each core node transfers a resource reservation protocol packet without interpreting the resource reservation protocol packet.