公开(公告)号：US5892822A

公开(公告)日：1999-04-06

申请号：US777752

申请日：1996-12-30

申请人： Louis G. Gottlieb ,  William A. Sims ,  Steven P. Higgins ,  Randall P. Ethier

发明人： Louis G. Gottlieb ,  William A. Sims ,  Steven P. Higgins ,  Randall P. Ethier

IPC分类号： H04Q3/66 ,  H04M7/00

CPC分类号： H04Q3/66 ,  H04M2215/00 ,  H04Q2213/13103 ,  H04Q2213/13141 ,  H04Q2213/13148 ,  H04Q2213/13204 ,  H04Q2213/13345 ,  H04Q2213/13383

摘要： A method of and system for routing switched termination telephone calls in accordance with international routing requirements and with consideration of available network capacity. A call is received at a switch of an international carrier. The switch sends a query identifying the first country as the country of origin for the call and the second country as the country of termination for the call to a service control point of the international carrier. The service control point determines from the query that the call is an international call and sends a request for a routing translation to a regulatory routing platform of the international carrier. The regulatory routing platform determines an optimal route for the call in accordance with international regulatory routing requirements.

摘要翻译： 一种用于根据国际路由要求和考虑可用网络容量来路由交换终端电话呼叫的方法和系统。 在国际运营商的交换机处收到呼叫。 交换机发送查询，识别作为呼叫的起始国的第一国家和第二国家作为呼叫国际运营商的服务控制点的终止国家。 服务控制点从查询中确定呼叫是国际呼叫，并将路由转换请求发送到国际运营商的监管路由平台。 监管路由平台根据国际法规路由要求确定呼叫的最佳路由。

公开(公告)号：US5889846A

公开(公告)日：1999-03-30

申请号：US798531

申请日：1997-02-10

申请人： Dominic M. Ricciardi

发明人： Dominic M. Ricciardi

IPC分类号： H04Q3/66 ,  H04Q11/04 ,  H04M3/42 ,  H04M3/00

CPC分类号： H04Q3/66 ,  H04Q11/0464 ,  H04Q2213/1305 ,  H04Q2213/13091 ,  H04Q2213/13103 ,  H04Q2213/13141 ,  H04Q2213/13176 ,  H04Q2213/13205 ,  H04Q2213/1322 ,  H04Q2213/13286 ,  H04Q2213/13405

摘要： A method and system for processing a software defined network (SDN) call initiated by a network adjunct platform (NAP) over a Small Scale Adjunct Primary Rate Interface (SSA PRI) in a telecommunications network on a call-by-call basis is disclosed. An SDN subscriber triggers the NAP to initiate the SDN call. The NAP forwards set-up data to an originating toll switch programmed to accept the set-up data from the NAP. After receipt of the set-up data, the originating toll switch determines if the forwarded set-up data classifies the call as an SDN call. If the forwarded set-up data contains SDN parameters, the originating toll switch processes and routes the call initiated by the NAP as an SDN call. The originating toll switch is also able to process and route non-SDN calls utilizing the same SSA PRI used for SDN calls. The need for separate dedicated trunk groups for SDN subscribers is alleviated.

摘要翻译： 公开了一种用于通过电话网络中的小规模辅助主速率接口（SSA PRI）在逐个呼叫基础上处理由网络附属平台（NAP）发起的软件定义网络（SDN）呼叫的方法和系统。 SDN用户触发NAP发起SDN呼叫。 NAP将设置数据转发到编程为接受来自NAP的建立数据的始发收费交换机。 收到设置数据后，始发收费交换机确定转发的建立数据是否将呼叫分类为SDN呼叫。 如果转发的建立数据包含SDN参数，则始发收费交换机处理并将由NAP发起的呼叫作为SDN呼叫进行路由。 始发收费交换机还能够使用与SDN呼叫相同的SSA PRI处理和路由非SDN呼叫。 为SDN用户分配专用中继线群的需求得到缓解。

公开(公告)号：US5889782A

公开(公告)日：1999-03-30

申请号：US653885

申请日：1996-05-28

申请人： Ranga R. Dendi

发明人： Ranga R. Dendi

IPC分类号： H04Q3/00 ,  H04Q3/66 ,  H04Q11/04 ,  H04J3/12 ,  H04L12/50 ,  H04Q11/00

CPC分类号： H04Q3/665 ,  H04Q11/0457 ,  H04Q3/0025 ,  H04Q2213/13096 ,  H04Q2213/13103 ,  H04Q2213/13176 ,  H04Q2213/13204 ,  H04Q2213/13209 ,  H04Q2213/13216 ,  H04Q2213/1322

摘要： The present invention is a system and method for transmitting proprietary parameters in a telecommunications network conforming to the ANSI SS7 ISUP Standard. The method includes the steps of identifying proprietary parameters to be transmitted as part of an ISUP SS7 signaling message that includes a network specific Generic Digits parameter and encapsulating those parameters within the network specific Generic Digits parameter.

摘要翻译： 本发明是一种在符合ANSI SS7 ISUP标准的电信网络中发送专有参数的系统和方法。 该方法包括以下步骤：将要发送的专有参数标识为ISUP SS7信令消息的一部分，该信令包括网络特定的通用数字参数，并将这些参数封装在网络特定通用数字参数内。

公开(公告)号：US5870460A

公开(公告)日：1999-02-09

申请号：US876249

申请日：1997-06-16

申请人： Paul D. Litzenberger

发明人： Paul D. Litzenberger

IPC分类号： H04M15/00 ,  H04Q3/00 ,  H04Q3/66 ,  H04M3/00

CPC分类号： H04M15/8044 ,  H04M15/00 ,  H04Q3/0025 ,  H04Q3/66 ,  H04M2215/42 ,  H04M2215/745 ,  H04Q2213/13056 ,  H04Q2213/13095 ,  H04Q2213/13097 ,  H04Q2213/13102 ,  H04Q2213/13103 ,  H04Q2213/13138 ,  H04Q2213/13141 ,  H04Q2213/13174 ,  H04Q2213/13204

摘要： A system allocates data links between a switch and a database for data transactions in a telecommunications network. The data links between the switch and the database carry the transaction data for providing routing, card verification, address translation information, etc. by the database. The Flexible Link Selection Algorithm provides for accessing the data links using the round-robin method, wherein each data link is accessed sequentially to transport the data to and from the database. Alternatively, the Flexible Link Selection Algorithm provides for accessing the data links using dynamic allocation based on the least cost routing between the switch and the database. In the latter mode, the switch uses the least "expensive" database, i.e., database having the least cost routing between the switch and the database, until the volume of data transactions in the data links associated with that database exceeds a predetermined threshold level. If the threshold level is exceeded, the next least "expensive" database is selected, and its data links are utilized used to carry the data transactions between the database and the switch.

摘要翻译： 系统在交换机和数据库之间分配用于电信网络中的数据交易的数据链路。 交换机和数据库之间的数据链路携带数据库提供路由，卡片验证，地址转换信息等的交易数据。 灵活链路选择算法提供使用循环方法访问数据链路，其中每个数据链路被顺序地访问以将数据传送到数据库和从数据库传送数据。 或者，灵活链路选择算法提供使用基于交换机和数据库之间的最低成本路由的动态分配来访问数据链路。 在后一种模式中，交换机使用最少的“昂贵”数据库，即在交换机和数据库之间具有最低成本路由的数据库，直到与该数据库相关联的数据链路中的数据交易量超过预定阈值水平。 如果超过阈值级别，则选择下一个最低的“昂贵”数据库，并且利用其数据链接来传送数据库和交换机之间的数据事务。

公开(公告)号：US5828746A

公开(公告)日：1998-10-27

申请号：US485422

申请日：1995-06-07

申请人： Menachem Tsur Ardon

发明人： Menachem Tsur Ardon

IPC分类号： H04Q3/00 ,  H04Q3/66 ,  H04M7/00 ,  H04M1/00 ,  H04M3/00 ,  H04M3/42

CPC分类号： H04Q3/665 ,  H04Q3/0016 ,  H04Q3/0029 ,  H04Q2213/13096 ,  H04Q2213/13097 ,  H04Q2213/13103 ,  H04Q2213/13106 ,  H04Q2213/13141 ,  H04Q2213/13174 ,  H04Q2213/13176 ,  H04Q2213/13204 ,  H04Q2213/13222 ,  H04Q2213/13296 ,  H04Q2213/13342 ,  H04Q2213/13345 ,  H04Q2213/13349 ,  H04Q2213/1338 ,  H04Q2213/13383 ,  H04Q2213/13399

摘要： This invention relates to arrangements for interconnecting a plurality of stand-alone switches by data and communication channels (the latter typically used for communicating voice signals) in such a way as to make the plurality of switches act as if they were one switch. The invention further relates to arrangements for permitting groups of lines, the groups connected to different stand-alone switches, to be treated essentially as if they were connected to a single switch. Each switch of a symbiotic network (a group of stand-alone switches) or a virtual symbiotic network (the grouping of the groups of lines) accesses pertinent data in its own data base or the data base of one of the other switches of the symbiotic or virtual symbiotic network and treats the results of such data base accesses as if they were made internally in the switch. For a symbiotic network the trunks of all the switches of the network going to a common destination (and one such common destination can be any of the switches of another symbiotic network) are grouped into a single group so that an outgoing call can readily be made over a trunk connected to any of the switches of the symbiotic network. Similarly, incoming trunks to any switch of the symbiotic network from a common external source can be grouped into a single trunk group at that external source (which can be another symbiotic network). Advantageously, such an arrangement provides a convenient way of achieving the advantages of a giant switch without requiring the capacity of such a switch and without requiring the geographic concentration of traffic necessary to keep the links to a giant switch reasonably short. Advantageously, a virtual symbiotic network provides an economical and flexible solution to the problem of providing services such as wide area Centrex.

公开(公告)号：US5781537A

公开(公告)日：1998-07-14

申请号：US499781

申请日：1995-07-07

申请人： Rajiv Ramaswami ,  Adrian Segall

发明人： Rajiv Ramaswami ,  Adrian Segall

IPC分类号： H04B10/20 ,  H04L12/56 ,  H04Q3/00 ,  H04Q3/66 ,  H04Q11/00 ,  H04Q11/04 ,  H04M7/00

CPC分类号： H04Q11/0478 ,  H04Q11/0062 ,  H04Q3/66 ,  H04L2012/5605 ,  H04L2012/5619 ,  H04L2012/563 ,  H04L2012/5631 ,  H04Q11/0066 ,  H04Q2011/0009 ,  H04Q2011/0018 ,  H04Q2011/0039 ,  H04Q2011/0043 ,  H04Q2011/0081 ,  H04Q2011/0086

摘要： An efficient distributed technique for setting up, taking down, and updating connections in a communications network, which is robust in the presence of failures. More specifically with this invention a path for a connection is computed and reservation requests are simultaneously sent through separate channels to each of a set of nodes of the path for the connection to reserve and determine if resources are available for the connection. Upon acknowledgement that the links for the connection are available and have been reserved, a setup message is sequentially transmitted between the adjacent nodes along the path until the setup messages reaches the destination node. The switches in each node then configure themselves in response to the setup message so as to establish the connection.

摘要翻译： 一种用于建立，取消和更新通信网络中的连接的高效分布式技术，这在存在故障时是稳健的。 更具体地说，利用本发明，计算连接的路径，同时通过单独的信道将预留请求发送到用于连接的路径的一组节点中的每一个节点，并且确定资源是否可用于该连接。 在确认连接的链路可用并已被保留之后，沿着路径在相邻节点之间顺序地发送建立消息，直到建立消息到达目的地节点。 每个节点中的交换机然后根据建立消息配置自身，以建立连接。

公开(公告)号：US5778057A

公开(公告)日：1998-07-07

申请号：US599573

申请日：1996-02-09

申请人： Amir Atai

发明人： Amir Atai

IPC分类号： H04M3/36 ,  H04M7/00 ,  H04Q3/00 ,  H04Q3/66 ,  H04M15/08

CPC分类号： H04Q3/0029 ,  H04M3/36 ,  H04Q3/66 ,  H04M7/00 ,  H04Q2213/13528 ,  H04Q2213/13561 ,  H04Q2213/13563

摘要： A method of managing the overloading of calls directed to a single telephone number. The method enables Service Control Point to service calls a small percentage of the time during measurement intervals in order to receive Termination Notification messages. The Service Control Point then determines, from the contents of the Termination Notification messages for each measurement interval, the rate of attempted calls and the fraction of the total calls that were incomplete, (i.e., erroneous or received a busy signal) for a telephone number n, and invokes Automatic Code Gapping for the number n where both the attempted call rate and the incomplete calls exceed a predetermined threshold. If the threshold continues to be exceeded in subsequent measurement intervals, a larger gap interval for the Automatic Code Gapping can be set, and the process repeated until the proper gap is found.

摘要翻译： 管理针对单个电话号码的呼叫的超载的方法。 该方法使服务控制点能够在测量间隔期间的一小部分时间内为呼叫提供服务，以便接收终止通知消息。 服务控制点随后从每个测量间隔的终止通知消息的内容中确定尝试呼叫的速率和电话号码不完整（即错误或接收到忙信号）的总呼叫的分数 n，并且为尝试呼叫率和不完整呼叫超过预定阈值的号码n调用自动码间隔。 如果在随后的测量间隔中继续超过阈值，则可以设置自动代码间距较大的间隔间隔，并重复该过程，直到找到适当的间隙。

公开(公告)号：US5754543A

公开(公告)日：1998-05-19

申请号：US675166

申请日：1996-07-03

申请人： Howard A. Seid

发明人： Howard A. Seid

IPC分类号： H04Q3/00 ,  G06F17/50 ,  H04L12/56 ,  H04Q3/66 ,  H04Q11/04 ,  H04J3/24

CPC分类号： H04L45/12 ,  H04Q11/0478 ,  H04Q3/66 ,  H04L2012/5619

摘要： Connectivity matrix-based multi-cost routing includes defining a generally additive operator which is able to add traditionally (arithmetic) additive cost factors and which takes into account cost factors which are not additive, the generally additive operator being defined such that distributive and communicative properties are applicable, and wherein the generally additive operator is applicable to connectivity matrix-based factors for determining the relative costs of paths within a network, particularly with respect to multi-cost factors. Connectivity matrix-based multi-cost routing is performed by first defining cost functions and establishing a criteria for prioritizing cost functions such that a composite multi-cost function includes the cost functions in the priority order defined by the criterion. A connectivity matrix is established including ordered n-tuples of cost factors corresponding to the priority established by the criterion, and a shortest path matrix determination is made by using the generally additive operator to apply the composite multi-cost function to the connectivity matrix. When links within a network support various functionality, a mask of a required functionality may be used to define a cost function for a given shortest path matrix determination. A correcting method is provided for a routing determination when, after a shortest path matrix determination, a routing choice is not provided which would otherwise satisfy a multi-cost requirement, the correcting method including the determination of a primary path and secondary paths between a source node and a destination node.

摘要翻译： 基于连接矩阵的多成本路由包括定义能够添加传统（算术）附加成本因子并且考虑到不是添加的成本因子的通常加法运算符，通常加法运算符被定义为使得分布和通信属性 并且其中通常的加法运算符适用于基于连接矩阵的因子，用于确定网络内路径的相对成本，特别是关于多成本因素。 基于连接矩阵的多成本路由通过首先定义成本函数并建立用于确定成本函数优先级的标准来执行，使得复合多成本函数包括由该标准定义的优先顺序中的成本函数。 建立连通性矩阵，包括与由标准确定的优先级相对应的成本因子的有序n元组，并且通过使用通常加法运算符来对连接矩阵应用复合多成本函数进行最短路径矩阵确定。 当网络中的链路支持各种功能时，可以使用所需功能的掩码来定义用于给定的最短路径矩阵确定的成本函数。 提供了一种用于路由确定的校正方法，当在最短路径矩阵确定之后没有提供否则将满足多成本要求的路由选择时，校正方法包括确定主路径和源之间的次路径 节点和目的节点。

公开(公告)号：US5689555A

公开(公告)日：1997-11-18

申请号：US497411

申请日：1995-06-30

申请人： Edward Sonnenberg

发明人： Edward Sonnenberg

IPC分类号： H04M3/42 ,  H04Q3/00 ,  H04Q3/66 ,  H04M3/00

CPC分类号： H04Q3/0045 ,  H04Q3/005 ,  H04Q3/66 ,  H04M3/42297 ,  H04Q2213/13097 ,  H04Q2213/13102 ,  H04Q2213/13103 ,  H04Q2213/13141 ,  H04Q2213/13149 ,  H04Q2213/13176 ,  H04Q2213/13513 ,  H04Q2213/13527 ,  H04Q2213/13533 ,  H04Q2213/13541 ,  H04Q2213/13542

摘要： A method for enabling a plurality of Local Service Providers within a common Numbering Plan Area (NPA) to serve Subscribers of the plurality of Local Service Providers. The method includes the step of assigning to each Subscriber of a Local Service Provider within the common NPA a unique three digit code, hereinafter referred to as a service provider area (SPA) code. The SPA code is used by the telephone system in the same manner presently used for routing calls made when a calling Subscriber dials the NPA code of the called party. Here, however, the SPA code is not dialed by the calling Subscriber. The dialed directory number, NXX-XXXX, of a called Subscriber subscribed to a different Local Service Provider, is sent to a database. The database maintains a record of the relationships between the directory numbers of Subscribers and the SPA codes of the Subscribers. The database retrieves the SPA code associated with the dialed directory number presently serving the called Subscriber. The call is routed as SPA-NXX-XXXX. Because the ten digit format, SPA-NXX-XXXX, is the same as the present NPA-NXX-XXXX, ten digit format, existing signaling and routing mechanisms may be used to route the call. Thus, each one of the Subscribers of each one of the plurality of Local Service Providers is assigned a common SPA code, each one of the Local Service Providers having a different SPA code.

摘要翻译： 一种使普通编号方案区域（NPA）内的多个本地服务提供商能够服务于多个本地服务提供商的订阅者的方法。 该方法包括向公共NPA内的本地服务提供商的每个订阅者分配唯一的三位数字（以下称为服务提供商区域（SPA））代码的步骤。 呼叫用户拨打被叫方的NPA代码时，电话系统以当前用于路由呼叫的相同方式使用SPA代码。 然而，这里，SPA代码没有被主叫用户拨打。 被叫用户订阅的不同的本地服务提供商的拨号目录号码NXX-XXXX被发送到数据库。 数据库维护订户的目录号码和订阅者的SPA代码之间的关系记录。 数据库检索与目前服务于被叫用户的拨号号码簿号相关联的SPA码。 呼叫路由为SPA-NXX-XXXX。 由于十位数字格式SPA-NXX-XXXX与现在的NPA-NXX-XXXX相同，因此可以使用十位格式，现有的信令和路由机制可用于路由呼叫。 因此，为多个本地服务提供商中的每一个的每个订户分配一个公共的SPA代码，每个本地服务提供商具有不同的SPA代码。

公开(公告)号：US5680448A

公开(公告)日：1997-10-21

申请号：US956366

申请日：1992-10-05

申请人： Louis Becker

发明人： Louis Becker

IPC分类号： H04Q3/00 ,  H04Q3/66 ,  H04M7/00

CPC分类号： H04Q3/66 ,  H04Q3/0029

摘要： A deterministic call routing system tests the allocation of an incoming call to each of X locations and selects the appropriate location. Particularly, it simulates allocation of the call to the first resource and calculates the contribution of this allocation to the deviation of a distance expression from zero. It then simulates allocation of the call to the second resource and calculates the contribution of this allocation to the deviation of the distance expression from zero. This process continues by simulating the allocation of the calls to each of the remaining X resources in turn. The algorithm then selects the location for which the deviation of the distance expression from zero will be a minimum, and actually allocates the call to that location. A call counter for that location is then incremented by one, and the allocation is then ready to allocate the next call.

摘要翻译： 确定性呼叫路由系统测试对每个X位置的来电呼叫的分配，并选择适当的位置。 特别地，它模拟对第一资源的调用的分配，并且计算该分配对距离表达式与零的偏差的贡献。 然后它模拟对第二资源的调用的分配，并计算该分配对距离表达式与零的偏差的贡献。 该过程通过依次模拟对剩余X资源中的每一个的呼叫的分配来继续。 然后，该算法选择距离表达式与零的偏差将最小的位置，并实际分配该位置的呼叫。 然后，该位置的呼叫计数器增加1，然后分配准备好分配下一个呼叫。