Route protection in a communication network
    31.
    发明申请
    Route protection in a communication network 失效
    通信网络中的路由保护

    公开(公告)号:US20020188756A1

    公开(公告)日:2002-12-12

    申请号:US09848743

    申请日:2001-05-03

    CPC classification number: H04L41/12 H04L41/0668 H04L45/12 H04L45/22 H04L69/40

    Abstract: A communications network comprises a lower transport layer and an upper overlay incorporating a plurality of routers. Adjacencies are defined between respective pairs of routers. Path protection is provided by defining a software model of the overlay of the network and defining in the model a hierarchy of protection levels for the main path. Each protection level is characterised by a respective set of one or more broken adjacencies in the model, the adjacencies to be broken being determined from a knowledge of the underlying topology. A protection level is selected and a protection path avoiding the broken adjacencies associated with that protection level is calculated. If this calculated path is not available in the real network, a lower protection level in the hierarchy is selected and the protection path calculation repeated. The process continues until a suitable protection path is identified.

    Abstract translation: 通信网络包括下层传输层和结合有多个路由器的上覆盖层。 在各对路由器之间定义邻接关系。 通过定义网络覆盖的软件模型并在模型中定义主路径的保护级别的层次结构来提供路径保护。 每个保护级别的特征在于模型中的一个或多个断开的相邻集合的相应集合,根据底层拓扑的知识确定要被分解的邻接。 选择保护级别,并计算避免与该保护级别相关联的断开的邻接的保护路径。 如果这个计算的路径在实际网络中不可用,则选择层级中较低的保护级别,并重复保护路径计算。 该过程一直持续到确定合适的保护路径。

    Method and system for preventing access overload in mobile phone systems
    32.
    发明申请
    Method and system for preventing access overload in mobile phone systems 审中-公开
    防止移动电话系统接入过载的方法和系统

    公开(公告)号:US20020173316A1

    公开(公告)日:2002-11-21

    申请号:US10025590

    申请日:2001-12-18

    Abstract: There is provided, a system and method to limit access to the network during overload conditions by transmitting access control signals to the mobile terminals, where the messages specify a subset of the mobile terminals which will be prevented from accessing the network. Thus, allowing the remaining terminals to access the network.

    Abstract translation: 提供了一种通过向移动终端发送访问控制信号来限制在过载状态下对网络的访问的系统和方法,其中消息指定将被阻止访问网络的移动终端的子集。 因此,允许剩余的终端接入网络。

    Method and apparatus for determining graph planarity
    33.
    发明申请
    Method and apparatus for determining graph planarity 审中-公开
    用于确定图形平面度的方法和装置

    公开(公告)号:US20020118207A1

    公开(公告)日:2002-08-29

    申请号:US09742231

    申请日:2000-12-22

    Inventor: Frank M. Jagla

    CPC classification number: H04L45/12 H04L45/48

    Abstract: A method and apparatus for determining graph planarity makes use of an iterative algorithm to identify the chordless cycles in a graph and count, using a cyclic number for each link, the number of chordless cycles to which each link of the graph belongs. Chordless cycles are those cycles which can be formed without any other links of the graph forming a chord (i.e. crossing through the cycle). In order for a graph to be planar, any link cannot belong to more than two chordless cycles.

    Abstract translation: 用于确定图形平面度的方法和装置利用迭代算法来使用每个链路的循环数来识别曲线图中的无弦周期,并且计算图中每个链路所属的无弦周期数。 无弦循环是可以在没有图形的任何其他连接形成和弦(即穿过循环)的情况下形成的循环。 为了使图形平面,任何链接都不能属于两个以上的无序循环。

    Use of trellis coded modulation to mitigate fading channels in data transmission over air link wireless channels of GPRS/EDGE systems
    34.
    发明申请
    Use of trellis coded modulation to mitigate fading channels in data transmission over air link wireless channels of GPRS/EDGE systems 审中-公开
    使用网格编码调制来减轻GPRS / EDGE系统的空中链路无线信道数据传输中的衰落信道

    公开(公告)号:US20020108089A1

    公开(公告)日:2002-08-08

    申请号:US09738755

    申请日:2000-12-15

    CPC classification number: H04L1/006 H03M13/256 H03M13/6536 H04L27/186

    Abstract: Disclosed is a system and method for improving efficiency and overall capacity of data transmission within a given bandwidth in a GPRS/EDGE wireless air-link channel. A GPRS data terminal, mobile unit and/or other end-user equipment is equipped with a (specially designed) Trellis coder that replaces the traditional cyclic coder and allows encoding and decoding of data via the Trellis code algorithm. Trellis coder eliminates errors in data transmission, increases capacity in a given bandwidth, and corrects problems with fading channels associated with wireless transmission. The Trellis coder is also utilized for voice transmission and may be fabricated on an integrated circuit for utilization within hand-held devices.

    Abstract translation: 公开了一种用于提高在GPRS / EDGE无线空中链路信道中的给定带宽内的数据传输的效率和总体容量的系统和方法。 GPRS数据终端,移动单元和/或其他最终用户设备配备有(特别设计的)网格编码器,其替代传统的循环编码器,并允许经由网格码算法对数据进行编码和解码。 网格编码器消除数据传输中的错误,增加给定带宽中的容量,并纠正与无线传输相关的衰落信道的问题。 网格编码器还用于语音传输,并且可以在集成电路上制造以用于手持式设备中。

    Method and apparatus enabling local number portability in telephone networks
    36.
    发明申请
    Method and apparatus enabling local number portability in telephone networks 有权
    在电话网络中实现本地号码可移植性的方法和装置

    公开(公告)号:US20020080947A1

    公开(公告)日:2002-06-27

    申请号:US09745423

    申请日:2000-12-26

    CPC classification number: H04Q3/005 H04M3/4228 H04M3/42297

    Abstract: A method for providing local number portability between subscriber lines served by a distributed switch call manager (DSCM) involves updating translation tables of the DSCM to direct call control messages to a media gateway (MG) that serves the ported number. The service features and service feature profile of the ported subscriber are ported concurrently with the directory number, without re-provisioning.

    Abstract translation: 用于在由分布式交换机呼叫管理器(DSCM)服务的用户线路之间提供本地号码可携带性的方法涉及更新DSCM的转换表,以将呼叫控制消息引导至服务于移植号码的媒体网关(MG)。 移植用户的服务特性和服务特征配置文件与目录号同时移植,无需重新配置。

    OSPF backup interface
    37.
    发明申请
    OSPF backup interface 有权
    OSPF备份接口

    公开(公告)号:US20020078232A1

    公开(公告)日:2002-06-20

    申请号:US09739902

    申请日:2000-12-20

    CPC classification number: H04L45/28 H04L45/04 H04L45/22

    Abstract: A method and apparatus provides protection against resource failures in Open Shortest Path First (OSPF) networks, without increasing the complexity of the network topology and/or management. An internal router (IR) automatically maintains a back-up link in a dormant state until a network failure affecting communications with a primary adjacent area border router (ABR) is detected. Upon detection of the network failure, the IR activates the back-up link in order to enable traffic flow to an alternate adjacent ABR, which by-passes the network failure. Upon recovery of communications with the primary adjacent ABR, the IR automatically deactivates the back-up link and resumes traffic flow through the primary adjacent ABR. As a result, traffic is forwarded into the back-up link only when communications with the primary adjacent ABR has failed, thereby maintaining simplicity in the network topology, and minimizing network management and administration requirements.

    Abstract translation: 一种方法和装置在开放最短路径优先(OSPF)网络中提供针对资源故障的保护,而不增加网络拓扑和/或管理的复杂性。 内部路由器(IR)自动维护备用链路处于休眠状态,直到检测到与主相邻区域边界路由器(ABR)通信的网络故障。 在检测到网络故障时,IR激活备份链路,以便能够流向交替的相邻ABR的流量,该ABR会绕过网络故障。 在恢复与主相邻ABR的通信后,IR自动停用备用链路,并恢复通过主相邻ABR的业务流。 因此,仅当与主相邻ABR的通信出现故障时才将流量转发到备用链路,从而保持网络拓扑的简单性,并最大限度地减少网络管理和管理需求。

    Source code cross referencing tool, B-tree and method of maintaining a B-tree
    38.
    发明申请
    Source code cross referencing tool, B-tree and method of maintaining a B-tree 审中-公开
    源代码交叉引用工具,B树和维护B树的方法

    公开(公告)号:US20010042240A1

    公开(公告)日:2001-11-15

    申请号:US09745411

    申请日:2000-12-26

    CPC classification number: G06F8/427

    Abstract: A method and tool for storing source-code cross referencing information is disclosed. The source-code cross referencing information is stored within a B-tree. Preferably only global cross-reference information is contained within the B-tree. Records within the B-tree contain information about occurrences of variables within the source code. Keyed records of data are preferably stored within leaves of a B-tree having nodes of fixed size, with multiple records of varying size potentially stored within each leaf node. Records within each leaf node are preferably indexed by indexes stored within the node. Such a B-tree may be stored within a file on a computer readable medium such as a disk. Techniques of splitting nodes in the tree are also disclosed. Further, various techniques of extracting information from a formed B-tree are disclosed.

    Abstract translation: 公开了一种用于存储源代码交叉引用信息的方法和工具。 源代码交叉引用信息存储在B树中。 优选地,在B树中仅包含全局交叉引用信息。 B-tree中的记录包含有关源代码中变量出现的信息。 数据的密钥记录优选地存储在具有固定大小的节点的B树的叶内,具有可变的大小的多个记录可能存储在每个叶节点中。 每个叶节点中的记录优选地由存储在节点内的索引索引。 这样的B树可以存储在诸如盘的计算机可读介质上的文件中。 还披露了在树中分割节点的技术。 此外,公开了从形成的B树提取信息的各种技术。

    Method, device and software for ensuring path diversity across a communications network
    39.
    发明申请
    Method, device and software for ensuring path diversity across a communications network 审中-公开
    确保通信网络路径分集的方法,设备和软件

    公开(公告)号:US20010032271A1

    公开(公告)日:2001-10-18

    申请号:US09748391

    申请日:2000-12-27

    Inventor: David Ian Allen

    Abstract: A method, device and software for ensuring path diversity across a communications network are disclosed. The method forms a digest of resources used in an initial, working, path is created as the initial path is established. This digest may be used during the formation of a subsequent, protection, path. Each node along the subsequent path can use the digest to ensure that resources are not common to the initial and subsequent paths. Conveniently, the digest may take the form of a Bloom filter that summarizes local information about resources known to each node along the initial path. The method lends itself for use in an MPLS compliant network or any connection oriented network such as an ATM, SONET or switched optical network.

    Abstract translation: 公开了一种用于确保通信网络上的路径分集的方法,设备和软件。 该方法形成初始,工作,路径中使用的资源的摘要,因为初始路径已建立。 这个摘要可以在形成后续保护路径时使用。 沿着后续路径的每个节点都可以使用摘要来确保资源对初始路径和后续路径不常见。 方便地,摘要可以采用布鲁姆滤波器的形式,其汇总关于沿着初始路径的每个节点已知的资源的本地信息。 该方法适用于MPLS兼容网络或任何面向连接的网络,如ATM,SONET或交换光网络。

    Flexible banded MUX/DEMUX architecture for WDM systems
    40.
    发明申请
    Flexible banded MUX/DEMUX architecture for WDM systems 审中-公开
    适用于WDM系统的灵活带状MUX / DEMUX架构

    公开(公告)号:US20040252996A1

    公开(公告)日:2004-12-16

    申请号:US10457555

    申请日:2003-06-10

    Inventor: John D. McNicol

    CPC classification number: H04J14/0224 H04J14/02 H04J14/0227

    Abstract: A method of conveying a WDM optical signal through a WDM system includes demultiplexing the received WDM optical signal into two or more spectral bands. Each spectral band has a respective predetermined center frequency and bandwidth, which encompasses a respective portion of the transmission window of a communications link. Each spectral band is then independently conveyed through the WDM system. This arrangement provides a flexible banded MUX/DEMUX architecture that enables multiple different channel plans (spectral grids) to co-exist within a common optical communications network. Legacy equipment can therefore continue in service, as traffic is gradually migrated onto new, higher capacity systems. This provides a convenient migration path for network service providers to progressively upgrade the information carrying capacity of network links, without stranding legacy equipment.

    Abstract translation: 通过WDM系统传送WDM光信号的方法包括将接收到的WDM光信号解复用为两个或更多个光谱带。 每个频谱带具有相应的预定中心频率和带宽,其包含通信链路的传输窗口的相应部分。 然后,每个光谱带独立地通过WDM系统传送。 这种布置提供了灵活的带状MUX / DEMUX架构,其使多个不同的信道规划(频谱网格)共同存在于普通光通信网络中。 因此,传统设备可以继续使用,因为流量逐渐迁移到新的,更高容量的系统上。 这为网络服务提供商逐渐升级网络链路的信息承载能力提供了便利的迁移路径,而不需要将传统设备分开。

Patent Agency Ranking