| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 1 | 搜索多级克洛斯交换网络中虚拟容器信号的组合路径的方法及装置 | CN00124675.5 | 2000-09-27 | CN1166245C | 2004-09-08 | 李弘途 |
| 这里公开了能够开关多个信号支流的用于搜索相似CLOS交换网络中的虚拟容器信号的组合路径的方法。所述方法包括管理在每个带有链接列表和位图的状态之间的链路使用状态，用链路使用状态搜索可连接的候选路径，并在所搜索的候选路径中设置一个选定的或最优的路径，以及使用一个N-树数据结构和一个数据结构管理所设置路径中的信道的连接状态。 | ||||||
| 2 | 动态控制路由选择 | CN98802975.8 | 1998-01-13 | CN1254481A | 2000-05-24 | 珍妮·洛伦岑; 查尔斯·霍莫拉; 保罗·M·布雷; 伯纳德·S·格罗特; 米海·S·陈; 凯文·卡纳迪 |
| 一种电信网络(10),包括网络处理器(16)和多个电信交换局(12)。多个电信交换局(12)中的每个根据多个电信交换局(12)中的每个交换局提供给网络处理器(16)的阻塞数据从网络处理器(16)接收路由选择推荐。收集阻塞数据,并提供给电信网络(10)中的多个交换局(12)中的每个交换局中的多个处理器(14)的每个处理器。多个处理器(14)的每个处理器根据网络处理器(16)提供的存储在目的节点表(30)内的路由选择推荐。在同网络(10)内为电信信号选择路由。网络处理器(16)根据电信网络(10)的阻塞状态或配置状态的变化不断更新目的节点表(30)中的路由选择推荐。 | ||||||
| 3 | 搜索克洛斯交换网络中虚拟容器信号的组合路径的方法 | CN00124675.5 | 2000-09-27 | CN1293526A | 2001-05-02 | 李弘途 |
| 这里公开了能够开关多个信号支流的用于搜索相似CLOS交换网络中的虚拟容器信号的组合路径的方法。所述方法包括管理在每个带有链接列表和位图的状态之间的链路使用状态,用链路使用状态搜索可连接的候选路径,并在所搜索的候选路径中设置一个选定的或最优的路径,以及使用一个N－树数据结构和一个数据结构管理所设置路径中的信道的连接状态。 | ||||||
| 4 | 动态控制路由选择 | CN98802975.8 | 1998-01-13 | CN1128553C | 2003-11-19 | 珍妮·洛伦岑; 查尔斯·霍莫拉; 保罗·M·布雷; 伯纳德·S·格罗特; 米海·S·陈; 凯文·卡纳迪 |
| 一种电信网络(10)，包括网络处理器(16)和多个电信交换局(12)。多个电信交换局(12)中的每个根据多个电信交换局(12)中的每个交换局提供给网络处理器(16)的阻塞数据从网络处理器(16)接收路由选择推荐。收集阻塞数据，并提供给电信网络(10)中的多个交换局(12)中的每个交换局中的多个处理器(14)的每个处理器。多个处理器(14)的每个处理器根据网络处理器(16)提供的存储在目的节点表(30)内的路由选择推荐，在同网络(10)内为电信信号选择路由。网络处理器(16)根据电信网络(10)的阻塞状态或配置状态的变化不断更新目的节点表(30)中的路由选择推荐。 | ||||||
| 5 | 分布式转接专用小交换机 | CN97198621.5 | 1997-10-02 | CN1251244A | 2000-04-19 | R·库珀; A·V·巴拉苏布拉马尼安 |
| 多个( M个)PBX(32－34,36－39)耦合到多个( N个)节点(40－44),形成分布式转接专用小交换机(PBX)(30)。多(N)个节点相互远离并形成广域网,每个节点通过单独链路(45－49)耦合到预定数量的其他节点,以使每个节点能与所有其他节点进行通信。一个或多个D信道服务器模块(DSM)(50,51,54,56)位于多个(N个)节点的各预定节点中。每个DSM与多个D信道相关,每个D信道利用键路耦合到同一节点或不同节点中的单独接口装置,以便接收和发送信令数据给多个PBX中的一个相关的预定PBX。安排每个DSM去分析通过D信道接收的呼叫信令消息,并根据路由选择消息,在呼叫与被叫用户位于连到同一DSM的PBX中时,为呼叫选择路由以返回至同一PBX或连到同一DSM的不同PBX,或者在为未耦合到同一DSM的远程PBX之间的呼叫选择路由时,则为呼叫选择路由至远程DSM远程DSM接下来又为此呼叫选择路由至连到那个DSM的PBX。因此,每个DSM仅控制寻址至与那个DSM相关的DSM的呼叫,并在呼叫并非寻址至与那个DSM有关的PBX时,DSM将任何呼叫控制传送给寻与此呼叫所寻址的PBX相关的目标DSM。 | ||||||
| 6 | 分布式转接专用小交换机系统中的分布式呼叫控制方法 | CN97198614.2 | 1997-10-02 | CN1232595A | 1999-10-20 | A·V·巴拉苏布拉马尼安 |
| 提供了在包括形成广域网的多个( N个)节点( 40－44)和多个D信道服务器模块(DSM)(50,51,54,56)的分布式转接专用小交换机(PBX)(30)中的分布式呼叫控制的方法。DSM位于预定节点中,每个DSM通过至少一个D信道耦合到至少一个相关PBX。此方法包括以下步骤,首先,由DSM和耦合到此DSM的每个相关PBX处理的所有交换机代码(EC)的列表被存储在此DSM的存储器(82)的本地路由选择表(86)中。第二,由分布式转接PBX的所有其他DSM及其相关PBX处理的所有EC的列表被存储在每个DSM的存储器的远程路由选择表(87)中。第三,在DSM上从相关呼叫PBX中接收呼叫请求和被叫PBX的交换机代码(EC)后,在DSM确定此EC是否在本地路由选择表中找到,并在本地路由选择表上找到此EC时,为此呼叫选择路由返回至相关的被叫PBX。第四,当未在本地路由选择表上找到此EC时,在DSM中确定此接收的EC是否在远程DSM的远程路由选择表上找到。当在远程路由选择表上找到此EC时,为此呼叫选择路由至远程DSM远程DSM为此呼叫选择路由至被叫PSX。如果在至被叫PBX的接口上B信道不空闲或如果广域带宽不可用于在被叫与呼叫PBX接口上连接B信道,则清除此呼叫。 | ||||||
| 7 | 交叉连接通信网络中选择连接路径的方法 | CN93105746.9 | 1993-05-14 | CN1081053A | 1994-01-19 | 爱德华·K·伯顿 |
| 一种用于寻找经过通信矩阵的路径的方法和系统，利用输入级数组代表经过输入开关到输入门的中央线开关的分配，利用中央级数组代表在输入级开关和输出级开关之间的中央级开关连接，利用输出级数组代表到输出门的输出级开关连接，以及利用空闲输入数组代表到中央级开关的空闲输入开关链路和利用空闲输出数组代表来自中央线开关的空闲输出开关链路。这种方法和系统对这些数组执行抽吸操作以确定最佳中央级开关。 | ||||||
| 8 | Automatic providing apparatus and method of the relay line selection and routing in a communication network parameters | JP6232996 | 1996-03-19 | JP2981166B2 | 1999-11-22 | JERARUDO RICHAADO ATSUSHU; KENESU KEE CHAN; JAYU CHEN; ARAN YUUJEN FUREI; JEEMUSU JEE GYARAFUAA |
| 9 | Automatic provision device and its method of trunking and routing parameter in telecommunication network | JP6232996 | 1996-03-19 | JPH08274875A | 1996-10-18 | JIERARUDO RICHIYAADO ATSUSHIYU; KENESU KEE CHIYAN; JIYAYU CHIEN; ARAN YUUJIEN FUREI; JIEEMUSU JIEE GIYARAFUAA |
| PROBLEM TO BE SOLVED: To relieve a labor to supply data for routing and trunking in a telecommunication network. SOLUTION: Each element such as a relay exchange being a component of a communication network 200 sends information to other exchange of a network 150 when there arises a change in data for routing or trunking. For example, in the case that the data for routing or trunking are changed resulting from addition of a new relay line group to the element, the element generates a message denoting the change and sends the message to other elements of the network 150, and each element receiving the message to change the data for routing or trunking of its own by taking the change into account. Thus, the data for routing or trunking are provided automatically. | ||||||
| 10 | Distribution control exchange network with respect to multiplex line telephone communication | JP28084292 | 1992-09-25 | JPH05219583A | 1993-08-27 | JIYON EMU KOTSUTON; NIIRU SHII OORUSEN; ARETSUKUSU TEII UISHINKU; GEERII BUI PIIPAA; NIKORASU NEKIYURA; UIRIAMU EI OZUWARUDO; ENRIIKEE ABUREE; MOORISU JIEI MASUKARENAAZU; RUUDEII DE BURUUIN |
| PURPOSE: To attain mutual connection at a position at an addressable designation by receiving and processing a destination logic address code and selecting a proper switch port to designate a data path toward an address corresponding to the code. CONSTITUTION: To three access switches(AS) 24, 14-sets of I/F switch I/FS 22 of a terminal unit 20 are connected, and the three AS24 are coupled with four different sets in 6 switch planes 30. Furthermore, 19 select switches 26 on the planes 30 are coupled with two of the three AS 24, to connect each plane to 95 sets of units 20. Furthermore, 9 reflection switches 28 of each plane 30 are connected to other switches 26 for allowing each independent processor to control each switch element. Thus, each processor decodes a destination logic address code from a system center 15 to allow each switch element to attain mutual connection at an address designation position by each switch element. | ||||||
| 11 | Distributed control switching network for multi-line telephone communication | JP2002126351 | 2002-04-26 | JP2003009267A | 2003-01-10 | COTTON JOHN M; OLSEN NEIL C; WISSINK ALEX T; PIEPER GARY V; NECULA NICHOLAS; OSWALD WILLIAM A; ABREU ENRIQUE; MASCARENHAS MAURICE J; DE BRUYN RUDY |
| PROBLEM TO BE SOLVED: To provide a digital switching network having flexibility at a low cost by using digital time division multiplexing technologies. SOLUTION: A switch element has a plurality of switch ports 173 for transceiving data and a shared memory 147 having a plurality of addressable address locations. Input output data are read/written from/to addressable memory locations. The switch element has a pointer table 122 capable of storing data read/write memory location addresses. Each address corresponds each of input output data. The switch element includes an adder that sums two or more input data when the input data has the same address in the shared memory and a controller 140 that is adapted to select an output switch port by operating the switch element and processing an address at an addressable location to select the output switch port. | ||||||
| 12 | Routing control method | JP30025293 | 1993-11-30 | JP2856050B2 | 1999-02-10 | SUPIIGERU IISAN; MURASE TSUTOMU |
| In a connection-oriented communications network, a source node selects one of first and second routing mode flags and a first route to a destination node in response to a connection request, and establishes a connection to a first intermediate node located along the first route. The first intermediate node is responsive to the first flag for extending the connection along the first route if there is an acceptable link in the first route. If there is no acceptable link, it finds a first route section therefrom to the destination node and extends the connection along the first route section if a total cost of links from the source node to the destination node using the first route section is less than a cost threshold, or cranks the connection back to an upstream node if there is none of such route sections. The upstream node then finds a second route section if a total cost of links from the source node to the destination node using the second route section is less than the cost threshold and extends the connection from the upstream node to a second intermediate node along the second route section, or clears the connection if there is none of the such route sections. On clearing the connection, the source node may or may not select the other flag. In either case, it selects a second, alternate route to the destination node and establishes a connection to a third intermediate node along the second route. If the flag is set to the first mode, the third intermediate node operates in the same manner as the first intermediate node does, and if the flag is set to the second mode, it extends the connection along the second route if there is an acceptable link. Otherwise, it clears the connection if there is no acceptable link and communicates this fact to the source node. | ||||||
| 13 | Routing control method | JP30025293 | 1993-11-30 | JPH07154420A | 1995-06-16 | SUPIIGERU IISAN; MURASE TSUTOMU |
| PURPOSE: To provide both the high speed connection setting and the path of an approximately minimum cost by specifying steps where a connection setting request packet reaches from a source node to an objective node. CONSTITUTION: When the connection setting request is blocked, an intermediate node before its link obtains a new path from the routing table of the intermediate node so that the cost from the source node to the objective node is lower than a cost threshold D entered in the connection request packet. If this new path doesn't exist and the number of times of turning-back of the connection setting request packet is smaller than a turning-back threshold G, the connection setting request packet is turned back and sent to the node just preceding the intermediate node. The cost threshold D and the turning-back threshold G are used again or calculation is performed again to obtain a new path so that the already blocked link is not included. COPYRIGHT: (C)1995,JPO | ||||||
| 14 | Method of distributed call control in a distributed transit PBX system | US726633 | 1996-10-07 | US5805690A | 1998-09-08 | Richard Koepper; Adoor V. Balasubramanian |
| A method of Distributed Call Control is provided in a Distributed Transit Private Branch Exchange (PBX) comprising a plurality of Nodes forming a wide area network, and a plurality of D-channel Server Modules (DSMs). The DSMs are located in predetermined ones of the Nodes with each DSM coupled to at least one associated PBX via at least one D channel. The method includes the following steps. First, a listing of all Exchange Codes (ECs) handled by a DSM and each associated PBX coupled thereto is stored in a local routing table of a memory in the DSM. Second, a listing of all ECs handled by all of the other DSMs of the Distributed Transit PBX and their associated PBXs is stored in a remote routing table of the memory in each of the DSMs. Third, upon receiving a call request and an Exchange Code (EC) for a called PBX at a DSM from an associated calling PBX, determining at the DSM if the EC is found on the local routing table, and routing call back to the associated called PBX when a the EC is found on the local routing table. Fourth, determining if the received EC is found on the remote routing table for a remote DSM when the EC is not found on the local routing table. When the EC is found in the remote routing table, the call is routed to a remote DSM which routes the call to the called PBX. | ||||||
| 15 | Connection path selection method for cross-connect communications networks | US282705 | 1994-07-29 | US5408231A | 1995-04-18 | Edward K. Bowdon |
| A method and system for finding a path through a communications matrix represents the assignment of a center stage switch through an input switch to input gates by an input stage array, center stage switch connections between an input stage switch and an output stage switch by a center stage array, and output stage switch connections to output gates by an output stage array, as well as representing idle input switch links to the center stage switches by an idle input array and idle output switch links from the center stage switches by an idle output array. The method and system perform a process of pumping the input stage array, output stage array and center stage array using information in the idle input link array and the idle output link array to determine an optimal center stage switch having both an idle input link between a predetermined input gate and the optimal center stage and an idle output link from the optimal center stage to a predetermined output gate as identified by the idle input link and idle output link arrays. The pumping process relies on the idle input array and idle output array for connection status data. The method and system may be used advantageously with a rearrangeable communications matrix to establish optimal connection configurations during both normal and rearrangement operations. | ||||||
| 16 | Distributed control switching network for multi-line telephone communications | US766047 | 1991-09-26 | US5255264A | 1993-10-19 | John M. Cotton; Neil C. Olsen; Alex T. Wissink; Gary V. Pieper; William A. Oswald; Nicholas Necula; Enrique Abreu; Maurice J. Mascarenhas; Rudy De Bruyn |
| A communication switching system with distributed control processing is provided. The system includes a digital switching network having a modular array of intelligent digital switching elements each having processors and memory to set up communication paths for voice and data between the terminal module processors such as line cards and telephone units. Each addressable location in the system is assigned a logical address code (LAC). When a route is requested, a switch element processor interprets the destination LAC and selects a route through the switch toward the destination with each switch element in the communication path setting a route toward that destination. The switching network provides duplex paths for flexible communication. With such a duplex path speech is directed from a first terminal unit such as a telephone station and a second terminal unit such as a line card into a bridge port which sums the speech data from the two sources. The summed speech is then sent from the bridge port to the terminal units. | ||||||
| 17 | Combined progressive and source routing control for connection-oriented communications networks | US351073 | 1994-11-30 | US5649108A | 1997-07-15 | Ethan Spiegel; Tutomu Murase |
| In a connection-oriented communications network, a source node selects one of first and second routing mode flags and a first route to a destination node in response to a connection request, and establishes a connection to a first intermediate node located along the first route. The first intermediate node is responsive to the first flag for extending the connection along the first route if there is an acceptable link in the first route. If there is no acceptable link, it finds a first route section therefrom to the destination node and extends the connection along the first route section if a total cost of links from the source node to the destination node using the first route section is less than a cost threshold, or cranks the connection back to an upstream node if there is none of such route sections. The upstream node then finds a second route section if a total cost of links from the source node to the destination node using the second route section is less than the cost threshold and extends the connection from the upstream node to a second intermediate node along the second route section, or clears the connection if there is none of the such route sections. On clearing the connection, the source node may or may not select the other flag. In either case, it selects a second, alternate route to the destination node and establishes a connection to a third intermediate node along the second route. If the flag is set to the first mode, the third intermediate node operates in the same manner as the first intermediate node does, and if the flag is set to the second mode, it extends the connection along the second route if there is an acceptable link. Otherwise, it clears the connection if there is no acceptable link and communicates this fact to the source node. | ||||||
| 18 | Automatic provisioning of trunking and routing parameters in a telecommunications network | US407171 | 1995-03-21 | US5559877A | 1996-09-24 | Gerald R. Ash; Kenneth K. Chan; Jiayu Chen; Alan E. Frey; James J. Gallagher; Andrew W. Peck |
| A telecommunication network may be arranged in accord with the invention so that a change in provisioning data occurring at one element of the network is automatically supplied to the other elements of the network, thereby eliminating the need of having a network administration facility to communicate manually the change to the other network elements. For example, if a local central office switch is rehomed from a first toll switch to a second toll switch, then the first and second toll switches form messages respectively characterizing the rehome and then send the messages to each of the other network toll switches so that the other toll switches may update their respective routing and trunking data relating to the rehomed switch. The network is also arranged to implement a rule-based, end-to-end routing scheme which automatically selects a routing path from multiple candidates based on (a) class-of-service parameters and (b) availability of network capacity. The automatic selection of a routing path thus replaces the provisioning of routing data in the toll switches, which data was priorly needed to select the appropriate routing path. | ||||||
| 19 | Communications system ingress and egress arrangement | US503014 | 1990-04-02 | US5086460A | 1992-02-04 | Gerald R. Ash; Jin-Shi Chen; Robert A. Gerritsen |
| A communications network is arranged so that an external switching office is connected to the network via multiple ingress/egress nodes such that an originating node which receives a call destined for the external office may route the call through the network to one of the ingress/egress nodes in accordance with a particular class (type) of routing specified in one of a number of routing treatments. Such routing treatments are associated with the external office and at least identify respective ones of the ingress/egress nodes connected to the external office. | ||||||
| 20 | Distributed transit private branch exchange | US726579 | 1996-10-07 | US5903571A | 1999-05-11 | Richard Koepper; Adoor V. Balasubramanian |
| A plurality of M PBXs are coupled to a plurality of N nodes forming a Distributed Transit Private Branch Exchange (PBX). The plurality of N nodes are located remotely from each other and form a wide area network. Each node is coupled to predetermined ones of the other nodes via separate links so that each node is able to communicate with all other nodes. One or more D-channel Server Modules (DSMs) are located in predetermined nodes of the plurality of N nodes. Each DSM is associated with a plurality of D channels which are each coupled to a separate interface device in the same node or different node by means of a link for receiving and transmitting signaling data to one of an associated predetermined PBX of the plurality of PBXs. Each DSM is arranged to analyze the call signaling message received via a D channel and, based on routing information, either route the call back to the same PBX or a different PBX attached to the same DSM when the calling and called subscribers are located in the PBXs attached to the same DSM, or route the call to a remote DSM when the call is routed between remote PBXs that are not coupled to the same DSM. The remote DSM, in turn, routes the call to the PBX attached to that DSM. Therefore, each DSM only controls calls addressed to a DSM associated with that DSM, and when a call is not addressed to a PBX associated with that DSM, the DSM passes any call control to a destination DSM associated with a PBX to which the call is addressed. | ||||||
QQ群二维码
意见反馈
意见反馈