Patent US5521905A successfully refreshed from Google Patents.
US5521905A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive traffic control apparatus and method for controlling connection of arriving calls
Assignee: KDDI Corp
•
Filing: 1994-07-19
•
Granted: 1996-05-28
•
Expires: 2014-07-19
Abstract
Abstract Adaptive traffic control apparatus and method control connection of arriving calls in at least one circuit group in circuit-switched networks. The switching systems in general measure the number of calls in progress n(t) at a time t in the circuit group, where t0</=t</=T, t0 is a traffic control initiation time and T is a target time of the traffic control. In particular, an admissible number of calls d(t) in the circuit group at the time tis calculated so that all the circuits of the group will be free by the target time T, and the measured number of calls in progress n(t) is compared with the calculated admissible number of call d(t) at each time a new call arrives at the circuit group to decide that the arriving new call is to be accepted if n(t)<d(t) and that the arriving new call is to be rejected if n(t)>/=d(t).
Inventors
- 👤 Toshikane Oda
- 👤 Kazuhiko Yamanouchi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 17:34
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/50; H04L49/505; H04L49/506; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L49/25; H04L49/253; H04L49/255; H04L49/30; H04L49/3081; H04Q; H04Q3/00; H04Q3/64; H04Q3/68; H04L2012/5629; H04L2012/563; H04L2012/5631; H04L2012/5632
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
165 words
An adaptive traffic control apparatus for controlling connection of arriving calls in at least one circuit group in switching networks, said switching networks measuring a number of calls in progress n(t) at a time t in said at least one circuit group, where t 0 ≦t≦T, t 0 is a traffic control initiation time and T is a target time of the traffic control, said apparatus comprising: means for calculating an admissible number of calls d(t) in said at least one circuit group at the time t so that all circuits of said at least one circuit group will be free by the target time T; and means for comparing said measured number of calls in progress n(t) with said calculated admissible number of calls d(t) at each time a new call arrives at said at least one circuit group to decide that said arriving new call is to be accepted if n(t)<d(t) and that said arriving new call is to be rejected if n(t)≧d(t).
Claim 2
Dependent Claim
165 words
An adaptive traffic control apparatus for controlling connection of arriving calls in at least one circuit group in switching networks, said switching networks measuring a number of calls in progress n(t) at a time t in said at least one circuit group, where t 0 ≦t≦T, t 0 is a traffic control initiation time and T is a target time of the traffic control, said apparatus comprising: means for calculating an admissible number of calls d(t) in said at least one circuit group at the time t so that all circuits of said at least one circuit group will be free by the target time T; and means for comparing said measured number of calls in progress n(t) with said calculated admissible number of calls d(t) at each time a new call arrives at said at least one circuit group to decide that said arriving new call is to be accepted if n(t)<d(t) and that said arriving new call is to be rejected if n(t)≧d(t).
Claim 3
Dependent Claim
70 words
The apparatus as claimed in claim 1, wherein said calculating means includes a calculation unit for calculating beforehand a plurality of admissible numbers of calls d(t) in said at least one circuit group at points of time from the traffic control initiation time t 0 to the target time T, and wherein said apparatus further comprises a memory for storing the calculated admissible numbers of calls as a threshold table.
Claim 4
Dependent Claim
40 words
The apparatus as claimed in claim 1, wherein said calculating means includes a calculation unit for calculating an admissible number of calls d(t) in said at least one circuit group at a time t every time a new call arrives.
Claim 5
Dependent Claim
104 words
The apparatus as claimed in claim 1, wherein said calculating means includes means for calculating the admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T, while satisfying a success probability depending upon both an average service time of one call and the number of arriving calls during a unit of time in case that the call arrival during the interval from the traffic control initiation time t 0 to the target time T is regarded as Poissonian.
Claim 6
Dependent Claim
67 words
The apparatus as claimed in claim 1, wherein said calculating means includes means for calculating the admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T, while satisfying a success probability depending upon only an average service time of one call.
Claim 7
Dependent Claim
33 words
The apparatus as claimed in claim 5, wherein said apparatus further comprises means for rejecting all arriving calls without reserve after a time once said arriving new call is decided to be rejected.
Claim 8
Dependent Claim
33 words
The apparatus as claimed in claim 1, wherein said apparatus further comprises means for rejecting all arriving calls without reserve after a time that a state parameter r exceeds a predetermined threshold v.
Claim 9
Dependent Claim
32 words
The apparatus as claimed in claim 7, wherein said apparatus further comprises means for updating the state parameter r every time a new call arrives at said at least one circuit group.
Claim 10
Dependent Claim
29 words
The apparatus as claimed in claim 7, wherein said apparatus further comprises means for updating the state parameter r every time a rejection of the arriving call is decided.
Claim 11
Dependent Claim
29 words
The apparatus as claimed in claim 7, wherein said apparatus further comprises means for updating the state parameter r every time an acceptance of the arriving call is decided.
Claim 12
Dependent Claim
24 words
The apparatus as claimed in claim 7, wherein the state parameter r is an elapsed time period from the initiation time t 0 .
Claim 13
Dependent Claim
165 words
An adaptive traffic control method for controlling connection of arriving calls in at least one circuit group in switching networks, said switching networks measuring a number of calls in progress n(t) at a time t in said at least one circuit group, where t 0 ≦t≦T, t 0 is a traffic control initiation time and T is a target time of the traffic control, said method comprising the steps of: calculating an admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T; and comparing said measured number of calls in progress n(t) with said calculated admissible number of calls d(t) at each time a new call arrives at said at least one circuit group to decide that said arriving new call is to be accepted if n(t)<d(t) and that said arriving new call is to be rejected if n(t)≧d(t).
Claim 14
Dependent Claim
165 words
An adaptive traffic control method for controlling connection of arriving calls in at least one circuit group in switching networks, said switching networks measuring a number of calls in progress n(t) at a time t in said at least one circuit group, where t 0 ≦t≦T, t 0 is a traffic control initiation time and T is a target time of the traffic control, said method comprising the steps of: calculating an admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T; and comparing said measured number of calls in progress n(t) with said calculated admissible number of calls d(t) at each time a new call arrives at said at least one circuit group to decide that said arriving new call is to be accepted if n(t)<d(t) and that said arriving new call is to be rejected if n(t)≧d(t).
Claim 15
Dependent Claim
69 words
The method as claimed in claim 12, wherein said calculating step includes a step of calculating beforehand a plurality of admissible numbers of calls d(t) in said at least one circuit group at points of time from the traffic control initiation time t 0 to the target time T, and wherein said method further comprises a step of storing the calculated admissible numbers of calls as a threshold table.
Claim 16
Dependent Claim
39 words
The method as claimed in claim 12, wherein said calculating step includes a step of calculating an admissible number of calls d(t) in said at least one circuit group at a time t every time a new call arrives.
Claim 17
Dependent Claim
105 words
The method as claimed in claim 12, wherein said calculating step includes a step of calculating the admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T, while satisfying a success probability depending upon both an average service time of one call and the number of arriving calls during a unit of time in case that the call arrival during the interval from the traffic control initiation time t 0 to the target time T is regarded as Poissonian.
Claim 18
Dependent Claim
68 words
The method as claimed in claim 12, wherein said calculating step includes a step of calculating the admissible number of calls d(t) in said at least one circuit group at the time t so that all the circuits of said at least one circuit group will be free by the target time T, while satisfying a success probability depending upon only an average service time of one call.
Claim 19
Dependent Claim
34 words
The method as claimed in claim 16, wherein said method further comprises a step of rejecting all arriving calls without reserve after a time once said arriving new call is decided to be rejected.
Claim 20
Dependent Claim
34 words
The method as claimed in claim 12, wherein said method further comprises a step of rejecting all arriving calls without reserve after a time that a state parameter r exceeds a predetermined threshold v.
Claim 21
Dependent Claim
33 words
The method as claimed in claim 18, wherein said method further comprises a step of updating the state parameter r every time a new call arrives at said at least one circuit group.
Claim 22
Dependent Claim
30 words
The method as claimed in claim 18, wherein said method further comprises a step of updating the state parameter r every time a rejection of the arriving call is decided.
Claim 23
Dependent Claim
30 words
The method as claimed in claim 18, wherein said method further comprises a step of updating the state parameter r every time an acceptance of the arriving call is decided.
Claim 24
Dependent Claim
24 words
The method as claimed in claim 18, wherein the state parameter r is an elapsed time period from the initiation time t 0 .
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-28 | 1999-11-27 | 2000-05-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-28 | 2003-11-27 | 2004-05-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-28 | 2007-11-27 | 2008-05-28 | $7700.00 | Window Closed / Lapsed |