WO1997050213A1 - Network access control method, and device and system for implementing this method - Google Patents
Network access control method, and device and system for implementing this method Download PDFInfo
- Publication number
- WO1997050213A1 WO1997050213A1 PCT/IB1997/000753 IB9700753W WO9750213A1 WO 1997050213 A1 WO1997050213 A1 WO 1997050213A1 IB 9700753 W IB9700753 W IB 9700753W WO 9750213 A1 WO9750213 A1 WO 9750213A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- cell
- network
- group
- cells
- access
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5614—User Network Interface
- H04L2012/5615—Network termination, e.g. NT1, NT2, PBX
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
Definitions
- the present invention relates to a method of controlling access to an asynchronous transfer mode transmission network for messages contained in cells transmitted by data sources, said method comprising a first step of defining a transmission contract between each data source and said network and a second step of authorizing the access of the cells to the network.
- the invention also relates to a device for implementing said method and to a communication system comprising such a device.
- Traditional communication networks such as, for example, telephone or cable television are by nature intended each for a particular use and thus individually ill- adapted to executing the tasks which the other networks execute.
- Networks of a novel type have thus appeared and notably those operating in an Asynchronous Transfer Mode (ATM).
- ATM Asynchronous Transfer Mode
- the transmission of a signal is effected in a digital data stream which is subdivided into fixed-size cells (53 octets).
- Each cell itself is formed by a header (5 octets) which contains the necessary information for the transfer of the cell, and a pay load (48 octets), containing the useful information generated by a source. All the generated cells are then multiplexed via queues which are joined together to form an ATM network.
- admission control which the invention does not relate to, consists of verifying, when a user A wishes to communicate with a user B, whether the network has enough resources for effectively authorizing the connection of A and the corresponding data transfer to B, taking account of the connections already established across the network at that particular instant and of the necessity of not producing disturbances for these established connections.
- the operation of user parameter control (UPC) to which the present invention relates consists of verifying that the sending user well respects the transmission contract which has been the object of the preceding admission control. Indeed, if this contract is violated either by accident (malfunctioning of the software) or voluntarily (fraudulent action), the additional resources which the network is to assign to these non- authorized data transfers are taken from those that had already been assigned to the connections admitted by contract and respecting their transmission contract. Furthermore, an unforeseen data congestion may result from this violation of contract and corrupt wholly or in part the operation of the network. Indeed, the queues are always of limited length, and, finally, more and more data cells occur which are to be discarded.
- the message is rejected, or at any rate labeled to be transmitted only with a lower priority and on condition that it does not cause any problem for the operation of the network, even if the message is admitted.
- the invention relates to a method as defined in the opening paragraph of the description and is furthermore characterized in that, for each source: the first step comprises for the cells which occur in each time unit, a first operation of classification into n groups, depending on the larger or smaller value of the time interval between two successive cells, that is to say, depending on the instantaneous rate associated to each cell, and a second operation of distributing a global stock of tokens allocated to said time unit in proportion to the number of cells in each group; the second step comprises for each cell which occurs at the input of the network a first operation of requesting authorization of access of this cell to the network, said access only occurring in the case of an available token for the group that corresponds to the instantaneous rate of this cell, followed, if access is refused, by one or various additional operations of requesting authorization to access the same cell by successively searching for an available token per group that has directly higher instantaneous rates, till an authorization of access for one of the groups encountered, or definitive refusal.
- this method is further characterized in that, for implementing said second step, a cell rank verification operation occurs, either followed by an operation of acceptance of this cell by the network if this cell is the first cell to occur for the time interval concerned and the token reserve corresponding thereto, or, if this cell is not the first cell, by a first test operation testing whether a token is available in the group to which the respective cell belongs, taking account of the value of its instantaneous rate, while, if there is no such token available, this first test operation is followed by a second test step for testing whether or not there is a group that corresponds to higher instantaneous rate values and, if there is indeed such token, whether there is an available token in this group.
- the invention relates to a device as described in the opening paragraph of the description and which is furthermore characterized in that: said transmission contract defining stage comprises a traffic featuring circuit of each of said data sources by determining the instantaneous rate of the cells transmitted by each source and classifying for each source each of the cells which occur per predetermined unit of time into n groups depending on the larger or smaller value of this instantaneous rate, and an allocation circuit for allocating a global stock of tokens allocated to said time unit by distributing said tokens in proportion to the number of cells in each group; said access management sub-assembly comprises a storage memory for storing the numbers of tokens allocated to each group by said allocation circuit and a switch for authorizing the access to a network as a function of the number of tokens which, for a cell transmitted with a value of a given instantaneous rate, remain available for the group corresponding to said value or, if there is no such cell, for a corresponding
- Another object of the invention is also to propose a communication system between at least one data source and one communication network, including such a device.
- the invention relates to a communication system comprising, in addition to the source and the network: a transmission contract defining stage including a traffic featuring circuit for classifying data cells transmitted by each source into n groups depending on the larger or smaller instantaneous rate value associated to each cell that occurs at the input of the network, and an allocation circuit for allocating a global stock of tokens by distributing said tokens in proportion to the number of cells in each group; an access management sub-assembly including a storage memory for storing numbers of tokens allocated to each group by said allocation circuit and a switch for authorizing the network access as a function of the number of tokens which, for a transmitted cell having a given instantaneous rate value, remain available for the group that corresponds to said value or, if there is no such cell, for a group corresponding to higher instantaneous rate values.
- - Fig. 1 is an example of a communication system implementing the access control method according to the invention
- - Fig. 2 is an example of a distribution curve of the instantaneous rate values of the cells transmitted by a data source
- FIG. 3 and 4 are flow charts illustrating two embodiments of the access control method according to the invention.
- Fig. 1 shows an example of a communication system comprising an ATM network 10, a data source 11 and a network access control device, including a defining stage for defining a transmission contract between the source and the network, which is here a token reservation stage 12, and an access management sub-assembly 13.
- the data source 11 comprises, for example, as indicated in Fig. 1, an ATM cell generator 111 and a storage memory 112 for storing cells produced by this generator (these cells are denoted Cj).
- Stage 12 comprises a storage memory 121 for storing token reserves and a switch 122.
- the access management sub-assembly 13 comprises a traffic featuring circuit 131 of the source and a token allocation circuit 132.
- the first group contains all the instantaneous rate values which are comprised between, for example 0% and 25% of the maximum value, the second group those comprised between 25% and 50% , the third group those comprised between 50% and 75% and the fourth group those comprised between 75% and 100%.
- Fig. 2 shows an example of a distribution of the instantaneous rates for a classification into four groups of equal size (any classification considered is not more than a choice: the narrower the intervals are, the more the management of the traffic is refined in a precise manner), but the number of groups may certainly be different and the sizes of these groups may be different from each other.
- the tokens instead of one given token reserve being allocated per time unit T( source), the tokens are allocated per group and with a number of tokens per group determined by the proportion of expected cells in each group (that is to say, by the proportions as represented in the distribution curve of Fig. 2). This allocation is realized by circuit 132 which sends the token allocation values per group to the memory 121.
- a first possible embodiment of the invention is explained hereafter with reference to the flow chart of Fig. 3.
- the level of tokens in the group to which the cell belongs (group determined by the tests T,, T 2 , T 3 , T 4 , whose outputs Y and N respectively designate that it either or not belongs to the tested group) is controlled (control TK
- a cell no longer finds tokens in the group to which it belongs, its access to the network is not authorized (output N, of the control TK,), unless it finds an available token (control TK 2 ) in the adjacent group corresponding to instantaneous rates which have higher values. This token is then used, which correspondingly reduces the token reserve that was allocated to the faster cells. If, in contrast, it does not find tokens in this adjacent group (output N 2 ), its access to the network is again refused, unless, there again, it finds an available token (control TK 3 , output Y 3 ), in the adjacent group of tokens that corresponds to rates which have even higher values, and so on (control TK ⁇ , output Y 4 or N 4 ).
- a second embodiment of the invention is proposed hereafter with reference to the flow chart of Fig. 4 which begins at the position "START".
- the first step shown (step 31) consists for each time interval of storing the allocation of tokens per group under the influence of circuit 132 and as a function of the featuring effected by circuit 131.
- the second step (step 32) consists of verifying the rank of this cell.
- this cell is the first cell (output Y,) to present itself for the time interval under consideration and the token reserve corresponding thereto, it is accepted (step 210) by the network 10 (the access to the network is made by closing the switch 122: connection D, in the embodiment of Fig. 1), and its instant of arrival is stored. If, on the other hand, it is not the first cell (output N,), the time interval separating its instant of arrival T N from the instant of arrival of the preceding cell (denoted T B in a general manner) is stored (sub-step Bl), and the corresponding instantaneous rate is calculated (this rate is equal to 1/(T N -T B )). The value thus calculated allows to classify the respective cell into one of the n (here 4) groups defined above (sub-step B2).
- a test 33 is then provided for verifying whether a token is still available (output Y 3 ) or not (output N 3 ) for the group to which the respective cell belongs, taking account of the value of its instantaneous rate 1 /(T N -T B ) . If a token is available (output Y 3 ), this token is used, the token reserve for this group decreases by unity, and the cell is accepted by the network 10 (step 210).
- a second test 35 is provided for verifying, on the one hand, whether there still exists a corresponding group that has higher instantaneous rate values and, on the other hand, if it exists, whether a token is still available (output Y 5 ) or not (output N 5 ) for this other group.
- Step 32 is obviously only carried out for the first cell and the process proceeds directly in the other cases from the sub-step A2 to the sub-step Bl with a new calculation of the instantaneous rate 1/(T N -T B ).
- a cell is thus only admitted to the network if the cell finds a token still available in the group to which it belongs, or, if there is no such token, in a group that corresponds to instantaneous rates having a higher value.
- a slower cell may take the place of a faster cell, but not the other way round.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP97925225A EP0846386A1 (en) | 1996-06-26 | 1997-06-23 | Network access control method, and device and system for implementing this method |
US09/029,208 US6201790B1 (en) | 1996-06-26 | 1997-06-23 | Network access control method, and device and system for implementing this method |
JP10502609A JPH11511938A (en) | 1996-06-26 | 1997-06-23 | Method for controlling access to a network, and devices and systems for implementing the method |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9607939A FR2750555A1 (en) | 1996-06-26 | 1996-06-26 | Access control method e.g. for ATM transmission network |
FR96/07939 | 1996-06-26 | ||
FR9700897 | 1997-01-28 | ||
FR97/00897 | 1997-01-28 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1997050213A1 true WO1997050213A1 (en) | 1997-12-31 |
Family
ID=26232788
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB1997/000753 WO1997050213A1 (en) | 1996-06-26 | 1997-06-23 | Network access control method, and device and system for implementing this method |
Country Status (4)
Country | Link |
---|---|
US (1) | US6201790B1 (en) |
EP (1) | EP0846386A1 (en) |
JP (1) | JPH11511938A (en) |
WO (1) | WO1997050213A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2331659A (en) * | 1997-11-21 | 1999-05-26 | Ericsson Telefon Ab L M | Resource reservation |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6570847B1 (en) * | 1998-12-31 | 2003-05-27 | At&T Corp. | Method and system for network traffic rate control based on fractional tokens |
US6636482B2 (en) * | 2001-03-08 | 2003-10-21 | Arris International, Inc. | Method and apparatus for controlling traffic loading of different service levels in a cable data system |
US20030084171A1 (en) * | 2001-10-29 | 2003-05-01 | Sun Microsystems, Inc., A Delaware Corporation | User access control to distributed resources on a data communications network |
US7512972B2 (en) * | 2002-09-13 | 2009-03-31 | Sun Microsystems, Inc. | Synchronizing for digital content access control |
US20040059939A1 (en) * | 2002-09-13 | 2004-03-25 | Sun Microsystems, Inc., A Delaware Corporation | Controlled delivery of digital content in a system for digital content access control |
US7913312B2 (en) | 2002-09-13 | 2011-03-22 | Oracle America, Inc. | Embedded content requests in a rights locker system for digital content access control |
US20040083370A1 (en) * | 2002-09-13 | 2004-04-29 | Sun Microsystems, Inc., A Delaware Corporation | Rights maintenance in a rights locker system for digital content access control |
US7398557B2 (en) * | 2002-09-13 | 2008-07-08 | Sun Microsystems, Inc. | Accessing in a rights locker system for digital content access control |
US7380280B2 (en) * | 2002-09-13 | 2008-05-27 | Sun Microsystems, Inc. | Rights locker for digital content access control |
US7363651B2 (en) | 2002-09-13 | 2008-04-22 | Sun Microsystems, Inc. | System for digital content access control |
US20040059913A1 (en) * | 2002-09-13 | 2004-03-25 | Sun Microsystems, Inc., A Delaware Corporation | Accessing for controlled delivery of digital content in a system for digital content access control |
US7240365B2 (en) * | 2002-09-13 | 2007-07-03 | Sun Microsystems, Inc. | Repositing for digital content access control |
WO2004112335A1 (en) * | 2003-06-12 | 2004-12-23 | Camiant, Inc. | Pcmm application manager |
EP2262175B1 (en) * | 2003-06-12 | 2018-01-17 | Camiant, Inc. | Dynamic service delivery with topology discovery for communication networks |
EP1705993B1 (en) * | 2004-01-23 | 2017-08-30 | Camiant, Inc. | Video policy server |
US9020913B2 (en) | 2007-10-25 | 2015-04-28 | International Business Machines Corporation | Real-time interactive authorization for enterprise search |
US9113334B2 (en) * | 2008-02-01 | 2015-08-18 | Tekelec, Inc. | Methods, systems, and computer readable media for controlling access to voice resources in mobile networks using mobility management signaling messages |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0473330A1 (en) * | 1990-08-23 | 1992-03-04 | AT&T Corp. | Serving constant bit rate traffic in a broadband data switch |
US5274644A (en) * | 1991-11-05 | 1993-12-28 | At&T Bell Laboratories | Efficient, rate-base multiclass access control |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5313454A (en) * | 1992-04-01 | 1994-05-17 | Stratacom, Inc. | Congestion control for cell networks |
GB9405406D0 (en) | 1994-03-18 | 1994-05-04 | Netcomm Ltd | Atm cell switch |
US5790521A (en) * | 1994-08-01 | 1998-08-04 | The University Of Iowa Research Foundation | Marking mechanism for controlling consecutive packet loss in ATM networks |
US5949785A (en) * | 1995-11-01 | 1999-09-07 | Whittaker Corporation | Network access communications system and methodology |
US5625622A (en) * | 1995-12-27 | 1997-04-29 | Lucent Technologies Inc. | Apparatus and method for a generalized leaky bucket |
US5864540A (en) * | 1997-04-04 | 1999-01-26 | At&T Corp/Csi Zeinet(A Cabletron Co.) | Method for integrated traffic shaping in a packet-switched network |
-
1997
- 1997-06-23 JP JP10502609A patent/JPH11511938A/en active Pending
- 1997-06-23 WO PCT/IB1997/000753 patent/WO1997050213A1/en not_active Application Discontinuation
- 1997-06-23 EP EP97925225A patent/EP0846386A1/en not_active Withdrawn
- 1997-06-23 US US09/029,208 patent/US6201790B1/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0473330A1 (en) * | 1990-08-23 | 1992-03-04 | AT&T Corp. | Serving constant bit rate traffic in a broadband data switch |
US5274644A (en) * | 1991-11-05 | 1993-12-28 | At&T Bell Laboratories | Efficient, rate-base multiclass access control |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2331659A (en) * | 1997-11-21 | 1999-05-26 | Ericsson Telefon Ab L M | Resource reservation |
US6661806B1 (en) | 1997-11-21 | 2003-12-09 | Telefonaktiebolaget Lm Ericsson(Publ) | Resource reservation |
Also Published As
Publication number | Publication date |
---|---|
US6201790B1 (en) | 2001-03-13 |
JPH11511938A (en) | 1999-10-12 |
EP0846386A1 (en) | 1998-06-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6201790B1 (en) | Network access control method, and device and system for implementing this method | |
JP2620513B2 (en) | Communication network, connection method thereof, and communication network node | |
EP0754383B1 (en) | Bandwidth management and access control for an atm network | |
EP0814632B1 (en) | Method and device for multiclass ATM connection admission control | |
JP3065983B2 (en) | Method and apparatus for scheduling transmission of cells, early deadline first (EDF) scheduler, communication network, multi-layer cell scheduler | |
US5675573A (en) | Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic | |
KR960003783B1 (en) | Subscriber atm mux for interface to isdn | |
JP3278865B2 (en) | Traffic control method | |
US5408465A (en) | Flexible scheme for admission control of multimedia streams on integrated networks | |
US6442164B1 (en) | Method and system for allocating bandwidth and buffer resources to constant bit rate (CBR) traffic | |
EP0702472A1 (en) | A method and an apparatus for shaping the output traffic in a fixed length cell switching network node | |
EP0989770B1 (en) | Packet transfer control apparatus and scheduling method therefor | |
JPH0744542B2 (en) | Bandwidth allocation method of virtual path in asynchronous transfer mode | |
WO1995024812A1 (en) | Broadband switching network | |
JPH0946336A (en) | Method for permission control and routing by allocating network resource to network node | |
JPH1093591A (en) | Method for optimum transmission of atm cell | |
US6298049B1 (en) | Method and arrangement for upstream timeslot assignment, and communication system wherein the method is used | |
EP0838970B1 (en) | Method for shared memory management in network nodes | |
US6341134B1 (en) | Process for the arrangement of equitable-loss packets | |
JP4485622B2 (en) | Method and apparatus for performing outbound shaping based on leaky bucket in ATM scheduler | |
JPH0818576A (en) | Communication system | |
US5539738A (en) | Information multiplexing device for transmitting cells via a communication network | |
EP1039774B1 (en) | An ATM buffer controller and a method thereof | |
KR960003782B1 (en) | Scheduling controller and its method of subscriber access device of isdn | |
JPH09162869A (en) | Connection reception control method and congestion control method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1997925225 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref country code: JP Ref document number: 1998 502609 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09029208 Country of ref document: US |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 1997925225 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1997925225 Country of ref document: EP |