-
1.发明授权Restoration path calculation considering shared-risk link groups in mesh networks 有权考虑网状网络中共享风险链路组的恢复路径计算公开(公告)号：US08867333B2
公开(公告)日：2014-10-21
申请号：US10673055
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
CPC分类号： H04L41/0896 , H04L41/0213 , H04L41/0668
摘要： A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.
摘要翻译： 用于确定网状网络中的新服务的恢复路径的方法包括基于与主路径中的链路相关联的共享风险链路组（SRLG）来选择与新服务的主路径相对应的候选恢复路径。 该方法包括对于与主路径相关联的多个候选恢复路径中的每一个，（1）确定主路径是否需要在恢复路径的任何链路上保留任何额外的恢复带宽，基于对于每个链路是否 恢复路径，主路径与被该链路保护的彼此主路径之间的SRLG不相交，（2）生成恢复路径的路径开销，其中路径开销是否需要任何额外的恢复带宽的函数 ; （3）根据路径成本选择新业务的恢复路径。
-
2.发明授权Primary/restoration path calculation in mesh networks based on multiple-cost criteria 有权基于多成本标准的网状网络中的主/恢复路径计算公开(公告)号：US07689693B2
公开(公告)日：2010-03-30
申请号：US10673383
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F15/173 , G06F15/16 , G06F11/00
CPC分类号： H04J14/0284 , H04J14/0227 , H04J14/0241 , H04J14/0294 , H04J14/0295 , H04L45/12 , H04L45/124 , H04L45/22 , H04L45/28 , H04L45/50 , H04L45/62
摘要： A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.
摘要翻译： 用于确定网状网络中的新服务的主路径和恢复路径的方法涉及（1）针对新服务的多个候选主/恢复路径对中的每一个，生成每个候选对的路径开销，其中路径成本 对于每个恢复路径是恢复路径内的链路成本之和的函数，以及（2）基于路径开销从多个候选路径对中选择新服务的主路径和恢复路径。 如果没有可能的共享，对于低利用率链路，链路的成本是链路的管理权重的函数，而对于高利用率链路，链路成本是链路上可用容量的倒数的函数。 如果共享是可能的，则成本是链路共享度的倒数的函数。
-
3.发明授权Connection set-up extension for restoration path establishment in mesh networks 有权网状网络中恢复路径建立的连接建立扩展公开(公告)号：US07451340B2
公开(公告)日：2008-11-11
申请号：US10673382
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F11/00
CPC分类号： H04L45/123 , H04L41/0663 , H04L45/22 , H04L45/28 , H04L45/50
摘要： An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.
摘要翻译： 用于建立网状网络中的服务的恢复路径的连接建立协议的扩展涉及在沿着恢复路径的传输节点处的步骤（1）接收具有每个链路和传输的标识的服务数据结构 节点，以及（2）使用服务数据结构确定是否在事件发生的出站链路上预留额外的保护带宽，其中，出站链路是恢复路径的一部分。 在一个或多个实施例中，服务数据结构包括服务的标识，输出链路的标识和服务的带宽。 在一些情况下，如果传输节点基于已经在传出链路上保留的保护带宽的知识，则传输节点确定需要保护带宽，则扩展包括在出站链路上保留附加保护带宽。
-
4.发明授权Calculation, representation, and maintenance of sharing information in mesh networks 有权网状网络共享信息的计算，表示和维护公开(公告)号：US08296407B2
公开(公告)日：2012-10-23
申请号：US10673381
申请日：2003-09-26
申请人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
发明人： Bharat T. Doshi , Zbigniew M. Dziong , Ramesh Nagarajan , Muhammad A. Qureshi , Yung-Terng Wang
IPC分类号： G06F15/177 , G06F15/173 , H04J3/22
CPC分类号： H04L41/0663 , H04L41/0213 , H04L41/5019 , H04L41/5087
摘要： A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.
摘要翻译： 一种用于在网络数据结构中表示在网状网络中的每个链路上保留的最小保护带宽量以在网络中的另一节点或链路故障时恢复服务的方法。 该方法包括：（1）在网络中接收对新服务的请求，其中新服务由具有用于新服务的主路径中的每个链路和传输节点的标识的服务数据结构表示，（2）确定 使用网络和服务数据结构，新服务是否需要在网络中的任何链路上保留额外的保护带宽，以及（3）如果确定需要额外的保护带宽，则更新网络数据结构。 在一个实现中，网络和服务数据结构是向量，并且确定和更新的步骤涉及这些结构之间的向量操作。
-
公开(公告)号：US07606237B2
公开(公告)日：2009-10-20
申请号：US10639728
申请日：2003-08-12
IPC分类号： H04L12/28
CPC分类号： H04L41/0663 , H04L41/0896 , H04L41/5022 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/70 , H04L47/724 , H04L47/728 , H04L47/746 , H04L47/781 , H04L47/783 , H04L47/825
摘要： A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.
摘要翻译： 用于分组级别的基于路径恢复的共享网格数据网络（SMDN）。 在一个实现中，网络中的第一链路是两个或更多个不同保护路径的一部分，其中每个保护路径对应于不同的主路径。 网络管理器确定在两个或多个保护路径的第一链路上保留多少保护带宽，使得在第一链路上保留的保护带宽在两个或多个主路径的保护路径之间共享。 因此，在第一链路上保留的保护带宽的量可以小于两个或更多个主要路径的带宽的总和。 SMDN提供有效的共享保护能力。 SMDN的实现适用于多协议标签交换（MPLS）光网络。
-
公开(公告)号：US08111612B2
公开(公告)日：2012-02-07
申请号：US10817748
申请日：2004-04-02
CPC分类号： H04L12/4637 , H04L45/128 , H04L45/28
摘要： A protected communication network utilizes a link-based recovery strategy that supports independent recovery paths for individual demands, where each link includes one or more lines and each line can support one or more demands. Failure of one or more—or even all—of the lines/ports of a link will typically result in the independent rerouting of the affected demands along one or more link-detour paths. The flexibility afforded by recovery at the granularity of a demand supports the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. The network also addresses the restricted case where all demands on a line/port are recovered along the same link-detour path.
摘要翻译： 受保护的通信网络利用基于链路的恢复策略，其支持针对个体需求的独立恢复路径，其中每个链路包括一条或多条线路，并且每条线路可以支持一个或多个需求。 链路的一个或多个或甚至全部的线路/端口的故障通常将导致沿着一个或多个链路绕行路径的受影响的需求的独立重新路由。 以需求粒度恢复提供的灵活性支持更优化的链路迂回路径的计算以及不相交故障之间网络资源共享的相应增加。 该网络还解决了限制的情况，其中线路/端口上的所有需求沿着相同的链路绕行路径恢复。
-
公开(公告)号：US07500013B2
公开(公告)日：2009-03-03
申请号：US10817760
申请日：2004-04-02
IPC分类号： G06F15/173 , G06F12/00
CPC分类号： H04L45/123 , H04L41/0668 , H04L45/02 , H04L45/22 , H04L45/28
摘要： A protected communication network utilizes a link-based recovery strategy that includes methods for calculating and distributing link-protection parameters and calculating primary and link-detour paths based on these parameters. These link-protection parameters support the computation of more-optimal link-detour paths and a corresponding increase in sharing of network resources between disjoint failures. A joint-optimization mechanism can be employed that considers both the cost of link-detour paths as well as the cost of links in candidate primary paths in the selection of a primary path for a demand. Information for the joint optimization is preferably distributed using link-state advertisements.
摘要翻译： 受保护的通信网络利用基于链路的恢复策略，其包括用于计算和分发链路保护参数并基于这些参数计算主路由和链路迂回路径的方法。 这些链路保护参数支持更优化的链路迂回路径的计算，并且相应地增加不相交故障之间的网络资源共享。 可以采用联合优化机制，其考虑在选择主要路径的需求时，链路绕行路径的成本以及候选主路径中的链路的成本。 用于联合优化的信息优选地使用链路状态广告来分发。
-
8.发明授权Sequence number schemes for acceptance/rejection of duplicated packets in a packet-based data network 有权用于在基于分组的数据网络中接受/拒绝重复分组的序列号方案公开(公告)号：US07406082B2
公开(公告)日：2008-07-29
申请号：US10261090
申请日：2002-09-30
IPC分类号： H04L12/28
摘要： In a packet-based data network, packets are duplicated and a sequence number is inserted into each duplicate packet, where the duplicate packets are transmitted along two different paths from a source node to a destination node in the network. Depending on the implementation, the source node inserts different types of sequence numbers into the duplicate packets, and the destination node processes those sequence numbers accordingly to determine whether to accept or reject each received packet. In certain implementations, the number of sequence bits allocated to each packet is smaller than the size of the effective sequence number for the packet as interpreted by the destination node.
摘要翻译： 在基于分组的数据网络中，分组被复制，并且将序列号插入到每个重复分组中，其中重复分组沿着从源节点到网络中的目的地节点的两个不同路径传输。 根据实现，源节点将不同类型的序列号插入到重复分组中，并且目的节点相应地处理这些序列号，以确定是接受还是拒绝每个接收到的分组。 在某些实现中，分配给每个分组的序列比特数小于由目的地节点解释的分组的有效序列号的大小。
-
公开(公告)号：US07023841B2
公开(公告)日：2006-04-04
申请号：US10017174
申请日：2001-12-14
申请人： Martin S. Dell , Zbigniew M. Dziong , Wei Li , Matthew Tota , Yung-Terng Wang
发明人： Martin S. Dell , Zbigniew M. Dziong , Wei Li , Matthew Tota , Yung-Terng Wang
IPC分类号： H04L12/50
CPC分类号： H04L12/5601 , H04L49/1553 , H04L49/1576 , H04L49/3081 , H04L2012/5635 , H04L2012/5679 , H04L2012/5681 , H04Q11/0478
摘要： A switch fabric for routing data has a switching stage configured between an input stage and an output stage. The input stage forwards the received data to the switching stage, which routes the data to the output stage, which transmits the data towards destinations. Each input device of the input stage transmits bids to the crossbar devices of the switching stage to request connections through the switching stage for routing the data to the output devices of the output stage. In one aspect, each crossbar device has (1) a bid arbitrator that determines whether to accept or reject each received bid, wherein, in response to a collision between multiple bids, the bid arbitrator accepts two or more of the colliding bids in a single time slot; and (2) memory for storing one or more accepted cells for the same output device, wherein the crossbar device can transmit grant signals for two or more accepted bids for the same output device in a single time slot. In another aspect, the bid arbitrator is configured to re-consider whether to accept a stored bid that was not accepted in a previous time slot.
-
公开(公告)号：US07161906B2
公开(公告)日：2007-01-09
申请号：US10017173
申请日：2001-12-14
申请人： Martin S. Dell , Zbigniew M. Dziong , Wei Li , Yu-Kuen Ouyang , Matthew Tota , Yung-Terng Wang
发明人： Martin S. Dell , Zbigniew M. Dziong , Wei Li , Yu-Kuen Ouyang , Matthew Tota , Yung-Terng Wang
CPC分类号： H04L49/1576 , H04L49/3081 , H04L2012/5634 , H04L2012/5635 , H04L2012/5679 , H04Q11/0005 , H04Q11/0478 , H04Q2011/0024 , H04Q2011/0052
摘要： A switch fabric for routing data has a switching stage configured between an input stage and an output stage. The input stage forwards the received data to the switching stage, which routes the data to the output stage, which transmits the data towards destinations. In one aspect, at least one input port can be programmably configured to store data in two or more input routing queues that are associated with a single output port, and at least one output port can be programmably configured to receive data from two or more output routing queues that are associated with a single input port. In another aspect, the output stage transmits status information about the output stage to the input stage, which uses the status information to generate bids to request connections through the switching stage. In yet another aspect, the switching stage transmits a grant/rejection signal to the input stage identifying (1) whether each bid is accepted or rejected and, if rejected, (2) a reason for rejecting the bid, and the input stage determines how to react to a rejected bid based on the reason the bid was rejected.
摘要翻译： 用于路由数据的交换结构具有在输入级和输出级之间配置的切换级。 输入级将接收到的数据转发到切换级，该级将数据路由到输出级，将数据发送到目的地。 在一个方面，至少一个输入端口可以可编程地配置为将数据存储在与单个输出端口相关联的两个或多个输入路由队列中，并且至少一个输出端口可以被可编程地配置成从两个或更多个输出端接收数据 与单个输入端口关联的路由队列。 在另一方面，输出级将关于输出级的状态信息发送到输入级，其使用状态信息来生成出价以请求通过切换级的连接。 在另一方面，切换阶段向准入/拒绝信号发送授权/拒绝信号，识别（1）是否接受或拒绝每个投标，如果被拒绝，则拒绝该投标的原因，并且输入阶段确定如何 根据拒绝的原因对拒绝的投标做出反应。
-
-
-
-
-
-
-
-
-
搜索结果
44 条记录 (耗时 0.048 秒)
