BR112013020722A2 - next hop calculation functions for equal cost multipath switched packet networks - Google Patents

next hop calculation functions for equal cost multipath switched packet networks

Info

Publication number
BR112013020722A2
BR112013020722A2 BR112013020722A BR112013020722A BR112013020722A2 BR 112013020722 A2 BR112013020722 A2 BR 112013020722A2 BR 112013020722 A BR112013020722 A BR 112013020722A BR 112013020722 A BR112013020722 A BR 112013020722A BR 112013020722 A2 BR112013020722 A2 BR 112013020722A2
Authority
BR
Brazil
Prior art keywords
next hop
mapping function
equal cost
calculation functions
output
Prior art date
Application number
BR112013020722A
Other languages
Portuguese (pt)
Inventor
Jerome Chiabaut
Original Assignee
Rockstar Consortium Us Lp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Rockstar Consortium Us Lp filed Critical Rockstar Consortium Us Lp
Publication of BR112013020722A2 publication Critical patent/BR112013020722A2/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/38—Flow based routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/06—Deflection routing, e.g. hot-potato routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

funções de cálculo de próximo salto para redes de pacotes comutados de múltiplos caminhos de custos iguais funções de cálculo de próximo salto para uso em um algoritmo de determinação de caminho ecmp por nó são fornecidas, o que aumenta o espalhamento de tráfego entre recursos de rede em uma rede de pacotes comutados de múltiplos caminhos de custos iguais. em uma modalidade, pacotes são mapeados para portas de saída por fazer cada nó ecmp na rede implementar uma função de mapeamento de preservação de entropia chaveada com o material de chave único. o material de chave único permite cada nó instanciar uma função de mapeamento respectiva a partir de um protótipo de função comum de tal forma que uma dada entrada irá mapear para uma saída diferente de nós diferentes. onde um conjunto de saídas da função de mapeamento é maior do que o número de portas de saídas candidatas, uma função de compressão é utilizada para converter a saída chaveada da função de mapeamento para o conjunto candidato de portas ecmp.next hop calculation functions for equal cost multipath switched packet networks next hop calculation functions for use in a per node ecmp path determination algorithm are provided, which increases traffic spread between network resources on a multipath switched packet network of equal cost. In one embodiment, packets are mapped to outbound ports by having each ecmp node in the network implement a keyed entropy preservation mapping function with unique key material. The unique key material allows each node to instantiate a respective mapping function from a common function prototype such that a given input will map to a different output from different nodes. where a mapping function output set is greater than the number of candidate output ports, a compression function is used to convert the mapping function's switched output to the ecmp candidate set of ports.

BR112013020722A 2011-02-17 2012-02-17 next hop calculation functions for equal cost multipath switched packet networks BR112013020722A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201161443993P 2011-02-17 2011-02-17
PCT/US2012/025552 WO2012112834A2 (en) 2011-02-17 2012-02-17 Next hop computation functions for equal cost multi-path packet switching networks

Publications (1)

Publication Number Publication Date
BR112013020722A2 true BR112013020722A2 (en) 2016-10-18

Family

ID=46673189

Family Applications (1)

Application Number Title Priority Date Filing Date
BR112013020722A BR112013020722A2 (en) 2011-02-17 2012-02-17 next hop calculation functions for equal cost multipath switched packet networks

Country Status (7)

Country Link
EP (1) EP2676406A2 (en)
JP (1) JP2014509145A (en)
KR (1) KR20140059160A (en)
CN (1) CN103430494A (en)
BR (1) BR112013020722A2 (en)
CA (1) CA2820765A1 (en)
WO (1) WO2012112834A2 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015061470A1 (en) * 2013-10-23 2015-04-30 Harshavardha Paramasiviah Internet protocol routing method and associated architectures
GB201807835D0 (en) * 2018-05-15 2018-06-27 Nchain Holdings Ltd Computer-implemented system and method
US11025534B2 (en) * 2019-10-15 2021-06-01 Cisco Technology, Inc. Service-based node-centric ECMP health
CN110837650B (en) * 2019-10-25 2021-08-31 华中科技大学 Cloud storage ORAM access system and method under untrusted network environment
US11616726B2 (en) * 2020-11-24 2023-03-28 Juniper Networks, Inc. End-to-end flow monitoring in a computer network
CN113726660B (en) * 2021-08-27 2022-11-15 西安微电子技术研究所 Route finder and method based on perfect hash algorithm
CN114884868B (en) * 2022-05-10 2024-04-12 云合智网(上海)技术有限公司 Link protection method based on ECMP group
CN117792992B (en) * 2024-02-28 2024-05-07 鹏城实验室 Data transmission path control method, device, medium and equipment

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7636309B2 (en) * 2005-06-28 2009-12-22 Alcatel-Lucent Usa Inc. Multi-path routing using intra-flow splitting
CN100531134C (en) * 2006-05-17 2009-08-19 华为技术有限公司 Method, device and system for implementing multi-route transmission
US8718060B2 (en) * 2006-07-31 2014-05-06 Cisco Technology, Inc. Technique for multiple path forwarding of label-switched data traffic
US8565239B2 (en) * 2009-07-14 2013-10-22 Broadcom Corporation Node based path selection randomization

Also Published As

Publication number Publication date
EP2676406A2 (en) 2013-12-25
KR20140059160A (en) 2014-05-15
WO2012112834A2 (en) 2012-08-23
CN103430494A (en) 2013-12-04
CA2820765A1 (en) 2012-08-23
WO2012112834A3 (en) 2013-02-21
JP2014509145A (en) 2014-04-10
WO2012112834A4 (en) 2013-04-11

Similar Documents

Publication Publication Date Title
BR112013020722A2 (en) next hop calculation functions for equal cost multipath switched packet networks
WO2015120539A8 (en) Method to route packets in a distributed direct interconnect network
BR112018013313A2 (en) multipath transport project
GB2525823A (en) Source routing with fabric switches in an ethernet fabric network
CL2018000951A1 (en) Method for adaptively and jointly managing the routing policy and the retransmission policy of a node in an underwater network, and means for its implementation.
JP2015517762A5 (en)
WO2015048239A3 (en) Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
JP2015520995A5 (en)
BR112015025877A2 (en) packet level division for data transmission across multiple carriers
GB2557767B (en) Dynamically defined virtual private network tunnels in hybrid cloud environments
BR112017005542A2 (en) load balancing in a wireless network with multiple access points
AR087500A1 (en) STORAGE AND ALLOCATION OF CONTROL TIMING CONFIGURATIONS IN A MULTIPLE CELLULAR COMMUNICATIONS NETWORK
BR112015026342A8 (en) distributed load balancer
BR112015015221A2 (en) route data
WO2012154780A3 (en) Independent secure element management
RU2015133461A (en) METHOD AND DEVICE FOR DIVISION OF LOAD
DE502007002506D1 (en) METHOD AND NETWORK NODES FOR ROUTING DATA PACKS IN COMMUNICATION NETWORKS
CL2019001484A1 (en) Network node and method in it to configure pdcp for a wireless device.
TW201613416A (en) Node-to-multinode communication
AR104151A1 (en) CONTROLLER, CONTROL METHOD AND PROGRAM
WO2016190927A3 (en) Multi-mode system on a chip
WO2015020932A3 (en) Network depth limited network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks
BR112015001501A2 (en) client emulation communication ports for communication network migration
US20150222532A1 (en) Consistent Hashing Using Exact Matching with Application to Hardware Load Balancing
PL404986A1 (en) Device for routing of packets through multiple paths in the data communication system and method of its application

Legal Events

Date Code Title Description
B08F Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]
B08K Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]