WO2001095601A1 - Method for controlling allocation of references to digital addresses - Google Patents
Method for controlling allocation of references to digital addresses Download PDFInfo
- Publication number
- WO2001095601A1 WO2001095601A1 PCT/FR2001/001757 FR0101757W WO0195601A1 WO 2001095601 A1 WO2001095601 A1 WO 2001095601A1 FR 0101757 W FR0101757 W FR 0101757W WO 0195601 A1 WO0195601 A1 WO 0195601A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- addresses
- list
- group
- allocation
- request
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/42—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker
- H04Q3/54—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised
- H04Q3/545—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised using a stored programme
- H04Q3/54508—Configuration, initialisation
- H04Q3/54533—Configuration data, translation, passwords, databases
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/58—Arrangements providing connection between main exchange and sub-exchange or satellite
- H04Q3/62—Arrangements providing connection between main exchange and sub-exchange or satellite for connecting to private branch exchanges
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1305—Software aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13056—Routines, finite state machines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13097—Numbering, addressing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13103—Memory
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13204—Protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13349—Network management
Definitions
- the present invention relates to methods for controlling allocation of references to entities designated by digital addresses. It applies in particular in the field of subscriber group management in telecommunications systems.
- the digital addresses correspond to directory numbers assigned to subscribers or to terminals of the system, and the references whose allocation is controlled can represent groups of subscribers of the system for which communications can be established of group.
- subscribers' equipment is limited with regard to the number of groups of which they can belong simultaneously. This limitation is for example due to the fact that the terminals have a limited memory area for storing the references of these groups.
- the maximum numbers of groups per subscriber may be different from one organization to another.
- Different types of groups can also be provided (for example a national or regional extension group), the maximum number of groups per subscriber being able to be different from one type to another.
- An object of the present invention is to propose a method of controlling constraints relating to the number of allocable references per address, which is flexible and relatively undemanding in terms of information storage.
- the invention thus proposes a method for controlling allocation of references to digital addresses, in which a first list of address values and a second list of numbers of references is stored, by ordering the values of the first list and associating respectively the pairs of consecutive values of the first list with numbers of the second list, each pair of consecutive values of the first list delimiting an interval such that the number of references allocated to each address whose value is in said interval is equal the number of the second list associated with said pair.
- the first and second lists are updated in processing allocation and deletion requests allocation of references to groups of addresses.
- Maintaining the two lists and managing the address space at intervals is simple to implement, which also facilitates system maintenance. They avoid having to associate with each address the current number of references which are allocated to it, which would be very unfavorable in terms of speed of execution and required memory space.
- each allocation request is formulated by defining the group of addresses as consisting of at least one set of addresses, a value of said limit being associated with each set of addresses.
- Each of these address sets is composed of at least one segment of consecutive addresses.
- the digital addresses are structured in several fields, corresponding for example to identifiers of networks, subnets and terminals or to prefixes corresponding to different geographical areas of the system deployed.
- the numerical addresses being structured in Q fields (Q> 1) and the fields having rows from 1 to Q respectively in relation to the ordering of the address values of the first list, each allocation request or deleting the allocation of a reference to a group of addresses can be formulated by defining said group of addresses as consisting of one or more sets each described by two respective end addresses.
- the processing of this request then advantageously comprises: - a decomposition of the group of addresses into segments, each segment being composed of addresses having the same field of rank q for each integer q ranging from 1 to Q-1 and whose fields of rank Q respectively contain consecutive numbers ranging from the smallest to the largest of the numbers contained in the rank Q fields of the two end addresses describing a set of addresses of the group; and - an update of the first and second lists on the basis of the addresses located at the ends of said segments.
- the processing of a request for allocating a reference to a group of addresses may comprise, for each segment of the group and each interval, delimited by a pair of consecutive address values from the first list, with which the segment has an overlap, a comparison between the limit associated with this segment and the number of references in the second list associated with said pair, the allocation request being refused if the comparison shows that the limit is reached.
- An advantageous optimization of the memory required by the method consists in keeping the first and second lists so that the reference numbers of the second list associated with pairs of address values of the first list delimiting two adjacent intervals are always different.
- Another aspect of the present invention relates to a device for controlling allocation of references to digital addresses comprising means for processing allocation requests and deleting allocation of references to groups of addresses and means for storing a first list of address values and a second list of reference numbers, by ordering the values of the first list and by associating respectively the pairs of consecutive values of the first list with numbers of the second list, each pair of consecutive values of the first list delimiting an interval such that the number of references allocated to each address whose value is in said interval is equal to the number of the second list associated with said pair.
- the processing means comprise means for updating the first and second lists and means for determining on the basis of the first and second lists, in response to a request for allocation of a reference to a group of addresses, s 'there is a situation where the processing of the allocation request increases the number of references allocated to at least one of the addresses of said group beyond a limit associated with said address, and to refuse the request for allowance if said situation arises.
- the invention also relates to a computer program, loadable in a memory associated with a processor, and comprising portions of code for the implementation of a method as defined above during the execution of said program by the processor, as well as a computer medium on which such a program is recorded.
- FIG. 1 is a general diagram of a telecommunications system to which the invention can be applied
- FIG. 2 is a block diagram of a control device according to the invention forming part of a mediation server of the system of Figure 1;
- FIG. 3 is a diagram illustrating the definition of subscriber groups in an embodiment of the invention.
- FIGS. 4 and 5 are flowcharts of programs capable of implementing a method according to the invention.
- the telecommunications system represented in FIG. 1 comprises several networks which will be supposed to belong to different organizations. These networks share an addressing plan under the control of a mediation server 10.
- This server ensures the integrity of the system by notably verifying the orders placed by the operators of the various networks.
- the integrity criteria to be checked there is that relating to the maximum number of subscriber groups to which a given subscriber can belong. This number can generally depend on the organization to which this subscriber belongs.
- FIG. 2 schematically illustrates the module 12 of the mediation server 10 which ensures the control of the numbers of groups of subscribers, with the aid of a memory 14 in which two lists L, M are stored as explained below .
- the module 12 examines requests for group allocation or deletion of group allocation originating from the network controllers, and returns acknowledgment messages to validate or refuse these requests.
- the module 12 consists of a program executed by a processor of the mediation server 10.
- FIG. 3 illustrates an example of addressing method in the telecommunication system, and of definition of a set related addresses.
- R of rank 1
- the prefix R designates for example a network of attachment of the terminal, the field FS designating a fleet and / or a sub-fleet to which the terminal belongs, and field I designating an individual terminal in this fleet or sub-fleet.
- the complete address R FS I can consist of nine digits, for example with three digits for each field.
- a connected set of addresses can be described geometrically by two values of addresses X, Y such as in an orthogonal coordinate system of three-dimensional space whose coordinate axes correspond respectively to the values of the three fields R, FS and I, the points whose coordinates are given by the three fields of the addresses X and Y form the opposite vertices of a rectangular parallelepiped whose faces are parallel to the coordinate axes of the coordinate system.
- the addresses of the set are then those located inside this rectangular parallelepiped.
- a group of subscribers to which a reference or a group identifier can be allocated can correspond to one or more sets of addresses of the kind illustrated in FIG. 3. The number of these sets is noted P (P > 1).
- a request to allocate or delete an address group designates P sets of related addresses constituting said group. Each of these sets is made up of addresses belonging to the same organization, for which the maximum number of references H (p) is identical. On the other hand, this maximum number H (p) may be different from one set p to another if the address group does not contain only addresses belonging to the same organization.
- the request indicates, implicitly or explicitly, the maximum number H (p) of groups of subscribers to which the subscribers of each related set p of the new group requested may belong.
- This number H (p) can be included explicitly in the request, or deduced by the module 12 from other information contained in this request, for example from a common prefix to the addresses of the subscribers of the set and / or an indication of the type of group requested (national, regional, ).
- the numbers H (p), or some of them, can also be deduced from the origin of the request (which network / organization made this request).
- the control module 12 translates the problem with Q dimensions into a problem with one dimension, by decomposing the group of addresses, defined as consisting of one or more related sets delimited by addresses of ends X (p), Y ( p), in a number K of segments (K> 1).
- Each segment k (1 ⁇ k ⁇ K) is composed of addresses of a connected set of the group having the same field of rank q for each integer q ranging from 1 to Q-1.
- the Q rank fields of these addresses contain the consecutive numbers between the smallest (X Q (p)) and the largest (Y Q (p)) of the numbers contained in the Q field ranks of the two X end addresses (p), Y (p) of a connected set of the group.
- a segment corresponds to the intersection of the parallelepiped r with a straight line parallel to the axis I.
- step 20 An example of the procedure for decomposing a set of addresses into segments is illustrated in FIG. 4.
- step 20 the indices k, p and q are initialized to 1.
- a loop 21-23 is then executed to set at zero of the variables ⁇ q for q ranging from 1 to Q-1, after which the index q is taken equal to Q-1 in step 24.
- N (k) is also assigned to the segment k in this step 25. This number N (k) is equal to the number H (p) contained implicitly or explicitly in the request relative to the set p from which the segment is extracted.
- a comparison 26 is then made between the numbers X q (p) + ⁇ q and Y q (p) - If X q (p) + ⁇ q ⁇ Y q (p), the variable ⁇ q is incremented by one in step 27, after which the index q is also incremented by one unit in step 28, likewise the index k in the next step 29.
- the module 12 returns to the aforementioned loop 21-23 to reset the variables ⁇ q to ⁇ Q-1
- the index q is compared to 1 in test 30 and then decremented by one unit in step 31 if q> 1. After l step 31, the module 12 repeats the comparison 26 with the new value of the index q.
- the module 12 compares the index p to the number of sets P (test 32). If p ⁇ P, the index p is incremented by one at step 33, after which the module 12 joins the above-mentioned step 29.
- the disjoint segments [A (k), B (k)] are not numbered in ascending order of addresses, they are sorted to put them in this order at step 35.
- L and M are used to count the numbers of groups of subscribers to which the subscribers designated by the different possible addresses belong. These lists are kept so as to verify the following property: if L (i) ⁇ ADD ⁇ L (i + 1), then M (i) subscriber group identifiers are allocated to the terminal of address ADD at the instant considered. In this expression, the index i points to the lists L and M. We see that the number M (i) is associated with the pair (L (i), L (i + 1)) which delimits an address range of terminals to which M (i) group identifiers are allocated.
- Table I illustrates an example of the content of the L and M lists.
- the subscribers with addresses between 780,000,000 and 780,000,049 belong to a single group
- those with addresses between 780,000,050 and 780,000,074 belong to two groups and the other subscribers do not belong to any group.
- the module 12 On receipt of a request for allocation or deletion of allocation relating to P related sets of addresses, the module 12 first performs a decomposition of the group of addresses into segments, for example according to the procedure of FIG. 4 corresponding to a case where the decomposition provides K disjoint segments in the order of increasing addresses, then it processes the request, for example according to the procedure illustrated in FIG. 5.
- a decomposition of the group of addresses into segments, for example according to the procedure of FIG. 4 corresponding to a case where the decomposition provides K disjoint segments in the order of increasing addresses, then it processes the request, for example according to the procedure illustrated in FIG. 5.
- the module 12 On receipt of a request for allocation or deletion of allocation relating to P related sets of addresses, the module 12 first performs a decomposition of the group of addresses into segments, for example according to the procedure of FIG. 4 corresponding to a case where the decomposition provides K disjoint segments in the order of increasing addresses, then it processes the request, for example according to the procedure
- This procedure uses two auxiliary lists L ', M' which, if the request is validated, are copied into the lists L and M to update them at the end of the procedure.
- the notation j denotes the number of entries in the lists L and M.
- step 40 the indices k and i are initialized to 1, and the offset ⁇ is initialized to zero.
- the first comparison 41 is performed between the start address of the k-th segment A (k) and the value L (i- ⁇ ) of the list L.
- a (k)> L (i- ⁇ ) the inputs L '(i) and M' (i) of the auxiliary lists L ', M' receive respectively the values L (i- ⁇ ) and M (i- ⁇ ) of the lists L and M (step 42), then the index i is incremented by one at step 43 after which the module 12 repeats the comparison 41.
- comparison 48 cannot give rise to M '(i)> N (k), so that it can be shunted.
- a (k) L (i- ⁇ )
- M '(i-1) M '(i-1). This is why the module 12 performs the comparison 50.
- M (i- ⁇ ) + ⁇ ⁇ M '(i-1) the module 12 goes directly to the steps 46, 47 and 48 mentioned above. Otherwise, the variables ⁇ and i are each decremented by one unit in step 51, which will delete an entry in the lists L and M. After this step 51, the module 12 proceeds to the above comparison 48.
- step 52 When comparison 48 does not show a violation of the integrity constraint (M '(i) ⁇ N (k)), the index i is incremented by one unit at step 52, after which the module 12 passes at the other end of segment k, starting with comparison 53. If this shows that B (k) +1> L (i- ⁇ ), module 12 performs step 54 where it assigns the address L (i- ⁇ ) at the i-th entry in the list L '. After step 54, the module 12 returns to the aforementioned step 47.
- step 57 is executed to assign the values B (k) +1 and M (i- ⁇ ) respectively to the i-th entries of the lists L 'and M'.
- a comparison 58 is made between the current segment index k and the total number K of segments of the group.
- step 60 is executed to decrement the variables ⁇ and i before carrying out the aforementioned comparison 58.
- the number i- ⁇ is compared with the size j of lists L and M (comparison 62). If i- ⁇ ⁇ j, the index i is incremented by one in step 63, then the values L (i- ⁇ ) and M (i- ⁇ ) are respectively assigned to the i-th entries of the lists L 'and M' in step 64, after which the comparison 62 is repeated.
- the module 12 delivers a positive acknowledgment to authorize the requesting unit to make or delete the allocation required (step 65), and the auxiliary lists L 'and M' are finally copied in the lists L and M in step 66, where the size j also receives the current value of the index i.
- the processing according to FIG. 5 requires a limited number of accesses in memory, and simple operations of comparison and incrementation of whole variables. It therefore presents great simplicity while offering the desired flexibility as regards the allocation constraints taken into account.
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2001266122A AU2001266122A1 (en) | 2000-06-09 | 2001-06-07 | Method for controlling allocation of references to digital addresses |
EP01943578A EP1287669A1 (en) | 2000-06-09 | 2001-06-07 | Method for controlling allocation of references to digital addresses |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR00/07429 | 2000-06-09 | ||
FR0007429A FR2810128B1 (en) | 2000-06-09 | 2000-06-09 | METHOD AND DEVICE FOR CONTROLLING ALLOCATION OF REFERENCES TO NUMERICAL ADDRESSES |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2001095601A1 true WO2001095601A1 (en) | 2001-12-13 |
Family
ID=8851154
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2001/001757 WO2001095601A1 (en) | 2000-06-09 | 2001-06-07 | Method for controlling allocation of references to digital addresses |
Country Status (4)
Country | Link |
---|---|
EP (1) | EP1287669A1 (en) |
AU (1) | AU2001266122A1 (en) |
FR (1) | FR2810128B1 (en) |
WO (1) | WO2001095601A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107708110A (en) * | 2016-08-09 | 2018-02-16 | 京信通信系统(中国)有限公司 | A kind of mark distributing method and device |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5592542A (en) * | 1993-02-02 | 1997-01-07 | Fujitsu Limited | Call distribution control method and call distribution control system |
DE19706794A1 (en) * | 1997-02-20 | 1998-09-03 | Siemens Ag | Program-controlled private exchange system |
DE19838055A1 (en) * | 1997-08-22 | 1999-02-25 | Mitel Corp | PABX communication system for subscriber group allocation |
DE19752403A1 (en) * | 1997-11-26 | 1999-05-27 | Siemens Ag | Communication system for combined terminals |
-
2000
- 2000-06-09 FR FR0007429A patent/FR2810128B1/en not_active Expired - Fee Related
-
2001
- 2001-06-07 AU AU2001266122A patent/AU2001266122A1/en not_active Abandoned
- 2001-06-07 WO PCT/FR2001/001757 patent/WO2001095601A1/en not_active Application Discontinuation
- 2001-06-07 EP EP01943578A patent/EP1287669A1/en not_active Withdrawn
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5592542A (en) * | 1993-02-02 | 1997-01-07 | Fujitsu Limited | Call distribution control method and call distribution control system |
DE19706794A1 (en) * | 1997-02-20 | 1998-09-03 | Siemens Ag | Program-controlled private exchange system |
DE19838055A1 (en) * | 1997-08-22 | 1999-02-25 | Mitel Corp | PABX communication system for subscriber group allocation |
DE19752403A1 (en) * | 1997-11-26 | 1999-05-27 | Siemens Ag | Communication system for combined terminals |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107708110A (en) * | 2016-08-09 | 2018-02-16 | 京信通信系统(中国)有限公司 | A kind of mark distributing method and device |
CN107708110B (en) * | 2016-08-09 | 2020-08-28 | 京信通信系统(中国)有限公司 | Identification distribution method and device |
Also Published As
Publication number | Publication date |
---|---|
AU2001266122A1 (en) | 2001-12-17 |
EP1287669A1 (en) | 2003-03-05 |
FR2810128B1 (en) | 2002-09-27 |
FR2810128A1 (en) | 2001-12-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10764320B2 (en) | Structuring data and pre-compiled exception list engines and internet protocol threat prevention | |
US7917940B2 (en) | Inheritance of controls within a hierarchy of data processing system resources | |
US9225593B2 (en) | Methods of structuring data, pre-compiled exception list engines and network appliances | |
EP1974522B1 (en) | Server, client and method for managing DNSSEC requests | |
EP2901279B1 (en) | Device and method for managing access to a set of network resources made available in a cloud system | |
US10042875B2 (en) | Bloom filter index for device discovery | |
US20080201179A1 (en) | Optimization of policy enforcement | |
FR3030168A1 (en) | METHOD FOR CHOOSING AT LEAST ONE SERVICE AND ASSOCIATED DEVICE | |
US7680822B1 (en) | Method and system for automatically creating and updating access controls lists | |
US7603362B2 (en) | Ordered list management | |
Chang et al. | Fast packet classification using recursive endpoint-cutting and bucket compression on FPGA | |
CN110166221A (en) | A kind of ciphertext compression storing data structure RCPE and data dynamic read/write method | |
CN106708636A (en) | Cluster-based data caching method and apparatus | |
Gummadi et al. | Modeling group trust for peer-to-peer access control | |
EP3503483B1 (en) | Topological address assignment method and server with network switches, computer program and corresponding server cluster | |
CN1411218A (en) | Network addressing control method of zone message | |
WO2001095601A1 (en) | Method for controlling allocation of references to digital addresses | |
EP1102453A1 (en) | Method for domestic and roaming provision for a mobile terminal | |
CN110417777B (en) | Optimized method and device for communication between microservices | |
EP3828707A1 (en) | Method for allocating resources in response to requests according to their priority, corresponding computer program, associated control unit for allocation and computer system | |
EP1912408A1 (en) | Method of managing a database partitioned in a communication network | |
FR3047580B1 (en) | DATA BASE TABLE INDEX | |
More et al. | PRIVACY PRESERVATION ALGORITHM USING EFFECTIVE DATA LOOKUP ORGANIZATION FOR STORAGE CLOUDS | |
CN117319506A (en) | Method, system, device and medium for creating metadata request by multi-channel processing | |
WO2018193190A1 (en) | Method for managing a computer system with dynamic allocation of resources |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2001943578 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2001943578 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001943578 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: JP |