Patent US1561473A successfully refreshed from Google Patents.
Patent US3858478A successfully refreshed from Google Patents.
Patent US6628670B1 successfully refreshed from Google Patents.
US6628670B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for sharing reserved bandwidth between several dependent connections in high speed packet switching networks
Assignee: International Business Machines Corp
•
Filing: 1999-10-29
•
Granted: 2003-09-30
•
Expires: 2019-10-29
Abstract
Abstract The present application discloses a method and system of sharing reserved bandwidth among several connections issuing from a same physical port in an origin node of a packet switching communication network comprising a plurality of nodes interconnected with transmission links. At each request for establishing a connection i from an origin node to a destination node, the dependent connection management process:selects for connection i a routing path comprising one or a plurality of links from the origin node to the destination node:identifies on the selected path all consecutive links starting from the origin node and shared with another connection issuing from the same physical port;reserves on each link of these identified consecutive links an aggregate bandwidth for all connections issuing from the same physical port, said aggregate bandwidth being less than the sum of the bandwidth reserved for each connection considered individually.
Inventors
- 👤 Claude Galand
- 👤 Marcel Villaflor
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 22:31
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/24; H04L45/00; H04L45/02; H04L45/24; H04L47/11; H04L47/15; H04L47/70; H04L47/72; H04L47/724; H04L47/726; H04L47/80; H04L47/805; H04L47/82; H04L47/822; H04L47/828; H04L47/829
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
154 words
A method of sharing reserved bandwidth among several connections issuing from a same physical port in an origin node of a packet switching communication network comprising a plurality of nodes ( 201 . . . 208 ) interconnected with transmission links ( 209 ), said method characterized in that at each request for establishing a connection i from an origin node to a destination node it involves the steps of: selecting for connection i a routing path comprising one or a plurality of links from the origin node to the destination node; identifying on the selected path all consecutive links starting from the origin node and shared with another connection issuing from the same physical port; reserving on each link of said identified consecutive links an aggregate bandwidth for all connections issuing from the same physical port, said aggregate bandwidth being less than the sum of the bandwidth reserved for each connection considered individually.
Claim 2
Independent Claim
154 words
A method of sharing reserved bandwidth among several connections issuing from a same physical port in an origin node of a packet switching communication network comprising a plurality of nodes ( 201 . . . 208 ) interconnected with transmission links ( 209 ), said method characterized in that at each request for establishing a connection i from an origin node to a destination node it involves the steps of: selecting for connection i a routing path comprising one or a plurality of links from the origin node to the destination node; identifying on the selected path all consecutive links starting from the origin node and shared with another connection issuing from the same physical port; reserving on each link of said identified consecutive links an aggregate bandwidth for all connections issuing from the same physical port, said aggregate bandwidth being less than the sum of the bandwidth reserved for each connection considered individually.
Claim 3
Dependent Claim
74 words
The method as recited in claim 1 , wherein the step of identifying all consecutive links comprises the further step of defining for each port: a Dependent Connection Table DCT p comprising for each link in the network, information required to manage the bandwidth and the dependency of connections issuing from the port; a Path Table PT p with the links comprised in the selected routing path of each connection issuing from the port.
Claim 4
Dependent Claim
32 words
The method as recited in claim 1 , wherein the aggregate bandwidth for all connections issuing from a same port with a given access rate does not exceed said port access rate.
Claim 5
Dependent Claim
52 words
The method as recited in claim 1 , wherein the bandwidth reserved for each connection i considered individually is equal to an equivalent capacity, function of: R i the access bit rate of said connection, m i the average bit rate of said connection, b i the average burstiness of said connection.
Claim 6
Dependent Claim
118 words
The method according to claim 4 wherein the bandwidth reserved for each connection i considered individually is equal to: c ^ i = f ( R i , m i , b i , X , ɛ ) = R i y i - X + [ y i - X ] 2 + 4 X ρ i y i 2 y i where: X is the buffer size where packets are queued while waiting transmission on the trunk. ε is the proportion of packets that can be lost due to the buffer overflowing. y i =ln(1/ε)b i (1−p i )R i . p i =m i /R i .
Claim 7
Dependent Claim
67 words
The method as recited in claim 1 , wherein the aggregate bandwidth on link k for all N k connections issuing from a same physical port p is a function of: M k the mean bit rate of the aggregation of the N k connections issued from said port, B k the mean burst duration of the aggregation of the N k connections issued from said port.
Claim 8
Dependent Claim
104 words
The method according to claim 6 wherein the mean bit rate of the aggregation of the N k connections issued from port p is equal to: M k = ∑ i = 1 N k m i the mean burst duration of the aggregation of the N k connections issued from port p is equal to: B k = ∑ i = 1 N k m i × b i ∑ i = 1 N k m i where m i is the average bit rate of connection i, b i is the average burstiness of connection i.
Claim 9
Dependent Claim
100 words
The method according to claim 7 wherein the aggregate bandwidth on link k for all N connections issuing from a same physical port p is equal to: E k ( N k ) = f ( R , M k , B k , X , ɛ ) = R Y k - X + [ Y k - X ] 2 + 4 X ρ k Y k 2 Y k where: R is the port access rate, Y k =ln(1/ε)B k (1−p k )R, and p k =M k /R.
Claim 10
Dependent Claim
36 words
The method as recited in claim 1 , wherein the step of reserving on a link an aggregate bandwidth for all connections issuing from a same physical port is processed only on said identified consecutive links.
Claim 11
Independent Claim
14 words
A system for carrying out the method according to anyone of the preceding claims.
References Cited (Backward Citations)
US5600638A
Cited
US5940372A
Cited
US6011804A
Cited
US5815492A
Cited
US6400681B1
Cited
US5881050A
Cited
US6262974B1
Cited
US6038212A
Cited
US6282197B1
Cited
US6321260B1
Cited
US6256309B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-09-29 | 2007-03-31 | 2007-09-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-09-29 | 2011-03-31 | 2011-09-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-09-29 | 2015-03-31 | 2015-09-30 | $7700.00 | Window Closed / Lapsed |