专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2009122152A1 ADMISSION CONTROL AND ROUTING IN A PACKET NETWORK 审中-公开
标题翻译：分组网络中的接入控制和路由
公开(公告)号：WO2009122152A1
公开(公告)日：2009-10-08
申请号：PCT/GB2009/000832
申请日：2009-03-27
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , STRULO, Ben , WENNINK, Marc , CORLIANO, Gabriele
发明人： STRULO, Ben , WENNINK, Marc , CORLIANO, Gabriele
IPC分类号： H04L12/56
CPC分类号： H04L45/123 , H04L45/02 , H04L45/125 , H04L45/38 , H04L47/11 , H04L47/125 , H04L47/2408 , H04L47/70 , H04L47/822
摘要： Embodiments of the invention provide a network management sub-system which is preferably logically separate from the routing nodes (including gateway nodes) of a network. The network management sub-system receives load information relating to present packet flows on existing predetermined paths in the network, and when a request for admittance of a new packet flow is received, is able to make a decision as to whether the new flow should be both: i) admitted to the network; and ii) on to which path; in substantially the same process step. This is possible because the admission control and routing algorithms are integrated into a single process, the result of which provides both an admission control decision as well as a routing decision at the same time. By performing such an operation in a management sub-system which is separate from the routing nodes, there is no need for such functionality to be duplicated in nodes across the network, and instead the routing nodes are relieved of the burden of having to make such decision themselves. As a consequence, the network nodes can be kept simpler, and network control can be retained by the network operator in the management sub-system.
摘要翻译：本发明的实施例提供一种网络管理子系统，其优选地在逻辑上与网络的路由节点（包括网关节点）分离。网络管理子系统接收与网络中现有预定路径上的当前分组流有关的负载信息，并且当接收到新分组流的接纳请求时，能够决定新流是否应该两者：i）进入网络; 和ii）到哪个路径; 在基本相同的工艺步骤中。这是可能的，因为接纳控制和路由算法被集成到单个进程中，其结果同时提供准入控制决定以及路由决定。通过在与路由节点分离的管理子系统中执行这样的操作，不需要在网络中的节点中复制这样的功能，相反，路由节点免除了必须做出这样的负担决定自己因此，网络节点可以保持简单，网络运营商可以在管理子系统中保留网络控制。

2. 发明申请

WO2010112854A1 RESTORATION PLANNING IN A PACKET NETWORK 审中-公开
标题翻译：包装网络中的恢复规划
公开(公告)号：WO2010112854A1
公开(公告)日：2010-10-07
申请号：PCT/GB2010/000637
申请日：2010-03-31
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , WENNINK, Marc , STRULO, Ben , CORLIANO, Gabriele , WALKER, Nigel, Gordon
发明人： WENNINK, Marc , STRULO, Ben , CORLIANO, Gabriele , WALKER, Nigel, Gordon
IPC分类号： H04L12/24
CPC分类号： H04L45/125 , H04L41/0654 , H04L45/00 , H04L45/12 , H04L45/124 , H04L45/22 , H04L45/28 , H04L47/10 , H04L47/12 , Y02D30/32
摘要： Examples of the invention generate restoration plans (444) defining how data traffic should be moved from one path to another in the event of a predetermined failure in dependence on present load data (427) received from nodes in the network. In preferred examples the calculation of the restoration plans (444) is performed using a linear programming optimisation function that optimises the value obtained by the network in admitting additional flows versus the additional restoration cost that would be incurred in the event of one or more predetermined failures. In addition, preferred examples also calculate admission control parameters to be used by ingress nodes which, when used to control admission of new flows, ensures that the restoration plans should be successful in the event of failures. By integrating admission control (42) and restoration planning (44) in this manner, resilience and resource utilisation in the network are improved.
摘要翻译：本发明的示例产生恢复计划（444），该恢复计划（444）根据从网络中的节点接收的当前负载数据（427），在预定故障的情况下定义数据流量应如何从一个路径移动到另一路径。在优选示例中，使用线性规划优化功能来执行恢复计划（444）的计算，线性规划优化功能优化网络获得的值，以允许额外的流量相对于在一个或多个预定故障的情况下将产生的附加恢复成本。此外，优选示例还计算要由入口节点使用的准入控制参数，当用于控制新流的接纳时，确保恢复计划在发生故障时应该成功。通过以这种方式整合入网控制（42）和恢复规划（44），提高了网络的弹性和资源利用率。

3. 发明申请

WO2009122150A1 ADMISSION CONTROL IN A PACKET NETWORK 审中-公开
标题翻译：分组网络中的入门控制
公开(公告)号：WO2009122150A1
公开(公告)日：2009-10-08
申请号：PCT/GB2009/000827
申请日：2009-03-27
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , STRULO, Ben , WENNINK, Marc , CORLIANO, Gabriele
发明人： STRULO, Ben , WENNINK, Marc , CORLIANO, Gabriele
IPC分类号： H04L12/56
CPC分类号： H04L45/125 , H04L45/123 , H04L45/38 , H04L47/12 , H04L47/15 , H04L47/70 , Y02D30/32
摘要： In embodiments of the invention when a session request is received the value assigned to that session is compared to present congestion costs in the network at the present time. If the value of the session exceeds the cost then the session is accepted; otherwise it is rejected. It is possible to show mathematically that, provided this strategy is used for all session requests, then, when demand exceeds supply for a given resource, the congestion measurement for that resource rises to become equal to its shadow price. Here, in a model of a capacity constrained network, the shadow price of a capacity constraint is the cost to other users of using one unit of capacity. Congestion measurements can therefore be used to provide a "cost" (to other users) of admitting the flow to the network, which can then be compared against the "value" (to the network operator) of admitting the flow during the admission control evaluation. Additionally, this "cost" vs. "value" comparison can be used for path selection, as well as any other resource management decision. For example, in particularly preferred embodiments a session is not only admitted based upon the cost value comparison, but is also assigned to a particular path which maximises value minus cost.
摘要翻译：在本发明的实施例中，当接收到会话请求时，将分配给该会话的值与当前网络中的当前拥塞成本进行比较。如果会话的价值超过成本，则会话被接受; 否则被拒绝。有可能在数学上显示，只要该策略用于所有会话请求，那么当需求超过给定资源的供应时，该资源的拥塞度量就会变得等于其影子价格。这里，在容量约束网络的模型中，容量约束的影子价格是其他用户使用一个容量单位的成本。因此，拥塞测量可用于向网络提供“成本”（向其他用户），该流量可以与入网控制评估期间允许流量的“价值”（对网络运营商）进行比较。此外，这种“成本”与“价值”比较可用于路径选择以及任何其他资源管理决策。例如，在特别优选的实施例中，会话不仅基于成本值比较而被允许，而且还被分配给最大化值减去成本的特定路径。

4. 发明申请

WO2009037466A1 METHODS AND APPARATUS FOR PROVIDING CONGESTION INFORMATION 审中-公开
标题翻译：提供对策信息的方法和装置
公开(公告)号：WO2009037466A1
公开(公告)日：2009-03-26
申请号：PCT/GB2008/003177
申请日：2008-09-19
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , CORLIANO, Gabriele , STRULO, Ben , WENNINK, Marc
发明人： CORLIANO, Gabriele , STRULO, Ben , WENNINK, Marc
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/11 , H04L47/215 , H04L47/31
摘要： Methods and systems for providing information relating to congestion at a network element caused by data units intended to be forwarded across a telecommunications network by the network element, the apparatus comprising: load-data receiving means for receiving load data relating to data units intended to be forwarded by the network element; rate-data obtaining means for obtaining data indicative of a configurable rate; first and second registers for storing first and second metrics; first and second updating means operable to update the metrics in said first and second registers in dependence on said load data and on the configurable rate; and a congestion indication provider operable to provide indications of congestion in dependence on the metrics stored in the registers; said apparatus being configured in such that it may provide behaviour equivalent to a virtual queue marking scheme by virtue of a minor modification to hardware provided for Single Rate Three Colour Marking.
摘要翻译：用于提供由网络元件预期通过电信网络转发的数据单元所引起的与网络中的拥塞有关的信息的方法和系统，所述装置包括：负载数据接收装置，用于接收与要被由网元转发; 速率数据获取装置，用于获取指示可配置速率的数据; 用于存储第一和第二度量的第一和第二寄存器; 第一和第二更新装置，用于根据所述负载数据和可配置速率更新所述第一和第二寄存器中的度量; 以及拥塞指示提供者，其可操作以根据存储在所述寄存器中的度量来提供拥塞的指示; 所述设备被配置为使得它可以通过对为单速率三色标记提供的硬件进行小的修改而提供与虚拟队列标记方案相当的行为。

5. 发明申请

WO2010112853A1 PATH GENERATION IN A PACKET NETWORK 审中-公开
标题翻译： PACKET网络中的路径生成
公开(公告)号：WO2010112853A1
公开(公告)日：2010-10-07
申请号：PCT/GB2010/000636
申请日：2010-03-31
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , WENNINK, Marc , STRULO, Ben , CORLIANO, Gabriele
发明人： WENNINK, Marc , STRULO, Ben , CORLIANO, Gabriele
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L45/12 , H04L45/124 , H04L45/125 , H04L45/22 , H04L47/12 , H04W40/02
摘要： An embodiment of the present invention provides an alternative path generation technique which is able to take into account changes in network circumstances, such as link failures, or changes in traffic patterns, by making use of a congestion measure for each operational link in the network, and then applying a route finding algorithm (such as the conventional Open Shortest Path First (OSPF) algorithm) to find paths, with the congestion measures input into the algorithm as the path length values. The route-finding algorithm is then able to determine candidate paths in dependence not on path length, as is conventional, but on the present load in the network, and in particular between IEPs, as measured by the congestion measures. As the congestion measures implicitly take into account present traffic load, as well as link failures, and the like, an adaptive candidate path generation technique is provided, which is able to find alternative paths for IEPs in dependence on present network conditions. Optionally, in some embodiments, the candidate paths are subject to a threshold test against a property thereof, and if the test is passed then the candidate path is implemented in the network, and becomes a path between an IEP onto which traffic can then be routed.
摘要翻译：本发明的实施例提供了一种备选路径生成技术，其可以通过利用网络中的每个操作链路的拥塞度量来考虑网络环境的变化，诸如链路故障或业务模式的变化，然后应用路由查找算法（例如传统的开放最短路径优先（OSPF）算法）来找到路径，将拥塞度量输入到算法中作为路径长度值。然后，路由查找算法能够像传统的那样根据路径长度确定候选路径，但是根据拥塞措施测量的网络中的当前负载，特别是在IEP之间确定候选路径。由于拥塞措施隐含地考虑到当前业务负载以及链路故障等，因此提供了一种适应性候选路径生成技术，其能够根据当前网络条件找到IEP的替代路径。可选地，在一些实施例中，候选路径经受相对于其属性的阈值测试，并且如果测试被传递，则候选路径在网络中实现，并且变成IEP之间的路径，然后路由到哪个业务。

6. 发明申请

WO2010112818A1 PRE-CONGESTION NOTIFICATION (PCN) AS A BASE FOR ADMISSION CONTROL AND FLOE TERMINATION 审中-公开
标题翻译：预约通知（PCN）作为入境控制和流动终止的基础
公开(公告)号：WO2010112818A1
公开(公告)日：2010-10-07
申请号：PCT/GB2010/000571
申请日：2010-03-25
申请人： BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY , STURLO, Ben , WENNINK, Marc
发明人： STURLO, Ben , WENNINK, Marc
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/2408 , H04L47/26 , H04L47/31 , H04L47/32
摘要： A network has a plurality of edge nodes (7a, 7b, 7c, 7d) and core nodes (3a, 3b, 3c) for carrying flows of data from an ingress gateway (7a, 7b, 7c, 7d) to an egress gateway (7a, 7b, 7c, 7d) along a path of core nodes. For any given path in the network from an ingress node to an egress node, the number of flows is controlled. When network congestion occurs, the egress gateway (7a, 7b, 7c, 7d) provides an indication of the level of network congestion. Terminating flows is disruptive and therefore the ingress gateway (7a, 7b, 7c, 7d) can mark other flows with a congestion marker and send them to the egress gateway (7a, 7b, 7c, 7d). These marked flows are routed by the core and egress gateway (7a, 7b, 7c, 7d) but ignored for calculating network congestion. When the network congestion is alleviated, the marked flows can be un-marked and treated as normal flows, hence the network avoids unnecessary flow termination.
摘要翻译：网络具有多个边缘节点（7a，7b，7c，7d）和用于承载来自入口网关（7a，7b，7c，7d）到出口网关的数据流的核心节点（3a，3b，3c） 7a，7b，7c，7d）。对于从入口节点到出口节点的网络中的任何给定路径，流量的数量被控制。当发生网络拥塞时，出口网关（7a，7b，7c，7d）提供网络拥塞级别的指示。终端流是破坏性的，因此入口网关（7a，7b，7c，7d）可以用拥塞标记标记其他流，并将它们发送到出口网关（7a，7b，7c，7d）。这些标记的流由核心和出口网关（7a，7b，7c，7d）路由，但被忽略以计算网络拥塞。当网络拥塞得到缓解时，标记的流量可以被标记为正常流量，因此网络避免了不必要的流量终止。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式