Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
319 words
A call admission control method wherein, in a network in which all information generated from terminals (1) having various traffic characteristics are transmitted/switched by a fixed length block called a "cell" having a cell header including a virtual channel id, a terminal (1) requesting communication declares destination address information and traffic characteristics of requested communication to said network upon set-up request, and an exchange (15) in said network performs call processing for a request call on the basis of the destination address information and traffic characteristics declared by said terminal (1) and a current offered load in said network, comprising the steps of: grasping a current offered load of a line accommodated by said exchange (15) in said network as an estimated cell flow A(i) ( i is a positive integer) to be transmitted to said line in time units Δt(i) ( i is a positive integer of 1, 2, ..., n ) having a plurality of ( n ) predetermined lengths; grasping traffic characteristics of each call as a maximum cell flow a(j,i) (j is an identification number of a terminal) generated from said terminal (1) in the time units Δt(i) having the n lengths; calculating a predicted offered load of said line predicted to be obtained when the new request call is accepted as an estimated cell flow A′(i) ( i is a positive integer) predicted to be transmitted to said line in the time unit Δt(i) by using the cell flow A(i) (i is a positive integer) representing the current offered load of said line and the maximum cell flow a(k+1,i) representing the traffic characteristics of new request call; comparing the estimated cell flow A′(i) with a transmittable maximum allowable cell flow A max(i) of said line obtained from a circuit capacity; accepting admission of the request call in accordance with the comparison result obtained in said comparison step; and rejecting admission of the request call.
Claim 2
Dependent Claim
319 words
A call admission control method wherein, in a network in which all information generated from terminals (1) having various traffic characteristics are transmitted/switched by a fixed length block called a "cell" having a cell header including a virtual channel id, a terminal (1) requesting communication declares destination address information and traffic characteristics of requested communication to said network upon set-up request, and an exchange (15) in said network performs call processing for a request call on the basis of the destination address information and traffic characteristics declared by said terminal (1) and a current offered load in said network, comprising the steps of: grasping a current offered load of a line accommodated by said exchange (15) in said network as an estimated cell flow A(i) ( i is a positive integer) to be transmitted to said line in time units Δt(i) ( i is a positive integer of 1, 2, ..., n ) having a plurality of ( n ) predetermined lengths; grasping traffic characteristics of each call as a maximum cell flow a(j,i) (j is an identification number of a terminal) generated from said terminal (1) in the time units Δt(i) having the n lengths; calculating a predicted offered load of said line predicted to be obtained when the new request call is accepted as an estimated cell flow A′(i) ( i is a positive integer) predicted to be transmitted to said line in the time unit Δt(i) by using the cell flow A(i) (i is a positive integer) representing the current offered load of said line and the maximum cell flow a(k+1,i) representing the traffic characteristics of new request call; comparing the estimated cell flow A′(i) with a transmittable maximum allowable cell flow A max(i) of said line obtained from a circuit capacity; accepting admission of the request call in accordance with the comparison result obtained in said comparison step; and rejecting admission of the request call.
Claim 3
Dependent Claim
133 words
A method according to claim 1, characterized in that the estimated cell flow A(i) ( i is a positive integer of 1, 2, ..., n ) representing a current offered load of said line and the estimated cell flow A′(i) ( i is a positive integer) representing a predicted offered load of said line predicted to be obtained when a new request call is accepted are expressed as follows by using traffic characteristics a(j,i) of all calls j ( j is a positive integer 1, 2, ..., k ) currently transiting on said line, traffic characteristics a(k+1,i) of the request call k+1, a current coefficient α(i) (0 < α(i) ≦ 1), and coefficient α new (i) (0 < α new (i) ≦ 1) to be used when the new request call is accepted:
Claim 4
Dependent Claim
78 words
A cell flow monitoring method for monitoring cell flows transmitted from terminals (1, 2, ...) during communication by counting the cell flows in time units Δt(i) ( i is a positive integer 1, 2, ..., n ) having a plurality of lengths, and if the cell flow within the time unit Δt(i) exceeds a traffic characteristic value a(j,i) of said terminals (1, 2, ...) grasped beforehand by a network, for immediately determining "violation" and performing a regulation sequence.
Claim 5
Dependent Claim
78 words
A cell flow monitoring method for monitoring cell flows transmitted from terminals (1, 2, ...) during communication by counting the cell flows in time units Δt(i) ( i is a positive integer 1, 2, ..., n ) having a plurality of lengths, and if the cell flow within the time unit Δt(i) exceeds a traffic characteristic value a(j,i) of said terminals (1, 2, ...) grasped beforehand by a network, for immediately determining "violation" and performing a regulation sequence.