CA2076271C - Communications network class-of-service routing - Google Patents

Communications network class-of-service routing

Info

Publication number
CA2076271C
CA2076271C CA002076271A CA2076271A CA2076271C CA 2076271 C CA2076271 C CA 2076271C CA 002076271 A CA002076271 A CA 002076271A CA 2076271 A CA2076271 A CA 2076271A CA 2076271 C CA2076271 C CA 2076271C
Authority
CA
Canada
Prior art keywords
service
incoming call
routing
call
class
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CA002076271A
Other languages
French (fr)
Other versions
CA2076271A1 (en
Inventor
Gerald Richard Ash
Jin-Shi Chen
Alan Eugene Frey
David F. Mcguigan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
AT&T Corp
Original Assignee
American Telephone and Telegraph Co Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by American Telephone and Telegraph Co Inc filed Critical American Telephone and Telegraph Co Inc
Publication of CA2076271A1 publication Critical patent/CA2076271A1/en
Application granted granted Critical
Publication of CA2076271C publication Critical patent/CA2076271C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q3/00Selecting arrangements
    • H04Q3/64Distributing or queueing
    • H04Q3/66Traffic distributors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q3/00Selecting arrangements
    • H04Q3/0016Arrangements providing connection between exchanges
    • H04Q3/0029Provisions for intelligent networking
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13141Hunting for free outlet, circuit or channel
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13164Traffic (registration, measurement,...)
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13166Fault prevention
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13251Restricted service, class of service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13332Broadband, CATV, dynamic bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13353Routing table, map memory
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13523Indexing scheme relating to selecting arrangements in general and for multiplex systems bandwidth management, e.g. capacity management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13541Indexing scheme relating to selecting arrangements in general and for multiplex systems routing

Abstract

The routing of calls of different classes of services as well as the administration thereof is enhanced by associating each such class of service with a number of parameters common to such services, such that each class of service, as well as a new class of service, may be readily identified by its respective parameter values. Accordingly, the routing and administration of calls of different classes of services may be handled in a systematic, straight forward manner so that basic network capabilities may be made available to various services using an administratively defined menu like structure. In addition, such class of serviceadvantageously partitions network bandwidth allocation, call routing priority, voice/data transport, and traffic data registers into respective classes of services.

Description

COMMUNICATIONS NETWORK CLASS-OF-SERVICE ROUTING

Field of the Invention The invention relates to teleco.. ~nication~ netw~lL.s, such as a public switched network, and more particularly relates to controlling the way in which 5 te1ephone calls, and the like, ~sociated with respective classes of n~lwolk services are routed through a teleco..... u~ ation~ network.
Bael~,. ou.,d of the L,~ntiG
Routing is a co--....... -l~nications n~IWO1k function that is performed to a~l~ance a telephone call from an origination point to a destin~tion point. Such a 10 routing function is, therefore, at the heart of the architecture, design and operation of a col.. .~.nic~tions network. Most routing functions were initially designed to route what is commonly referred to as "Plain Old Telephone Service" (POTS) calls.
Th~ r, to meet cUstomer and co...l-e!;~;ve dem~n-ls, co....~ ications n~,lwolks began offering additional services, such as, for example, (a) digital services for 15 t~spulLing data, (b) very low blocking services to ensure with a high level of probability that associated service calls are routed to their destinatiQn~ during times of nelw~lk congestion, and (c) the well-known 800 and 900 number services. The introduction of a new service is usually acco...p~nie~l by a change in the underlying routing function so that telephone calls ~sociated with the new service may be 20 plu~lly routed to their res~eclive ~estination~ However, over time, each suchchange may cause the underlying network routing function to become complex and unwieldy to ~dmini~ter, thereby making it difficult to further change the routing funcdon to accommn~l~te other new services.
Summary of the Invention The art of teleco....... .~-ication~ switching is advanced, in accord with theinvendon, by associadng each such class of service with a number of pala~ ,tel~
co..... ~n to all such services and by distinguishing different classes of services from one another by their respective p~l,eter values. In particular, each such class of service is associated with a service identity value and a transport capability value 30 which control the routing of an associated call to its destin~tion~ In an illustrative embo~liment of the invention, a pair of service identity and transport capability values are tr~nsl~ into a respective routing pattern identity value defining a r~s~liv-e blocking objective. The routing of a call to its destination is thus controlled by a blocking objective specified by a respective routing pattern identity 35 value derived for the associated call. ~

- la-In accordance with one aspect of the invention there is provided an arrangement for processing a telephone call in a telecommunications system comprising a plurality of switches interconnected by individual ones of a plurality of communications paths, said processing being based on a class of service associated 5 with the incoming call, said arrangement comprising at each of said switches a first translation table formed from a plurality of records each comprising a plurality of fields respectively containing particular parameters characterizing a particulartelephone class of service and further containing an associated service identity value indicative of said class of service, means, responsive to receipt of an incoming call at 10 a respective one of said switches, for deriving from information associated with said incoming call a transport capability value and the parameters characterizing thetelephone service that should be associated with the incoming call and for translating said derived parameters into the associated service identity value using said first translation table and means for deriving a routing index as a function of the transport 15 capability and service identity values derived for said incoming call and for then routing said incoming call to a destination switch in accordance with said routing mdex.
In accordance with another aspect of the invention there is provided a method for use in a telecommunications system comprising a plurality of switches20 interconnected by individual ones of a plurality of communications paths, said method controlling the routing of an incoming call based on a class of service associated with the incoming call, said method comprising the steps of storing in memory a translation table formed from a plurality of records each comprising a plurality of fields respectively containing particular parameters characterizing a respective class of 25 telephone service and further containing an associated service identity value indicative of said telephone service, responsive to receipt of an incoming call at a respective one of said switches, deriving from information associated with said incoming call atransport capability value and the parameters characterizing the telephone service associated with the incoming call and then translating said derived parameters into the 30 associated service identity value using said translation table, and deriving a routing index as a function of the transport capability and service identity values derived for said incoming call and then routing said incoming call to a destination switch via a route selected as a function of said routing index.

Brief Description of the Drawin~s In the drawing:
FIG. 1 is a broad block diagram of a te1eco....~ tions network in which the principles of the invention may be pra~ tice~;
S FIG. 2 illustrates an example of a table that may be used in the network of FIG. 1 to translate inr("~n~tion ~soci~ted with a call into a respective service identity value;
FIG. 3 illustrates an example of a table that may be used in the network of FIG. 1 to translate a ~ poll capability associated with a call into a leSpeCli~ve 10 transport capability value;
FIG. 4 illustrates an example of a table that may be used in the network of FIG. 1 to translate a pair of service identity and transport capability values into a es~cti~e routing pattern identity value; and FIGs. 5-7 illustrate examples for selecting a mllltilink path to route a 15 call under particular traffic condition~
Detailed Description In an exemplary embodiment of the invention, co..~ ic~tion~
network 200 shown in FIG. 1 may be a telephone network, such as, for example, the well-known AT&T public switched network that provides a plurality of voice and 20 data services for its user (subscribers), such as the subscriber associated with tPl~hone station set S 1. Network 200 incl~ es~ inter alia, a plurality of Toll Switches (TS), e.g., 205, 210, and 215, and International Switching Centers (ISC), e.g., 230. As is well-known, an ISC is used to establish cG..~ ic~ti~nS (telephone) conn~tions bet..cen network 200 and an o~e~eas switching center, such as a 25 ~v~itching center located in the United Kingdom. Such overseas connections are epl~,3e-lt~-1 in the FIG. by co.. ~ ti()n~ path 236.
Toll switches 205, 210 and 215 as well as ISC 230 may be any one of the well-known types of switching e~lui~ll,ent, such as, for example, the No. 4ESS
(Electronic Switching System) available from AT&T. It is seen from the FIG. that a 30 toll switch, e.g., TS 205 (210, 215), may be connçcted to a number of so-called central offlces provided by Local Exchange Carriers (LECs), such as LEC 105 (110, 120). A toll switch, e.g., TS 215, may also be cQnnect~ to what is co.. ollly eÇe~,~l to as Customer Provided E4uip~l~nt (CPE), which may be, for example, a so-called private branch exchange. The operation of a central office as well as a 35 private branch exchange is well-known and will not be discussed herein. However, it sufflces to say that a central office or CPE is arranged to send to an associated nclwtjl~ 200 toll switch a telephone call originated at a calling telephone station set (herein the calling party), e.g., S5 or S6, which has dialed a particular long fli~t~n~e tel~hone number. A central office or CPE is also arranged to col-nP,cl to a telephone station set, e.g., S4, (herein the called party) a call that the CO or CPE I~Ce;~reS from S an ~soci~ted toll switch.
In a~ldition, each toll switch, e.g., 205, 210, etc., and ISC, e.g., 230, is connected to a data link 150, which may be, for example, the well-known Common Ch~nnel Sign~ling System network (CCS). CCS network 150 is arranged so that the toll switches and ISCs may exchange data m~ss~ges with one another in order to 10 establish via n~lwolk 200 a conne~ lion between two f~cilifiçs, e.g, central offices, ~ ively serving a calling telephone station, e.~-,st~tion S 1, and a called telephone station, e.g., station S4.
In contemplation of the invention, each telephone call pl~lcessed by n~,lw~l~ 200 is ~soci~ted with a particular class of service (COS), and each such 15 service is definçd, in accord with an aspect of the invention, by a group of p~letel~, for example, four ~ ttcl~. The respective values of the four ~al~"~ te,~ define the type of routing and transport capability that are accorded to the ~soci~t~d COS.
Specific~lly, the group of p~l~ete.~ associated with a particular COS
includes what we call Service Identity (SI), Transport Capability (TC), Routing Pattern Identity (RPI) and Circuit Selection Identity (CSI). SI identifiçs a particular service, e.g., Long Distance Service (LDS), Software Defined Network (SDN) service, 800 service, etc., and/or calling feature associated with an incoming call ori in~ting at a toll switch, e.g., TS 205. Such a calling feature may be, for exarnple, 25 what is co.. QI-ly referred to as "Priority Routing", as will be explained below in detail. In an illu~llali~e embo liment of the invention, an SI is derived for each in-~oming call based on infc,ll,lation associated with the call. Such inrolmalion in~lu~s (a) whether the int oming call originated at a LEC or CPE (CPE is also referred to herein as a nodal); (b) whether the destin~fion point is a LEC, nodal or an Intern~ti~n~l Switching Center ( e.g., ISC 230);(c) ~ign~ling service type, e.g., voice; and (d) dialed service type, such as, for example, special access codes for 800 number services.
As is well-known, the origin~tion (e.g., LEC) and ~estin~tion (e.g., ISC) points ~soci~te~ with an incoming call at a toll switch may be determined from the identity of the trunk group which l~cei~,es the incoming call at the toll switch and the dialed digits identifying the called station, lespeclively. For example, if the dialed digits happen to be NPA-xxx-yyyy (where NPA defines part of the North ~meriC~n dialing plan commf)nly referred to as the "N umbering P lan A rea code"), then it is likely that a LEC is the ~estin~tion point for the ~cso~i~t~A call. If the format of the dialed digits define a so-called country code (i.e, a code ~soci~tecl with on o.e.~,eas 5 COul~tl~), for example, 01 l-aa-bb-xxx-yyyy, then it is likely that the destin~tion point is an ISC, e.g., ISC 230. As a last example, if the dialed digits (e.g., xxx-yyyy) are not ~co.nl ~ni~ by an NPA or country code, then it is likely that a nodal (CPE) is the destin~tion point.
The next p,~,~llet~r, Transport capability (TC) defines the tr~n~mi~si-~n 10 capability that will be used in routing an incoming call to-a destin~tion toll switch, in which the transport capability may be, for example, voice tr~n~mi~sion, or data t~n~mission (e.g., 64 kb/s, 384 kb/s, etc). The TC pa,~lleter may be dctellllined from the identity of the trunk group that receives the incoming call at the origin~ting toll switch, or from particular digits prefixed to the dialed number. For example, for 15 a so-called Accunet switched 56 digital data service, the prefix digits would be 700-OS~xxxx.
As will be shown below, the SI and TC values derived for an in~omingcall are then mapped (tr~nsl~ted), in accord with an aspect of the invention, into another pal~ll~tel, which we call a Routing Pattern Identity (RPI). The RPI value is 20 then used to specify the routing ~ ...ellt that should be accorded to an associated i~-co...;l-g call. In an illu~ embo lim~nt of the invention, such L~alment is defined as a so-called blocking objective, i.e., a particular level of call blocl~ing, as well as the routing priority, bandwidth ~llocation) voice/data transport, data rate, and traffic data registers. All of these pa,alllelel~ can be set independently by the class of 25 service, and in this ,l~ ner define a sep~te virtual nelwolk on the shared ~ u neIWV1I~ for each class of service. The rvuting priority is used by a toll switch e~pc.i~ncing traffic congestion as a means of del~ g wl-clll., the routing of a particular call to a destin~tion toll switch should be given pl~fel~, ce over other calls.
That is, during such traffic congestion, a call ~soci~ted with a first RPI value would 30 be given routing l)~f~"~ nce over another call associated with a second RPI value.
Whereas, a call a~soci~ted with the second RPI value would be given routing pl~fe,~,. ce over a call associated with a third RPI value, and so on. (As an aside, the highest routing pl~ nce is commonly referred to as "key service protection", as will be explained below.) 2~7~2~q As ~lisc~l~se~ above, a co~ n~ tion~ n~lwo,l~ routing function is ch~nged from time to time to ~ccomm~te a new service. Such a change is not ~chie~_d easily, and typically entails adding a new sorlwdl~ program module to the routing function and changing other such m~ules, thereby c~using the routing S funcdon to beco...e, over time, complex and unwieldy to a~lmini~ter.
We deal with this problem by providing at each toll switch a first table comprising a plurality of records each comprising a plurality of fields. One of the fields of a record identifies a ~j~li~e SI value and the rem~in-1er of such fields identify the infolmalion that is derived from the dialed null~r and/or identity of the 10 trunk associated with an in~Qming call. We also provide at each toll switch a second table for ~soci~tin~ a particular transport capability with a respective value, and a third table for tr~n.~l~ting the values of a particular SI, TC pair into a respective RPI
value. Accordingly, then, the a~lmini~tration of the routing function vis-a-vis adding a new or (1eleting an eYi~ting service boils down to, in accord with an aspect of the 15 invention, adding or deleting an entry in the first table and, possibly, an entry in the second table and third tables.
In ~iition, each such toll switch is arranged, in accord with an aspect of the invention, to pass to a succee-ling toll switch involved in establishing a conne~lion between the int oming call and a telel)hone station j~1entified by the dialed 20 digits, the a~soci~teA TC and SI values. The progression of a call co~ e~-l;on is lL~.~fol~ controlled by its ~ssoci~te~l COS type as characteri7~A by TC and SI values derived at the origin~tinp toll switch. Each succeerling switch may then use the SI
and TC values to control the routing of the ~soci~ted call to a next switch.
Turning now to FIG. 2, there is shown an illustrative example of a 25 table 300 that an originating toll switch may use to translate the afo~ ne..t;oned hlfo....r~;~n ~soci~te~l with an incoming call ("calling inÇollllation") into an SI
(service identity) value. It is seen from the FIG. that fields 301 through 304 define, inter alia, ~ parameters ~soci~ted with an incoming call (i.e., the afol~,.l~nlioned calling information), which, in combination, define a respective SI
30 value shown in field 305 of the æ~soci~tecl record. Advantageously, then, all that an origin~ting toll switch, e.g., TS 205 (FIG. 1), needs to do to identify the type of service that should be accorded to an incoming telephone call is to consult table 300.
Mol~ , in the event that network 200 introduces a new service, then table 300 may be easily ~pA~ted to include that service.

In particular, field 301 of a table 300 record contqin~ a p~dll,et~r defining ~I,.,II.er the ingress point of an incoming call is, for exarnple, a local exchqn~ carrier (LEC), nodal, ISC, etc. Field 302 of table 300 contqins a p~ te~inrlir,q,tin~ whether, at a network 200 egress point, the incolning call will be routed to S its ultimqte dc;,~ n (called station) via, for eX-qmple~ a LEC, nodal, ISC, etc.
Field 303 cont~qin~ a pal~l~ter identifying a ~ignqling service type that is q-~sociq-with the incoming call. (That is, the SI value is a function of the type of ~,~;ved signqling infol~ ion.) Such signaling service types include~ inter alia, conventional Long Distance Service (IDS) and what is cornmnnly referred to as a Software 10 Defined Network (SDN). Field 304 of a table 300 record contains a pa~ et~ r ~Pfinin~ a dialed service type that is a~soci~terl with an inroming call. (That is, the SI value is also a function of the dialed number info. . . IAI ;on ) In the in~t~nre where field 303 of the ~csoc;~led record defines the incoming call dialed nu.nber inÇo....~l;on as being con~el~;on~l LDS, then the conte.l~s of the ~soci~ted field 304 15 co~ ins a null word, which is .ep.~senled in the FIG. by a "dash", as is shown for records 300-1, 300-3 and 300-4. In other in~t~nces the contents of field 304 defines one of a number of diff~ t dialed service types, for ex~mple, INWATS, as definedby ~soci~ted dialed nu..l~r info~ ation. The last field 305 of a table 300 record provides an SI value. For example, the p~-~ete~ (contents) shown in fields 301 20 through 304 of record 300- 1, in combination, define an SI value of 7. Whereas, the cQnt~ t~ of fileds 301 through 304 of records 300-5 and 300- 6 define SI values of 6 and 8, ..,~pec~ely. The contents of fields 301 through 304 of records 300-7 through 300-9 and their ~soci~ted SI values ~p~se.-t the remaining records of table 300 as well as records that may be added in the future to support new classes of services.
Turning now to FIG. 3, there is shown table 400 that an ori in~ting toll switch may use to translate quickly a transport capability (TC) into a particular value for the pu~Jose of d~ te,~ll-lling the RPI (Routing Pattern Identity) for an in~oming call. As ,n~ ~.t;oned above, a TC may be either voice or digital data. For digital data, each entry (record) in table 400 defines a particular data rate as well as a 30 tr~n~missi~n format, e.g., a restricted format (R) or clear ch~nnel format (C).
Turning now to FIG. 4, there is shown table 500 that an origin~ting toll switch may use to translate a SI and TC combinadon (or pair) into a pardcular RPI
value, or index. For example, the SI, TC pairs of (6,3) translate into an RPI value of S ~le.finin~ a so-called Normal (N) priority level for the associated service. As 35 ano~ller example, the SI,TC pair of (8,1) translate into an RPI value of 2 defining a so-called Key (K) service priority level for the associated service. In an illustradve ~ o ~

e~lbo~ of the invention, and, as mentionecl above, the key service priority level defines the highest priority level that may be accorded to a lc~e~ live service, and takes precedence over a lower priority level, such as the normal (N) priority level.
As a further example, SI,TC pairs of (p,1) and (q,l) tr~n~l~te into ~spe.,live RPI
S values of, for example, 10 and 15, lcis~e~ lively. The RPI values of 10 and 15.,~;li./ely define, for example, a Low (L) priority level.
(Hereinafter, for the sake of ~iiscussion~ and not by way of limit~tion, the terms "Lightly T4 1ç~3" (LL) and "Heavily T 4adeA~ (HL) when used in reference to the load status of a direct path between two toll switches will be taken to mean that 10 of the number of trunks forming the path more than 5%, and less than 5% are available, l~ sp~-lively. The term "Key Reserved State" will be taken to mean that only trunks reserved for key services are available and the term "busy", if used, will be taken to mean that all such trunks are busy.) Thus, in accord with an aspect of the invention, the RPI values define a 15 hic.~ hy of priority levels ranging from key service, the highest priority level objective, to Lj the lowest priority level. Accordingly, the routing of an inComing call ~soci~ted with a particular class of service defined by a respective pair of SI and TC values is controlled by an associated RPI value, as will be explained below.
For example, assume that for a call defining a SI, TC pair of (q,1) the 20 origin~tin~: and dc~ alion toll switches are toll switches 205 and 215, ~jpcclively.
Also assume that the current level of traffic (load status) for direct path 303 (FIG. 1 ) has reached the HL state. In such situ~tion, then, the call would not be advanced via direct path 303 since the L priority level set for a SI,TC pair of (q,1) does not meet the current HL load state ~s-.med for path 303. If, on the other hand, the call 25 defined a SI,TC pair of (1,1) then TS 205 would route the call to TS 215 via direct path 303, since, in accord with illustrative table 500, the priority level (RPI) for pair (1,1) is Normal (N), which meets the current load state ~sllm~cl for path 303.
However, if the current level of traffic for path 303 ha~ned to be at the Key d load state, then TS 205 would route the call over path 303 only if the call 30 defined a SI,TC pair that is accorded a key service priority level, such as, for eA&llplt, the SI,TC pair of (8,1). If the call cannot be routed via a direct path, then a toll switch, e.g., TS 205, would attempt to route the call via an alternate route, as explained below.
The instant invention is particularly adv~nt~geous when practiced in 35 conjunction with the alternate routing arrangement that is commonly referred to as Real Time Network Routing (RTNR). RTNR is ~ closed in "Real-Time Network ~07~

Routing in a Dynamic Class-of-Service Network", G. R. Ash, et al, 13th Intern~tion~l Teletraffic Con~ress, pp. 187-194, which is hereby incol~lated by rerel~"~ce. Briefly, and referring to FIG. 1, if an originating toll switch, e.g., 205 cannot advance (route) a call to a destination toll switch, e.g., TS 215, via a direct 5 link, e.g., path 303, then the originating toll switch may attempt to advance the call via a multiple-link path, e.g., a two-link path. A multiple-link path comrriees a direct path (link) between the ori~in~ting toll switch and an int~rmP~ te toll switch and a direct path (link) ~et~n the latter toll switch and the destination toll switch.
The origin~ting toll switch locates such a multiple-link path by sending to the 10 destination toll switch via CCS network 150 a message requesting the current traffic levels (load states) of other direct links between the destin~tion toll switch and other toll swilches. In l~;i,ponse to the request, the destination switch returns to the origin~tin~ switch via CCS network 150 a number of so-called bit maps indicative of such load states. The bit maps lespe~ ely identify which direct paths from other15 toll switches to the desl;n~lion toll switch are lightly loaded, normally loaded, key and busy.
Upon receipt of the bit maps the originating toll switch logically COlllpàleS ("ands") them with its own bit maps identifying the current load states of le;"~i~e direct paths between the originating toll switch and the other toll switches.
20 The res~llting bit maps then identify effectively the load states of l~,s~ e multipl~-link paths between the origin~ting and destin~tion toll switches.
An illu~LIati~e example of such a bit map relating to lightly loaded states which a destination switch, e.g., TS 215, may return to an origin~ting toll switch, e.g., TS 205, is shown in FIG. 5. As inllicated by the binary value of one, only the 25 direct path from toll switch 215 to toll switch 220 is lightly loaded. As mPntioned, the origin~tin~ toll switch m~int~in~ its own bit maps of the load states of direct paths to other toll switches. One possible example of the bit map relating to lightly loaded states which the origin~ting toll switch may m~int~in is shown in FIG. 6.Similarly, as indic~tpA by the binary values of one shown in the latter FIG., direct 30 paths from origin~ting toll switch 205 to toll switches 210 and 220 are most lightly loaded. The result of "anding" the bit maps of FIGs. 5 and 6 is shown in FIG. 7.FIG. 7 in~ tes in a similar lllalmer that a lightly loaded multiple-link path involving toll switch 220 as an inle...~ te toll switch may be available. (It is noted that, ~lthough not shown in the FIGs., the originating toll switch could also gen~late 35 bit maps l~spec~i~ely identifying normally loaded and key service multiple-link paths.) Accordingly, then, origin~ting toll switch 205 would, in accord with ~IG. 7, route the call to dc~ ;on switch 215 via a path 304 trunk capable of satisfying the transport capability specified by the ~soci~ted call. In doing so, the origin~ting switch would send to the interm~3i~te switch, the TC and SI values 5 ~ssoci~t~A with the call. If, in the event that such a trunk is not available, then TS 205 would block the call if the call is associated with a blocking object of LL.
TS 205 would do so since FIG. 7 in~linatçs that no other multiple-link path is available for a blocking objective of LL. However, if the call were ~soçi~ted with a higher priority level, e.g., key service, or if the blocking objective for this service is 10 not being met, then TS 205 would consult its lc.ll~ining "resulting" bit maps to locate another available multiple-link path having the requisite transport capability.
If such a path is available, then TS 205 would route the call to the intermç~ teswitch switch via that path. The intermedi~te switch would then route the call to destin~tion switch 215. If a path is not available, then TS 205 would block the call.
As mentionçd above, at the request of the nrigin~ting switch, the destin~tion switch returns bit maps identifying the loads states of direct paths to other toll switches. As also mentioned above, the destination switch returns a bit map for each of the load states. In con~çmplation of the invention, the destination switch may be advantageously arranged so that it returns to the origin~ting switch 20 only those bit maps which satisfy the blocking objective associated with the class of service of the pertinent telephone call.
In particular, the originating switch may include in the afolcmcntioned request mess~ge that it sends to the destin~tion switch the priority level value~soci~tçA with the pertinent call. If the priority level value happened to be, for 25 ex~ e Low (L) priority, then the ~estin~tion switch would return to the originqting switch only the bit map identifying the lightly loaded (LL) direct paths (links) con~-ect~A bc l~en the ~iestin~tion switch and other s~ilches, if any. Thus, the de,;.!;~ ?n switch would, in the latter case, return just one bit map rather than three or four bit maps. If, on the other hand, the priority level value happened to be, 30 for e A~llple, key service priority (K), then, in that case, the destination switch would return, for example, three bit maps. As ~i~cussed above, the three bit maps would l~s~~ .ly identify lightly loaded, heavily loaded and key ~cse. ~/ed state direct paths conl-cc-~l bel~.~n the destin~tion switch and other switches.
As is well-known, an origin~ting switch creates a billing record for each 35 in- oming call that it processes and is answered by a called party. As is also well-known, a billing record is associated with the calling party's telephone number.

Periodically, the billing records that have been created by an ~rigin~ting switch over a p~Ae t~ ll,ned duration of time are pl~sellted to a billing center for p..~ce,s~ g- As a result of such lllvces~;ng, "telephone bills" are created and sent to c;,~;li~,e subscribers. Typically, a telephone bill includes such info.,lla~ion as, for e..c~n-~.lf., 5 the called number, date and time of the call and duradon of the call. A billing record may also include a service code that iclentifies an ~csoci~ted class of service so that the billing center may ~soci~te a call with a class of service.
As an aspect of the invention, the SI and TC values that an originating switch derives for a call may be substituted in the associated billing record for the 10 afonc ..e!.l;oned service code. Accordingly, the billing center may then associate the SI and TC values contained in a billing record with a lespeclilre class of service and include the latter infolmation in the respective telephone bill, thereby elimin~ting the need to ~ inl~;n and a~lrnini~ter such service codes.
The fol~æoing is merely illustrative of the principles of the invention.
15 Those skilled in the art will be able to devise nulllerous arr~nge ..~nl~, which, although not explicitly shown or described hefein, ne ~e. Il,cless embody those principles that are within the spirit and scope of the invention.

Claims (17)

1. An arrangement for processing a telephone call in a telecommunications system comprising a plurality of switches interconnected by individual ones of aplurality of communications paths, said processing being based on a class of service associated with the incoming call, said arrangement comprising at each of said switches a first translation table formed from a plurality of records each comprising a plurality of fields respectively containing particular parameters characterizing a particular telephone class of service and further containing an associated service identity value indicative of said class of service, means, responsive to receipt of an incoming call at a respective one of said switches, for deriving from information associated with said incoming call a transport capability value and the parameters characterizing the telephone service that should be associated with the incoming call and for translating said derived parameters into the associated service identity value using said first translation table and means for deriving a routing index as a function of the transport capability and service identity values derived for said incoming call and for then routing said incoming call to a destination switch in accordance with said routing index.
2. The arrangement set forth in claim 1 wherein said means for routing said incoming call includes means operative in the event that said incoming call cannot be routed to said destination via a route selected as a function of said routing index for then routing said call via another route having a current blocking objective that is not being met for the class of service associated with said incoming call.
3. The arrangement set forth in claim 2 wherein said incoming call is received at an originating one of said switches and said selected route is a multiple-link path and wherein said originating switch includes means operative for identifying said multiple-link path as a function of information obtained from said destination switch, such that the load status of said multiple-link path is commensurate with the routing index derived for said incoming call.
4. The arrangement set forth in claim 1 wherein said parameters include at leasta service signalling type and dialed service type.
5. The arrangement set forth in claim 1 wherein said means for deriving includes means for deriving a circuit selection identity value from said information and wherein said service identity and transport capability values and said circuit selection identity value and said routing pattern index define the class of service that is associated with said incoming call.
6. The arrangement set forth in claim 1 wherein said incoming call is associatedwith a billing record and wherein said SI and TC values are included in said billing record so that an associated billing center may include at least the class of service associated with said call in a telephone bill.
7. The arrangement set forth in claim 1 wherein said routing index specifies a routing treatment used in the processing of said call, said routing treatment including a blocking objective that is used in the selection of a route to said destination switch.
8. The arrangement set forth in claim 1 wherein said routing index specifies a routing treatment that is used in the processing of said call, said routing treatment including a routing priority value specifying whether said call may be routed over a particular path reserved for a call associated with key services.
9. The arrangement set forth in claim 1 wherein said routing index specifies a routing treatment that is used in the processing of said call, said routing treatment including a bandwidth allocation value indicative of the level of bandwidth that is to be assigned to said call.
10. A method for use in a telecommunications system comprising a plurality of switches interconnected by individual ones of a plurality of communications paths, said method controlling the routing of an incoming call based on a class of service associated with the incoming call, said method comprising the steps of storing in memory a translation table formed from a plurality of records each comprising a plurality of fields respectively containing particular parameters characterizing a respective class of telephone service and further containing anassociated service identity value indicative of said telephone service, responsive to receipt of an incoming call at a respective one of said switches, deriving from information associated with said incoming call a transport capability value and the parameters characterizing the telephone service associated with the incoming call and then translating said derived parameters into the associated service identity value using said translation table, and deriving a routing index as a function of the transport capability and service identity values derived for said incoming call and then routing said incoming call to a destination switch via a route selected as a function of said routing index.
11. A method for use in a telecommunications system comprising a plurality of switches interconnected by individual ones of a plurality of communications paths, said method controlling the routing of an incoming call based on a class of service associated with the incoming call, said method comprising the steps of storing in memory a translation table formed from a plurality of records each comprising a plurality of fields respectively containing particular parameters characterizing a respective class of telephone service and an associated serviceidentity value indicative of said telephone service, responsive to receipt of an incoming call at a respective one of said switches, deriving from information associated with said incoming call a transport capability value and the parameters characterizing the telephone service associated with the incoming call and then translating said derived parameters into the associated service identity value using the stored translation table, routing said incoming call to a destination switch as a function of said serviceidentity and transport capability values derived for said incoming call, wherein said step of routing includes the steps of defining, as a function of said service identity and transport capability values derived for said incoming call, a priority level, and selecting as a route to said destination switch a route having a current load status commensurate with the priority level derived for said incoming call.
12. The method set forth in claim 11 wherein said step of deriving includes the step of deriving a circuit selection identity value from said information and deriving a routing pattern index as a function of said service identity and transport capability values and wherein said service identity and transport capability values and said circuit selection identity value and said routing pattern index define the class of service that is associated with said incoming call.
13. The method set forth in claim 11 wherein said route is a multiple-link path and wherein said step of routing includes the step of identifying said multiple-link path as a function of information obtained from said destination switch, such that the load status of said multiple-link path is commensurate with the priority level defined for said incoming call.
14. A method of processing a call in a telecommunications system comprising a plurality of switches interconnected by individual ones of a plurality of communications paths, said method selecting a route to a destination switch for an incoming call based on a class of service associated with the incoming call and comprising the steps of storing in memory a first table formed from a plurality of records each having a plurality of fields, one of said fields of each of said first table records containing a respective service identity value associated with a respective one of said classes of services, and other ones of said fields containing information associated with an incoming call that is to be routed in accord with a respective one of said classes of services, storing in memory a second table formed from a plurality of records each having a plurality of fields, one of said fields of each of said second table records containing at least one pair of service identity and transport capability values and at least another one of said fields of each of said second table records continuing a respective routing pattern identity value, receiving an incoming call at an originating one of said switches, translating information associated with said incoming call into a service identity value and a transport capability value using said first table, deriving a respective routing index for said incoming call as a function of said service identity and transport capability values using said second table, and routing said incoming call to a destination switch via a path selected as a function of said routing index, whereby a new class of service may be readily defined by inserting in respective fields of an available record contained in said first table a respective service identity value and associated call information and inserting in respective fields of an available record contained in said second table the service identity and transport capability values associated with the new class of service and a respective routing index.
15. The method set forth in claim 14 wherein said service identity and transportcapability values define the class of service that is associated with said incoming call.
16. The method set forth in claim 14 wherein said path is a multiple-link link path and wherein said method includes the step of identifying said multiple-link path as a function of information obtained from said destination switch, said information including the load status of direct paths from said destination switch to other ones of said switches.
17. The method set forth in claim 14 wherein said call information includes information indicating (a) whether said incoming call originated at a local exchange carrier or customer premises equipment; (b) whether the destination is a local exchange carrier, nodal or international switching center; (c) signalling service type;
and (d) dialed service type.
CA002076271A 1991-10-03 1992-08-17 Communications network class-of-service routing Expired - Fee Related CA2076271C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US770,396 1991-10-03
US07/770,396 US5392344A (en) 1991-10-03 1991-10-03 Communications network class-of-service routing

Publications (2)

Publication Number Publication Date
CA2076271A1 CA2076271A1 (en) 1993-04-04
CA2076271C true CA2076271C (en) 1997-03-25

Family

ID=25088413

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002076271A Expired - Fee Related CA2076271C (en) 1991-10-03 1992-08-17 Communications network class-of-service routing

Country Status (6)

Country Link
US (1) US5392344A (en)
EP (1) EP0535857B1 (en)
JP (1) JP2957052B2 (en)
CA (1) CA2076271C (en)
DE (1) DE69230307T2 (en)
ES (1) ES2140404T3 (en)

Families Citing this family (48)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5715303A (en) * 1993-05-26 1998-02-03 U S West Communications, Inc. Method and system for configuring a telecommunication switch and identifying a record generated by same
US6738357B1 (en) * 1993-06-09 2004-05-18 Btg International Inc. Method and apparatus for multiple media digital communication system
US5657451A (en) * 1994-01-24 1997-08-12 Telefonaktiebolaget Lm Ericsson System for determining whether to accept new supplementary services based upon identified types of supplementary service interactions and identified supplementary service interaction criteria
US5500889A (en) * 1994-06-09 1996-03-19 At&T Corp. Method and apparatus for prioritizing a telephone call according to a level of service of an originator
FI99187C (en) * 1994-11-24 1997-10-10 Tecnomen Oy A method and apparatus for adding intelligent functions to a telecommunications network
US5754787A (en) * 1994-12-23 1998-05-19 Intel Corporation System for electronically publishing objects with header specifying minimum and maximum required transport delivery rates and threshold being amount publisher is willing to pay
US5854898A (en) 1995-02-24 1998-12-29 Apple Computer, Inc. System for automatically adding additional data stream to existing media connection between two end points upon exchange of notifying and confirmation messages therebetween
US5572582A (en) * 1995-02-24 1996-11-05 Apple Computer, Inc. Method and apparatus for establishing communication between two teleconferencing endpoints
US5973724A (en) * 1995-02-24 1999-10-26 Apple Computer, Inc. Merging multiple teleconferences
GB9603582D0 (en) 1996-02-20 1996-04-17 Hewlett Packard Co Method of accessing service resource items that are for use in a telecommunications system
KR0160347B1 (en) * 1995-12-22 1998-12-15 양승택 Information service
KR100414916B1 (en) * 1995-12-30 2004-04-03 삼성전자주식회사 Method for call distribution routing by call rate
US5781624A (en) * 1996-02-16 1998-07-14 Lucent Technologies Inc. Method for sharing network resources by virtual partitioning
WO1997039563A1 (en) * 1996-04-16 1997-10-23 Telco Systems, Inc. Method and apparatus for providing bypass networks in a telephone system
US6154445A (en) 1996-04-18 2000-11-28 Bell Atlantic Network Services, Inc. Telephony communication via varied redundant networks
US6069890A (en) 1996-06-26 2000-05-30 Bell Atlantic Network Services, Inc. Internet telephone service
US5825779A (en) * 1996-10-07 1998-10-20 Timeplex, Inc. PBX networking with quality of service control
US6078582A (en) 1996-12-18 2000-06-20 Bell Atlantic Network Services, Inc. Internet long distance telephone service
US6310873B1 (en) 1997-01-09 2001-10-30 International Business Machines Corporation Internet telephony directory server
US6137869A (en) 1997-09-16 2000-10-24 Bell Atlantic Network Services, Inc. Network session management
US6574216B1 (en) 1997-03-11 2003-06-03 Verizon Services Corp. Packet data network voice call quality monitoring
US6292479B1 (en) 1997-03-19 2001-09-18 Bell Atlantic Network Services, Inc. Transport of caller identification information through diverse communication networks
US6870827B1 (en) 1997-03-19 2005-03-22 Verizon Services Corp. Voice call alternative routing through PSTN and internet networks
US5956396A (en) * 1997-05-06 1999-09-21 At&T Corp Class-of-service automatic routing
US6574321B1 (en) 1997-05-08 2003-06-03 Sentry Telecom Systems Inc. Apparatus and method for management of policies on the usage of telecommunications services
US5949864A (en) * 1997-05-08 1999-09-07 Cox; Neil B. Fraud prevention apparatus and method for performing policing functions for telephone services
US6151315A (en) * 1997-06-02 2000-11-21 At&T Corp Method and apparatus for achieving fabric independent routing technique
WO1999003257A1 (en) * 1997-07-09 1999-01-21 Sbc Technology Resources, Inc. Local routing system and method
GB2329791A (en) * 1997-09-25 1999-03-31 Dsc Telecom Lp A call routing system for routing calls to or from subscriber terminals in a telecommunications system
DE19809044B4 (en) * 1998-03-04 2004-11-04 Deutsche Telekom Ag Traffic routing method in telecommunications networks
US6490347B2 (en) * 1998-04-24 2002-12-03 At&T Corp. Method and apparatus for providing telecommunications trunk group selection for use in a public network in accordance with customer preference
US6721278B1 (en) 1998-04-30 2004-04-13 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic allocation of packet data channels
DE19827347A1 (en) * 1998-06-19 1999-12-23 Alcatel Sa Method for offering and holding network capacity and network management facility for carrying out the method
US6275695B1 (en) * 1998-10-08 2001-08-14 Nortel Networks Limited Spectrum yield management in a wireless communication system
US7502315B2 (en) * 1998-12-21 2009-03-10 At&T Intellectual Property Ii, L.P. Method for hybrid network planning
US6496480B1 (en) 1999-03-17 2002-12-17 At&T Corp. Success-to-the-top class of service routing
US6590867B1 (en) 1999-05-27 2003-07-08 At&T Corp. Internet protocol (IP) class-of-service routing technique
JP3321442B2 (en) 1999-10-13 2002-09-03 エヌ・ティ・ティ・コムウェア株式会社 Communication charge calculating apparatus, control method thereof, and recording medium
JP4091723B2 (en) * 2000-02-04 2008-05-28 富士通株式会社 Data transfer method and apparatus
US6778535B1 (en) 2000-03-29 2004-08-17 At&T Corp. PNNI-based multi-link shortest path Class-of Service routing technique
NL1015006C2 (en) * 2000-04-25 2001-10-26 Koninkl Kpn Nv Telecommunications network where terminals can elect to receive messages from, or give priority to, only those terminals registered with server
US7002919B1 (en) * 2000-08-16 2006-02-21 Lucent Technologies Inc. Method and system for guaranteeing quality of service for voice-over-IP services
US7095834B2 (en) * 2002-04-30 2006-08-22 Bellsouth Intellectual Property Corporation Methods and systems for 1+ prepaid routing service
US6980635B2 (en) * 2002-04-30 2005-12-27 Bellsouth Intellectual Property Corporation Methods and systems for automated prepaid service routing
EP1619892B1 (en) * 2003-04-10 2010-06-23 Panasonic Corporation Information recording medium, device and method for recording information in information recording medium
US7957266B2 (en) * 2004-05-28 2011-06-07 Alcatel-Lucent Usa Inc. Efficient and robust routing independent of traffic pattern variability
JP5139815B2 (en) 2008-01-10 2013-02-06 日本電気株式会社 Call control apparatus, call control system, call control method, and call control program
US8238538B2 (en) 2009-05-28 2012-08-07 Comcast Cable Communications, Llc Stateful home phone service

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4191860A (en) * 1978-07-13 1980-03-04 Bell Telephone Laboratories, Incorporated Data base communication call processing method
US4577066A (en) * 1983-08-03 1986-03-18 At&T Bell Laboratories Telephone interexchange call routing
US4656658A (en) * 1985-10-11 1987-04-07 American Telephone And Telegraph Company Network routing arrangement
JPS62250791A (en) * 1986-04-23 1987-10-31 Nec Corp Call controlling system for time of call-incomming collision
JP2515770B2 (en) * 1986-12-24 1996-07-10 株式会社日立製作所 Line switching method
US5101451A (en) * 1988-12-29 1992-03-31 At&T Bell Laboratories Real-time network routing
AU618897B2 (en) * 1989-05-17 1992-01-09 Telstra Corporation Limited A telecommunications system and routing method
JPH03108862A (en) * 1989-09-21 1991-05-09 Matsushita Electric Ind Co Ltd Method of receiving a call to private branch electronic switching system responding to isdn
US5042062A (en) * 1989-10-23 1991-08-20 At&T Bell Laboratories Method and apparatus for providing real-time switching of high bandwidth transmission channels
US5086460A (en) * 1990-04-02 1992-02-04 At&T Bell Laboratories Communications system ingress and egress arrangement
US5131016A (en) * 1991-01-09 1992-07-14 International Business Machines Corporation Communications network data compression control system and method

Also Published As

Publication number Publication date
EP0535857A2 (en) 1993-04-07
CA2076271A1 (en) 1993-04-04
JP2957052B2 (en) 1999-10-04
US5392344A (en) 1995-02-21
ES2140404T3 (en) 2000-03-01
JPH07170327A (en) 1995-07-04
EP0535857A3 (en) 1994-07-20
DE69230307T2 (en) 2000-05-11
EP0535857B1 (en) 1999-11-17
DE69230307D1 (en) 1999-12-23

Similar Documents

Publication Publication Date Title
CA2076271C (en) Communications network class-of-service routing
CA2107453C (en) Caller directed routing of a telephone call based on a dialed suffix
US4756020A (en) Method and apparatus for disallowing the extension of a call through a network
JP3236445B2 (en) Communication method and communication device
CA2076521C (en) Use-code based call-treatment selection
US5559877A (en) Automatic provisioning of trunking and routing parameters in a telecommunications network
US5574780A (en) Controll of call features provided to a subscriber by a hierarchical telecommunication switch
US5099511A (en) Exchange system for incoming calls from direct-in lines
CA1252861A (en) Method and apparatus for disallowing the extension of a call through a network
US6330323B1 (en) Enhanced overflow call processing
CA1186038A (en) Arrangement for multiple custom calling
JP3226721B2 (en) Communication method and communication device
US6748064B2 (en) Systems and methods for least cost routing of long distance or international telephone calls
CA2034888C (en) Communications system ingress and egress arrangement
CA1220265A (en) Method and apparatus for providing call tracing service
US5956394A (en) Common treatment of calls from subscribers served by different types of telecommunication equipment
CA2186922A1 (en) Method and apparatus for processing telephone calls
GB1320941A (en) Communications switching system
JP2001507187A (en) Communication network
EP0774875B1 (en) Hierarchical switch support of services for subscribers based on organizational membership
Ludwig et al. Saturation routing network limits
US3705275A (en) Telephone trunk testing system
US2646466A (en) Connector switch
US3019299A (en) Switching selector repeater
EP1416742B1 (en) A method to provide an operator selection service as well as a communications network and a call server therefore

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed