Patent JPS557422A successfully refreshed from Google Patents.
Patent EP0643514A2 successfully refreshed from Google Patents.
EP0643514A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Dynamic bandwidth estimation and adaptation for packet communications networks
Assignee: International Business Machines Corp
•
Filing: 1994-07-28
•
Granted: —
•
Expires: 2014-07-28
Abstract
Abstract Access control for a packet communications network includes a dynamic bandwidth updating mechanism which continuously monitors the mean bit rate of the signal source and the loss probability of the connection. These values are filtered to remove noise and then used to test whether the values fall within a pre-defined acceptable adaptation region in the mean bit rate, loss probability plane. Values falling outside of this region trigger bandwidth updating procedures which, in turn, result in acquiring a new connection bandwidth, and determining new filter parameters and new parameters for a leaky bucket access mechanism.
Inventors
- 👤 Jeffrey Haskell Derby
- 👤 John Ellis Drake, Jr.
- 👤 Levent Gun
- 👤 Claude Galand
- 👤 Gerald Arnold Marin
- 👤 Allen Leonid Roginsky
- 👤 Theodore Ernest Tedijanto
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-30 23:38
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L43/00; H04L43/08; H04L43/0823; H04L43/0829; H04L43/0876; H04L43/0894; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5635; H04L2012/5636; H04L2012/5637; H04L2012/5638; H04L2012/5646; H04L2012/5651
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
138 words
A packet communications network for interconnecting source nodes and destination nodes for establishing a connection for the transmission of digital packets of information from a source node to a destination node in said network, said communications system including a dynamic access control mechanism comprising means for monitoring the mean bit rate of signals from said source, a leaky bucket control circuit for controlling the flow of said signals from said source into said network, means for monitoring the loss probability of packets introduced by said leaky bucket control circuit, means for establishing boundaries of corresponding pairs of measurements from said mean bit rate monitoring means and said loss probability measuring means, and means responsive to a pair of said mean bit rate and loss probability measurements falling outside of said boundaries for updating the bandwidth of said connection.
Claim 2
Dependent Claim
33 words
The packet communications network according to claim 1 wherein said means for establishing boundaries comprises means for determining an order of magnitude range around said mean bit rate and said loss probability measurements.
Claim 3
Dependent Claim
30 words
The packet communications network according to claim 1 wherein said means for monitoring said mean bit rate comprises filtering means for filtering a plurality of said mean bit rate measurements.
Claim 4
Dependent Claim
28 words
The packet communications network according to claim 1 wherein said means for monitoring said loss probability comprises filtering means for filtering a plurality of said loss probability measurements.
Claim 5
Dependent Claim
264 words
The packet communications network according to claim 2 wherein said boundaries represent values of the mean bit rate m and the packet loss probability ξ satifying the relationships R (γ - m )exp(-η/ b ef ) ( R - m )γ - m ( R - γ)exp(-η/ b ef ) = k ₁ξ T , where η = M g (γ - m ) R ² ( R - m )( R - γ)γ , and m γδ = k ₂ ν ¯ , where δ = (γ - m ) R ² ( R - m )( R - γ)γ b ef . and R × γ - X + (γ - X )² + 4γ Xm / R 2γ = k ₃γ, where γ is the current token generation rate and γ = ( R - m ) R b ef ln 1 ε T , R is the maximum bit rate of signals from said source node, γ is the green token source rate of said leaky bucket control circuit, b ef is the effective burst length of signals from said source node, k ₁ is a constant between two and ten, ξ T is the target red token loss probability of said leaky bucket control circuit, M g is the size of the green token buffer in said leaky bucket control circuit, k ₂ is a constant between 1.1 and infinity, ν ¯ is the average buffer content of signals at said source node, ε T is the target loss probability, k ₃ is a constant between zero and 0.9.
Claim 6
Independent Claim
142 words
A method of dynamically adapting access to a packet communications network for interconnecting source nodes and destination nodes for the transmission of digital packets of information from said source node to said destination node, said method including the steps of monitoring the mean bit rate of signals from said source node, utilizing a leaky bucket control circuit to control the flow of said signals from said source node into said network, monitoring the loss probability of packets introduced into said network by said leaky bucket control circuit, establishing boundaries of corresponding pairs of measurements from said mean bit rate monitoring step and said loss probability monitoring step, and means responsive to a pair of said mean bit rate and loss probability measurements falling outside of said boundaries for updating the bandwidth of a connection between said source node and said destination node.
Claim 7
Dependent Claim
32 words
The method according to claim 6 wherein said step of establishing boundaries comprises the step of determining an order of magnitude range around said mean bit rate and said loss probability measurements.
Claim 8
Dependent Claim
29 words
The method according to claim 6 wherein said step of monitoring said mean bit rate comprises comprises the step of filtering a plurality of said mean bit rate measurements.
Claim 9
Dependent Claim
27 words
The method according to claim 6 wnerein said step of monitoring said loss probability comprises comprises the step of filtering a plurality of said loss probability measurements.
Claim 10
Dependent Claim
270 words
The method according to claim 7 wherein said step of establishing boundaries further include the step of determining values of said mean bit rate m and said packet loss probability ξ satifying the relationships R (γ - m )exp(-η/ b ef ) ( R - m )γ - m ( R - γ)exp(-η/ b ef ) = k ₁ξ T , where η = M g (γ - m ) R ² ( R - m )( R - γ)γ , and m γδ = k ₂ ν ¯ , where δ = (γ - m ) R ² ( R - m )( R - γ)γ b ef . and R × γ - X + (γ - X )² + 4γ Xm / R 2γ = k ₃γ, where γ is the current token generation rate and γ = ( R - m ) R b ef ln 1 ε T , R is the maximum bit rate of signals from said source node, γ is the green token source rate of said leaky bucket control circuit, b ef is the effective burst length of signals from said source node, k ₁ is a constant between two and ten, ξ T is the target red token loss probability of said leaky bucket control circuit, M g is the size of the green token buffer in said leaky bucket control circuit, k ₂ is a constant between 1.1 and infinity, ν ¯ is the average buffer content of signals at said source node, ε T is the target loss probability, k ₃ is a constant between zero and 0.9.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.