会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明申请
    • Method and apparatus for a network element to support a communication link in a communication network
    • 一种用于支持通信网络中的通信链路的网元的方法和装置
    • US20020131431A1
    • 2002-09-19
    • US09965363
    • 2001-09-27
    • Richard B. WankMichael T. Raftelis
    • H04L012/28
    • H04L41/0803H04J3/1611H04J2203/0042H04J2203/0046H04J2203/0053H04J2203/0058H04J2203/006H04J2203/0066H04J2203/0067
    • A SONET network element or network switch includes a control layer implemented over a physical layer to automate the establishment, modification, and/or deletion of communication links within the communication network. In general, the network element may include firmware to support processing that begins by receiving a link command and determining the type of link command. When the type of link command is to establish a connection, the processing continues by determining whether the network element is a termination node of the communication link. When the network element is not a termination node of the communication link, the processing continues by determining an optimal path for the communication link via a plurality of network elements of the communication network. The processing continues by determining the type of path to the adjacent network element of the plurality of network elements. The processing continues by processing the link command based on the type of path to the adjacent network element to establish the communication link.
    • SONET网元或网络交换机包括在物理层上实现的控制层,以自动地建立,修改和/或删除通信网络内的通信链路。 通常,网络元件可以包括支持通过接收链路命令和确定链路命令的类型开始的处理的固件。 当链路命令的类型是建立连接时,通过确定网络单元是否是通信链路的终止节点来继续处理。 当网络元件不是通信链路的终端节点时,通过经由通信网络的多个网络元件确定通信链路的最佳路径来继续处理。 通过确定到多个网络元件的相邻网络元件的路径的类型来继续处理。 该处理继续通过基于到相邻网元的路径的类型处理链路命令来建立通信链路。
    • 42. 发明申请
    • Communication network, path setting method and node apparatus used therefor
    • 通信网络,路径设置方法和使用的节点设备
    • US20020122442A1
    • 2002-09-05
    • US10084325
    • 2002-02-28
    • Yoshihiko Suemura
    • H04J003/04
    • H04J3/1611H04J2203/0053H04J2203/0089
    • A communication network capable of dynamically setting hierarchical high order and low order paths between arbitrary nodes is implemented. In the communication network including a plurality of nodes and a plurality of link groups connecting these nodes, a low order node having a switch for switching the low order path and a high order node having the switch for at least switching the high order path are provided as the plurality of nodes. The high order node further has a multiplexer for multiplexing N (N is an integer of 2 or more) of the low order paths on one of the high order paths and a separator for separating one of the high order paths into N of the low order paths. The low order path is set between any two nodes and the high order path is set between any two high order nodes.
    • 实现能够动态地设定任意节点之间的分级高阶和低阶路径的通信网络。 在包括连接这些节点的多个节点和多个链路组的通信网络中,提供具有用于切换低阶路径的开关的低阶节点和具有用于至少切换高阶路径的开关的高阶节点 作为多个节点。 高阶节点还具有多路复用器,用于复用高阶路径中的一个上的低阶路径的N(N是2以上的整数)和用于将高阶路径中的一个分离成低阶的N的分隔符 路径。 在任意两个节点之间设置低阶路径,并且在任意两个高阶节点之间设置高阶路径。
    • 43. 发明申请
    • Method for transmitting data packets and network element for carrying out the method
    • 用于传输数据包的方法和执行该方法的网元
    • US20020027905A1
    • 2002-03-07
    • US09887676
    • 2001-01-23
    • Volkmar Heuer
    • H04L012/56
    • H04Q11/0478H04J3/1617H04J2203/0053H04J2203/0083
    • A method is disclosed for transmitting data packets in wide area networks (WAN) by way of a synchronous digital data transmission network (SDH), wherein the data packets are packed into synchronous transport modules (STM-N) and are transmitted by way of virtual connections formed by subunits of synchronous transport modules of the same size. The virtual connections are entered into an address table and an evaluation of the target address of the data packets takes place in one of the network elements of the synchronous digital data transmission network. On the basis of the address table and the target address, at least for a part of the data packets, a decision is made by at least one of the network elements of the synchronous digital data transmission network as to which one of the virtual connections is used to transmit this data packet. Furthermore, a network element is disclosed, which operates in accordance with the transmission method.
    • 公开了一种用于通过同步数字数据传输网(SDH)在广域网(WAN)中发送数据分组的方法,其中数据分组被打包到同步传输模块(STM-N)中,并且通过虚拟 由相同大小的同步传输模块的子单元形成的连接。 虚拟连接被输入到地址表中,并且数据分组的目标地址的评估发生在同步数字数据传输网络的一个网络元件中。 至少对于一部分数据分组,基于地址表和目标地址,同步数字数据传输网络的至少一个网络元素决定虚拟连接中哪一个是 用于传输此数据包。 此外,公开了根据传输方法操作的网络元件。
    • 44. 发明授权
    • Method of optimal routing in a bi-directional line switched sonet ring
    • 双向线路交换式超声波环路中最优路由的方法
    • US06229815B1
    • 2001-05-08
    • US09036392
    • 1998-03-06
    • Jennifer Shu-Chen HuangSridhar S. NathanJonathan Weston-Dawkes
    • Jennifer Shu-Chen HuangSridhar S. NathanJonathan Weston-Dawkes
    • H04L12403
    • H04Q11/0478H04J2203/0042H04J2203/0053H04J2203/0067Y10S370/907
    • A method of assigning capacity and routing flow in a bi-directional line switched SONET ring based upon ring topology and demand data defines for each pair of links of the ring a two-edge cut. Each two-edge cut divides the ring into two sets of nodes. For each two-edge cut, the capacity assignment method calculates a demand equal to the sum of all demands between nodes on opposite sides of the two-edge cut. The capacity assignment method then determines the maximum demand and sets the capacity of each link equal to one-half the maximum demand plus one-half of one demand unit. The flow routing method of the present invention calculates a cut difference for each two-edge cut. A critical cut is a two-edge cut having a cut difference equal to or less than one. If there is a critical cut with demands greater than zero on the same side of the critical cut, the method performs a first processing routine. If there is no critical cut with demands greater than zero on the same side of the critical cut, the method performs a second processing routine. The flow routing method performs the first or second processing routine until the occurrence of a terminating condition.
    • 基于环形拓扑和需求数据在双向线路交换SONET环中分配容量和路由流的方法为环的每对链路定义两边缘切割。 每个两边切割将环分成两组节点。 对于每个两边切割,容量分配方法计算等于两边切割相对侧的节点之间的所有需求之和的需求。 然后,容量分配方法确定最大需求,并将每个链路的容量设置为等于最大需求的一半加上一个需求单元的一半。 本发明的流程布置方法计算每个两边切割的切割差。 关键切割是具有等于或小于1的切割差的两边切割。 如果在临界切割的同一侧存在要求大于零的关键切割,则该方法执行第一处理程序。 如果在临界切割的同一侧没有要求大于零的关键切割,则该方法执行第二处理程序。 流程路由方法执行第一或第二处理例程直到发生终止条件。
    • 45. 发明授权
    • Method of telecommunications demand-route multiplexing (DEROM)
    • 电信需求路由复用方法(DEROM)
    • US5959975A
    • 1999-09-28
    • US862290
    • 1997-05-23
    • Lev B. SofmanSridhar S. Nathan
    • Lev B. SofmanSridhar S. Nathan
    • H04Q11/04H04L12/24
    • H04Q11/0478H04J2203/0053
    • A method of optimizing a telecommunications network in terms of transmission and equipment cost by multiplexing lower bandwidth level telecommunications demand-routes to form higher bandwidth level bundles, by determining, for each demand-route, whether the demand-route includes a patching subroute. For each patching subroute, the method finds a best bundle of demand-routes that includes the patching subroute. The best bundle is the one that has the highest cost gradient between the sum of the costs associated with the demand-routes included in the best bundle and the total cost associated with the best bundle. The method then multiplexes the demand-routes according to the best bundles.
    • 通过针对每个需求路由确定需求路由是否包括修补子路由,通过复用较低带宽水平的电信需求路由以形成更高带宽水平的捆绑,从而在传输和设备成本方面优化电信网络的方法。 对于每个修补子路由,该方法找到包含修补子路由的最佳捆绑需求路由。 最好的捆绑包是在与最佳捆绑包中包含的需求路由相关联的成本总和与最佳捆绑相关联的总成本之间具有最高成本梯度的捆绑。 该方法然后根据最佳捆绑多路复用需求路由。