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

1. 发明申请

WO2004002078A1 DYNAMIC ROUTING IN PACKET-SWITCHING MULTI-LAYER COMMUNICATIONS NETWORKS 审中-公开
标题翻译：分组交换多层通信网络中的动态路由
公开(公告)号：WO2004002078A1
公开(公告)日：2003-12-31
申请号：PCT/EP2002/005518
申请日：2002-05-17
申请人： TELEFONAKTIEBOLAGET LM ERICSSON , IOVANNA, Paola , SABELLA, Roberto , TOU, Pietro , ORIOLO, Gianpaolo
发明人： IOVANNA, Paola , SABELLA, Roberto , TOU, Pietro , ORIOLO, Gianpaolo
IPC分类号： H04L12/46
CPC分类号： H04L45/125 , H04L29/06 , H04L45/02 , H04L45/124 , H04L45/50 , H04L45/62 , H04L45/64 , H04L47/10 , H04L47/125 , H04L69/32
摘要： A method is provided for routing data packets across a multi-layer network which includes a plurality of nodes, a logical level provided with a plurality of logical links and a physical level provided with a plurality of physical links, each of the logical links corresponding to at least one of the physical links, the method comprising the steps of assigning a weight to each logical link with respect to a first critical constraint in the logical level, refining the weight assigned to each logical link with respect to a second critical constraint in the physical level and, based on the weights assigned to each link, computing a path at the logical level connecting a start node to an end node for the transport of the data packets.
摘要翻译：提供了一种用于在包括多个节点的多层网络中路由数据分组的方法，提供有多条逻辑链路的逻辑级别和提供有多条物理链路的物理级别，每条逻辑链路对应于所述物理链路中的至少一个，所述方法包括以下步骤：针对所述逻辑级别中的第一关键约束向每个逻辑链路分配权重，从而针对所述逻辑链路中的第二关键约束优化分配给每个逻辑链路的权重并且基于分配给每个链路的权重，计算连接起始节点到终端节点的逻辑等级的用于传输数据分组的路径。

2. 发明申请

WO2009106153A1 COMMUNICATION NETWORK 审中-公开
标题翻译：通信网络
公开(公告)号：WO2009106153A1
公开(公告)日：2009-09-03
申请号：PCT/EP2008/059528
申请日：2008-07-21
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , SANITA, Laura , ORIOLO, Gianpaolo , IOVANNA, Paola , SABELLA, Roberto
发明人： SANITA, Laura , ORIOLO, Gianpaolo , IOVANNA, Paola , SABELLA, Roberto
IPC分类号： H04L12/56 , H04Q11/00
CPC分类号： H04Q11/0062 , H04J14/0227 , H04J14/0246 , H04J14/025 , H04J14/028 , H04J14/0284 , H04J14/0295 , H04L45/00 , H04L45/22 , H04L45/28 , H04L45/50 , H04L45/62 , H04L45/64 , H04Q2011/0073 , H04Q2011/0077 , H04Q2011/0081
摘要： A method for determining routing for data which is to be transmitted over a multilayer network (1), the network comprising a first layer of nodes (A, B, C), and a second layer of nodes (31, 32, 33, 34, 35), and the method comprising determining routing by taking account of available signal transmission/processing resource associated with the first layer and available signal transmission/processing resource associated with the second layer.
摘要翻译：一种用于确定要在多层网络（1）上传输的数据的路由的方法，所述网络包括第一层节点（A，B，C）和第二层节点（31,32,33,34），35），并且所述方法包括通过考虑与第一层相关联的可用信号传输/处理资源和与第二层相关联的可用信号传输/处理资源来确定路由。

3. 发明申请

WO2013034200A1 APPARATUS AND METHOD FOR TRAFFIC ROUTING 审中-公开
标题翻译：交通路由的装置和方法
公开(公告)号：WO2013034200A1
公开(公告)日：2013-03-14
申请号：PCT/EP2011/067815
申请日：2011-10-12
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , IOVANNA, Paola , BOTTARI, Giulio , ORIOLO, Gianpaolo
发明人： IOVANNA, Paola , BOTTARI, Giulio , ORIOLO, Gianpaolo
IPC分类号： H04L12/56 , H04L12/64
CPC分类号： H04L45/00 , H04J14/021 , H04J14/0212 , H04J14/0257 , H04J14/0267 , H04L45/62
摘要： Embodiments of the invention relate to a method (400) for routing traffic through a network having a plurality of nodes, at least one of said plurality of nodes being an integrated node including first and second technologies integrated inside the same node platform, the method comprising: applying (402) a transformation algorithm to the plurality of nodes for determining at least one virtual link between at least two ports of the plurality of nodes; and performing (404) a routing algorithm using the at least one virtual link to determine an optimal virtual route for the traffic through the network based on at least one cost parameter associated with the at least one virtual link. By applying a transformation algorithm to a plurality of nodes in a network, virtual links can be created between virtual ports in the nodes, which are homogenous and allow all routes through the network to be considered concurrently during a routing algorithm. This allows an optimal route to be determined based on cost parameters associated with each virtual link.
摘要翻译：本发明的实施例涉及一种用于通过具有多个节点的网络路由业务的方法（400），所述多个节点中的至少一个节点是包括集成在同一节点平台内的第一和第二技术的集成节点，所述方法包括：：向所述多个节点应用（402）变换算法以确定所述多个节点中的至少两个端口之间的至少一个虚拟链路; 以及使用所述至少一个虚拟链路执行（404）路由算法，以基于与所述至少一个虚拟链路相关联的至少一个成本参数来确定通过所述网络的流量的最优虚拟路由。通过对网络中的多个节点应用变换算法，可以在节点中的虚拟端口之间创建虚拟链路，这些链路是同质的，并且允许在路由算法期间同时考虑通过网络的所有路由。这允许基于与每个虚拟链路相关联的成本参数来确定最优路由。

4. 发明申请

WO2013079225A1 BUILDING TOPOLOGY IN COMMUNICATIONS NETWORKS 审中-公开
标题翻译：通信网络建设拓扑
公开(公告)号：WO2013079225A1
公开(公告)日：2013-06-06
申请号：PCT/EP2012/057911
申请日：2012-04-30
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , IOVANNA, Paola , ZEMA, Cristiano , ORIOLO, Gianpaolo
发明人： IOVANNA, Paola , ZEMA, Cristiano , ORIOLO, Gianpaolo
IPC分类号： H04L12/24 , H04L12/56
CPC分类号： H04L41/12 , H04L45/02 , H04L45/302
摘要： The present proposal provides a specific solution for communications network topology summarization with a good trade-off between high scalability, good stability and resources utilization efficiency.
摘要翻译：本提案为通信网络拓扑摘要提供了具体的解决方案，具有高可扩展性，良好的稳定性和资源利用效率之间的良好折衷。

5. 发明申请

WO2011085823A1 ROUTING THROUGH NETWORK HAVING OPTICAL AND ELECTRICAL LAYERS 审中-公开
标题翻译：通过具有光学和电气层的网络进行路由
公开(公告)号：WO2011085823A1
公开(公告)日：2011-07-21
申请号：PCT/EP2010/051287
申请日：2010-02-03
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , IOVANNA, Paola , BOTTARI, Giulio , ORIOLO, Gianpaolo
发明人： IOVANNA, Paola , BOTTARI, Giulio , ORIOLO, Gianpaolo
IPC分类号： H04J14/02 , H04Q11/00
CPC分类号： H04J14/02 , H04L41/12 , H04L45/58 , H04L45/62 , H04L45/64 , H04Q11/0071 , H04Q2011/0073 , H04Q2011/0086
摘要： Routing traffic across a network having an optical layer (40) and an electrical layer (30), involves using a common topology representing the optical and electrical layers of the network. The common topology is such that an individual port of a respective optical device in the optical layer (40) is represented as corresponding virtual nodes (145), coupled by virtual links (155), in the common topology together with a representation of nodes and links of the electrical layer. The routing path in terms of the common topology is mapped back into a routing path through the actual optical devices (50) of the optical layer. By moving the handling of colour (including wavelength assignment, wavelength continuity and colour selection where it is tunable/selectable) and direction constraints to the preliminary step of creating the common topology, the routing process can be simplified.
摘要翻译：跨越具有光学层（40）和电层（30）的网络的路由业务涉及使用表示网络的光层和电层的公共拓扑。公共拓扑结构使得光层（40）中的相应光学设备的单独端口被表示为在公共拓扑中与虚拟链路（155）耦合的对应虚拟节点（145）以及节点的表示，以及电层的链接。根据公共拓扑的路由路径通过光层的实际光学设备（50）映射回到路由路径中。通过移动颜色处理（包括波长分配，波长连续性和可调/可选择的颜色选择）以及方向约束到创建公共拓扑的初步步骤，可以简化路由过程。

6. 发明申请

WO2009118050A1 END-TO-END INTER-DOMAIN ROUTING 审中-公开
标题翻译：端到端的域间路由
公开(公告)号：WO2009118050A1
公开(公告)日：2009-10-01
申请号：PCT/EP2008/053772
申请日：2008-03-28
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , IOVANNA, Paola , ZEMA, Cristiano
发明人： IOVANNA, Paola , ZEMA, Cristiano
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L41/12 , H04L45/02 , H04L45/04
摘要： According to a first aspect of the present invention there is provided a method of constructing an end-to-end routing path across multiple packet switched domains. The method comprises generating a domains topology identifying all possible domains, the border elements of those domains and the inter-domain links. When a request is received for computation of a path from a source entity in a first domain to a destination entity in a second domain, all domains and inter-domain links that cannot or are unlikely to feature in the requested path are removed from the domains topology. Candidate intra-domain paths for each remaining domain are then computed, witheach candidate intra-domain path being mapped to a logical link defined by its two ends, at least one end being a border element and the other being a border element or the source or destination entity.Attributes for each logical link are determined, together with attributes of the remaining inter-domain links. A virtual network topologyis generated by combining the logical links and their associated attributes with the remaining inter-domain links and their associated attributes. This allows a best end-to-end route to be determined by analysing the virtual network topology.
摘要翻译：根据本发明的第一方面，提供了一种跨多个分组交换域构建端到端路由路径的方法。该方法包括生成识别所有可能域的域拓扑，这些域的边界元素和域间链接。当接收到用于计算从第一域中的源实体到第二域中的目标实体的路径的请求时，从所述域中删除不能或不可能在所请求的路径中进行特征的所有域和域间链路拓扑结构。然后计算每个剩余域的候选域内路径，其中候选域内路径被映射到由其两端限定的逻辑链路，至少一端是边界元素，另一端作为边界元素或源或确定每个逻辑链路的属性以及剩余的域间链接的属性。通过将逻辑链路及其相关联的属性与剩余的域间链接及其相关联的属性组合来生成虚拟网络拓扑。这允许通过分析虚拟网络拓扑来确定最佳的端对端路由。

7. 发明申请

WO2011150983A1 REDUCING NETWORK POWER CONSUMPTION 审中-公开
标题翻译：降低网络功耗
公开(公告)号：WO2011150983A1
公开(公告)日：2011-12-08
申请号：PCT/EP2010/060135
申请日：2010-07-14
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , IOVANNA, Paola , TESTA, Francesco , D'ERRICO, Antonio
发明人： IOVANNA, Paola , TESTA, Francesco , D'ERRICO, Antonio
IPC分类号： H04L12/56
CPC分类号： H04L12/02 , H04L45/00 , H04L45/123 , H04L45/127
摘要： Path computation involves determining (120, 930) an aggregate cost for a portion of the path, based at least on the power consumption attributable to use of interfaces along that portion, comparing (130, 930) the portion of the first possible path with a different portion corresponding to a different possible path for the traffic request, based at least on their respective aggregate costs, and selecting (140, 930) which portion to use for the traffic request based on the comparison. Having path selection influenced by the power consumption values, can lead to lower overall consumption in operation than relying only on optimizing nodes individually without regard to how the nodes are used. Path selection can take into account indications of which parts are in a power down mode, and can involve powering up such parts if needed.
摘要翻译：路径计算涉及至少基于归因于使用沿着该部分的接口的功率消耗来确定（120,930）一部分路径的总成本，将第一可能路径的部分与至少基于它们各自的总成本对应于业务请求的不同可能路径的不同部分，以及基于该比较来选择（140,930）用于业务请求的哪个部分。具有受功耗值影响的路径选择可以导致运行中的总体消耗低于仅依赖于优化节点而不考虑节点如何使用。路径选择可以考虑哪些部件处于断电模式的指示，如果需要，可以包括上电这些部件。

8. 发明申请

WO2013127472A1 CHANGING THE SPECTRAL POSITION OF A LIGHTPATH 审中-公开
标题翻译：改变LIGHTPATH的光谱位置
公开(公告)号：WO2013127472A1
公开(公告)日：2013-09-06
申请号：PCT/EP2012/055153
申请日：2012-03-22
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , CUGINI, Filippo , CASTOLDI, Piero , BOTTARI, Giulio , BRUNO, Gianmarco , SAMBO, Nicola , IOVANNA, Paola
发明人： CUGINI, Filippo , CASTOLDI, Piero , BOTTARI, Giulio , BRUNO, Gianmarco , SAMBO, Nicola , IOVANNA, Paola
IPC分类号： H04J14/02
CPC分类号： H04J14/0227 , H04J14/02 , H04J14/0224 , H04J14/0254 , H04J14/0257 , H04J14/026 , H04J14/0267
摘要： A method of changing the spectral position of a lightpath (11) between a source node (B) and a destination node (D) of an optical network. The optical network (2) uses a flexible grid for spectral allocation and the lightpath has been allocated first spectral resources (50) at a first spectral position. The method comprises, at the source node (B), reserving (101) additional spectral resources (51) for the lightpath which are contiguous in frequency with the first spectral resources (50). The method comprises re-tuning (105) a light source (33) at the source node (B) such that the lightpath moves in frequency from using the first spectral resources (50) at the first spectral position to using second spectral resources (54) at a second spectral position, wherein the second spectral resources comprise at least some of the additional spectral resources (51). The method comprises releasing (106) at least some of the first spectral resources (50). The source node continues to send traffic over the lightpath during the re-tuning (105).
摘要翻译：一种改变光网络的源节点（B）和目的地节点（D）之间的光路（11）的光谱位置的方法。光网络（2）使用柔性网格进行光谱分配，并且光路已经在第一光谱位置被分配了第一光谱资源（50）。该方法包括在源节点（B）处为与第一频谱资源（50）频率相邻的光路预留（101）附加频谱资源（51）。该方法包括在源节点（B）处重新调谐（105）光源（33），使得光路在频率上从使用第一光谱位置处的第一光谱资源（50）到使用第二光谱资源（54 ），其中所述第二频谱资源包括所述附加频谱资源（51）中的至少一些。该方法包括释放（106）至少一些第一光谱资源（50）。在重新调谐期间，源节点继续在光路上发送流量（105）。

9. 发明申请

WO2013026496A1 APPARATUS AND METHOD FOR A COMMUNICATION NETWORK 审中-公开
标题翻译：一种通信网络的装置和方法
公开(公告)号：WO2013026496A1
公开(公告)日：2013-02-28
申请号：PCT/EP2011/065370
申请日：2011-09-06
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , IOVANNA, Paola , ZEMA, Cristiano , UBALDI, Fabio
发明人： IOVANNA, Paola , ZEMA, Cristiano , UBALDI, Fabio
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/22 , H04L45/50 , H04L45/64
摘要： A node 800 of a multi-layer communication is capable of routing a message signal via one or more different layers (for example a PSC layer, TDM layer, LSC layer) in the multi-layer communication network. The node 800 comprises a first interface 801 for receiving a path message 803 containing routing information for routing an associated message signal through the multi-layer communication network. One or more second interfaces 805i to 805N are provided for transmitting a message signal to one or more respective layers in the multi-layer communication network. A processing unit 807 is adapted to determine if the path message 803 contains protection information 40 indicating that protection switching is to be performed in one or more different layers of the multi-layer communication network, and if so, establish a protection switching mechanism in the one or more different layers using the protection information 40 provided in the path message 803.
摘要翻译：多层通信的节点800能够经由多层通信网络中的一个或多个不同层（例如PSC层，TDM层，LSC层）路由消息信号。节点800包括第一接口801，用于接收包含用于通过多层通信网络路由相关消息信号的路由信息的路径消息803。提供一个或多个第二接口805i至805N用于将消息信号发送到多层通信网络中的一个或多个相应层。处理单元807适于确定路径消息803是否包含指示在多层通信网络的一个或多个不同层中执行保护倒换的保护信息40，如果是，则在该层中建立保护切换机制使用路径消息803中提供的保护信息40的一个或多个不同的层。

10. 发明申请

WO2011128002A1 LINK ADVERTISEMENT FOR PATH COMPUTATION IN A COMMUNICATIONS NETWORK 审中-公开
标题翻译：链接广告在通信网络中的路径计算
公开(公告)号：WO2011128002A1
公开(公告)日：2011-10-20
申请号：PCT/EP2010/067204
申请日：2010-11-10
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , IOVANNA, Paola , ZEMA, Cristiano , UBALDI, Fabio
发明人： IOVANNA, Paola , ZEMA, Cristiano , UBALDI, Fabio
IPC分类号： H04L12/56
CPC分类号： H04L47/70 , H04L45/02 , H04L45/125 , H04L45/62
摘要： A path computation element for a communications network, receives link advertisements from hybrid nodes (10) of the network and selects paths for new traffic flows based on the received link advertisements. The hybrid node has switching matrices (20, 30) operable using different protocols, and has internal links between the switching matrices. The link advertisements indicate a maximum and a minimum bandwidth on any one of the internal links for a new traffic flow. The element can select a path via the hybrid node for a new traffic flow according to the bandwidth of the requested new traffic flow and according to the maximum and the minimum bandwidth indicated by the link advertisements. Advertising the maximum and minimum bandwidths available for a single new traffic flow for the internal links can enable more efficient path computation with little additional cost and hence maintain scalability of the link advertisements for larger networks.
摘要翻译：一种用于通信网络的路径计算元件，从所述网络的混合节点（10）接收链路广告，并基于所接收的链路广告来选择用于新业务流的路径。混合节点具有可使用不同协议操作的切换矩阵（20,30），并且在切换矩阵之间具有内部链路。链路广告指示用于新业务流的任何一个内部链路上的最大和最小带宽。该元件可以根据所请求的新业务流的带宽并根据链路通告所指示的最大和最小带宽，通过混合节点为新的业务流选择路径。为内部链路的单个新流量流广告可用的最大和最小带宽可以实现更有效的路径计算，而且额外的成本更低，从而保持较大网络的链路广告的可扩展性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式