← Back to Patent Explorer
EP0603099A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

A method and system of requesting resources in a packet-switched network with minimal latency

Assignee: International Business Machines Corp
•
Filing: 1993-11-04
•
Granted: —
•
Expires: 2013-11-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A fast bandwidth reservation method and system, used in packet-switched networks, are disclosed which reserve bandwidth for a data transfer over links in a path between a source node, at least one intermediate node, and a destination node with minimal latency where the source node desires to send data to the destination node along the specific path using at least a minimum bandwidth and up to a maximum bandwidth. The goal of the method and system is to reserve bandwidth for a data transfer in the minimal amount of time. No link on the path between the source node and destination node has more band-width allocated for the source node than the minimum allocated for the previous forward links on the path. Links on the path between the source node and destination node have their bandwidth allocation for the data transfer adjusted based on the final minimum bandwidth allocated for the data transfer.

Inventors

  • 👤 Israel Cidon
  • 👤 Inder Sarat Gopal
  • 👤 Roch Andre Guerin

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-29 14:36
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5634

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 168 words
A method of requesting resources in a communications network with minimal latency, said method comprising the steps of: (a) transmitting a request packet in a path from a source node through at least one intermediate node towards a destination node, said nodes coupled by respective links and said request packet containing a request for resources to complete a requested transmission along the path to the destination node; and (b) comparing the request for resources in the request packet to the available resources of a selected link in the path and (1) decreasing the available resources of the selected link by the request for resources in the request packet and sending the request packet forward in the path when the available resources of the selected link is at least equal to the request for resources and (2) modifying the request packet to indicate that no resources are to be reserved for the request packet when the available resources of the selected link is less than the request for resources.
Claim 2
Dependent Claim 68 words
The method of requesting resources in a communications network with minimal latency, according to claim 1 wherein: step (a) includes transmitting a request packet backwards in the path, and step (b) (2) includes setting the request for resources in the request packet to zero and sending the request packet backward in the path when the available resources of the selected link is less than the request for resources.
Claim 3
Dependent Claim 45 words
The method according to claim 2 further comprising the step of: increasing the available resources of a selected link by the difference between the request for resources in the request packet sent backwards in the path and amount of resources reserved for this request packet.
Claim 4
Dependent Claim 174 words
The method of requesting resources in a communications network with minimal latency, according to claim 1 wherein the request packet contains a minimum request for resources and a desired request for resources, where the desired request for resources is greater than or equal to the minimum request for resources; andwherein step (b) (1) includes the steps of: (1-1) decreasing the available resources of the selected link by the desired request for resources in the request packet and sending the request packet forward in the path when the available resources of the selected link is at least equal to the desired request for resources, and (1-2) decreasing the available resources of the selected link by the available resources of the selected link, setting the desired request for resources in the request packet to the available resources of the selected link and sending the request packet forward in the path when the available resources of the selected link is at least equal to the minimum request for resources and less than the desired request for resources.
Claim 5
Dependent Claim 170 words
The method of requesting resources in a communications network with minimal latency, according to claim 2, wherein the request packet contains a minimum request for resources and a desired request for resources, where the desired request for resources is greater than or equal to the minimum request for resources; and wherein step (b)(1) includes: (1-1) decreasing the available resources of the selected link by the desired request for resources in the request packet and sending the request packet forward in the path when the available resources of the selected link is at least equal to the desired request for resources, (1-2) decreasing the available resources of the selected link by the available resources of the selected link, setting the desired request for resources in the request packet to the available resources of the selected link and sending the request packet forward in the path when the available resources of the selected link is at least equal to the minimum request for resources and less than the desired request for resources.
Claim 6
Dependent Claim 46 words
A method according to claim 5 further comprising the step of: increasing the available resources of a selected link by the difference between the desired request for resources in the request packet sent backwards in the path and amount of resources reserved for this request packet.
Claim 7
Independent Claim 172 words
A system for requesting resources in a communications network with minimal latency having a path from a source node through at least one intermediate node towards a destination node, said nodes coupled by respective links and said request packet containing a request for resources to complete a requested transmission along the path to the destination node, said system comprising: transmitting means for transmitting a request packet in the path; and processing means for comparing the request for resources in the request packet to the available resources of a selected link in the path and (1) decreasing the available resources of the selected link by the request for resources in the request packet and sending the request packet forward in the path when the available resources of the selected link is at least equal to the request for resources and (2) modifying the request packet to indicate that no resources are to be reserved for the request packet when the available resources of the selected link is less than the request for resources.
Claim 8
Dependent Claim 161 words
The system according to claim 7 wherein said request packet contains a minimum request for resources and a desired request for resources where the desired request for resources is greater than or equal to the minimum request for resources, and wherein the processing means (1-1) decreases the available resources of the selected link by the desired request for resources in the request packet and sending the request packet forward in the path when the available resources of the selected link is at least equal to the desired request for resources, and (1-2) decreasing the available resources of the selected link by the available resources of the selected link, setting the desired request for resources in the request packet to the available resources of the selected link and sending the request packet forward in the path when the available resources of the selected link is at least equal to the minimum request for resources and less than the desired request for resources.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag