BR112014028934A2 - desempate na determinação de percurso mais curto - Google Patents

desempate na determinação de percurso mais curto

Info

Publication number
BR112014028934A2
BR112014028934A2 BR112014028934A BR112014028934A BR112014028934A2 BR 112014028934 A2 BR112014028934 A2 BR 112014028934A2 BR 112014028934 A BR112014028934 A BR 112014028934A BR 112014028934 A BR112014028934 A BR 112014028934A BR 112014028934 A2 BR112014028934 A2 BR 112014028934A2
Authority
BR
Brazil
Prior art keywords
same
cost
path
network
shorter
Prior art date
Application number
BR112014028934A
Other languages
English (en)
Inventor
Chiabaut Jerome
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 BR112014028934A2 publication Critical patent/BR112014028934A2/pt

Links

Classifications

    • 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/12—Shortest path evaluation
    • 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/20—Hop count for routing purposes, e.g. TTL
    • 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/48—Routing tree calculation

Landscapes

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

Abstract

1/1 resumo "desempate na determinação de percurso mais curto" uma decisão de desempate consistente entre percursos mais curtos de mesmo custo (menor custo) é alcançada pela comparação do conjunto ordenado de identificadores de nó para cada um dentre a pluralidade de percursos extremidade para extremidade. alternativamente, os mesmos resultados podem ser alcançados, imediatamente, à medida que uma árvore de percurso mais curto é construída, realizando uma seleção de um percurso de mesmo custo utilizando os identificadores de nó das ramificações divergentes da árvore. ambas as variantes permitem uma seleção consistente de percursos de mesmo custo, independentemente de se na rede os percursos mais curtos são calculados. isso garante que o fluxo de tráfego entre quaisquer dois nós, em ambas as direções de avanço e reversa, sigam sempre o mesmo percurso através da rede.
BR112014028934A 2012-05-22 2012-05-22 desempate na determinação de percurso mais curto BR112014028934A2 (pt)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CA2012/050337 WO2013173900A1 (en) 2012-05-22 2012-05-22 Tie-breaking in shortest path determination

Publications (1)

Publication Number Publication Date
BR112014028934A2 true BR112014028934A2 (pt) 2017-06-27

Family

ID=49622954

Family Applications (1)

Application Number Title Priority Date Filing Date
BR112014028934A BR112014028934A2 (pt) 2012-05-22 2012-05-22 desempate na determinação de percurso mais curto

Country Status (6)

Country Link
EP (1) EP2853068A1 (pt)
JP (1) JP2015520997A (pt)
KR (1) KR20150030644A (pt)
CN (1) CN104396198A (pt)
BR (1) BR112014028934A2 (pt)
WO (1) WO2013173900A1 (pt)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016049853A1 (zh) 2014-09-30 2016-04-07 华为技术有限公司 一种生成业务路径的方法和装置
CN112039772B (zh) * 2017-06-29 2024-04-09 华为技术有限公司 一种传输路径的确定方法及节点
US11165681B2 (en) * 2019-09-27 2021-11-02 Juniper Networks, Inc. Inter-autonomous system trace route message
US11451475B2 (en) 2019-12-19 2022-09-20 Huawei Technologies Co., Ltd. Packet forwarding based on geometric location
US11329717B2 (en) * 2020-05-26 2022-05-10 Huawei Technologies Co., Ltd. Packet forwarding incorporating partial sorting of path costs or utilities
US11438823B2 (en) 2020-05-29 2022-09-06 Huawei Technologies Co., Ltd. Orthodromic routing
US11374852B2 (en) 2020-05-29 2022-06-28 Huawei Technologies Co., Ltd. Piecewise shortest path first routing
US11374652B1 (en) 2020-12-10 2022-06-28 Huawei Technologies Co., Ltd. Method and apparatus for limited flooding and network routing region membership management
US11909627B2 (en) 2021-01-04 2024-02-20 Huawei Technologies Co., Ltd. Method and apparatus for managing network status information using multiple degree of precision graph
US11601780B2 (en) 2021-01-05 2023-03-07 Huawei Technologies Co., Ltd. Method and apparatus for propagating network status updates using directional tracking
US11476925B2 (en) 2021-02-04 2022-10-18 Huawei Technologies Co., Ltd. Method and apparatus for limited flooding in networks using transit nodes

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7911944B2 (en) * 2007-12-26 2011-03-22 Nortel Networks Limited Tie-breaking in shortest path determination
US8553562B2 (en) * 2010-09-08 2013-10-08 Telefonaktiebolaget L M Ericsson (Publ) Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism

Also Published As

Publication number Publication date
EP2853068A1 (en) 2015-04-01
JP2015520997A (ja) 2015-07-23
WO2013173900A1 (en) 2013-11-28
CN104396198A (zh) 2015-03-04
KR20150030644A (ko) 2015-03-20

Similar Documents

Publication Publication Date Title
BR112014028934A2 (pt) desempate na determinação de percurso mais curto
BR112015015221A2 (pt) rotear dados
BR112015032501A2 (pt) rede em malha
BRPI0921878A8 (pt) Instância de serviço aplicada a redes mpls
BR112013003489A2 (pt) Engenharia de tráfego para 802.1aq com base no emprego de utilização de link como feedback em um mecanismo de decisão
EP2582103A3 (en) Tie-breaking in shortest path determination
BR112015026342A8 (pt) balanceador de carga distribuída
EP3128438A3 (en) Table-driven routing in a dragonfly processor interconnect network
JP2014017842A5 (pt)
BR112015007738A2 (pt) contorno de balanceador de carga
PE20240516A1 (es) Acoplamiento y forma de ranura circunferencial
CO2017008027A2 (es) Adaptador de red virtual de multi-tunelización
MX2011006174A (es) Sistema y metodo para enrutamiento eficiente en una red en la presencia de restricciones de multiples bordes y otras limitaciones.
AR087083A1 (es) Reenrutamiento rapido de conmutacion de etiquetas multiprotocolo (mpls) usando el protocolo de distribucion de etiquetas (ldp-frr)
BR112015025877A2 (pt) divisão de nível de pacote para transmissão de dados através de múltiplos transportadores
PE20151107A1 (es) Abrazadera para fijacion de tubos
BR112017001254A2 (pt) propagação de reconhecimento de roteamento para redes autônomas
BR112015016624A2 (pt) laminado composto reforçado com fibra triaxial
CL2016002392A1 (es) Sistema absorbedor
BR112017009597A2 (pt) associação em redes de comunicação de linhas de visão
GB2478397A (en) A scalable flow transport and delivery network and associated methods and systems
BR112016011552A2 (pt) Redes de partições hierárquicas e paralelas
DK3660614T3 (da) Undtagelsesbaseret ruteplangenerering
EA201591572A1 (ru) Соединительный элемент для соединения труб
DK3477897T3 (da) Fremgangsmåde til routing af datapakker i en netværkstopologi

Legal Events

Date Code Title Description
B08F Application dismissed because of non-payment of annual fees [chapter 8.6 patent gazette]

Free format text: REFERENTE AS 4A E 5A ANUIDADES.

B08K Patent lapsed as no evidence of payment of the annual fee has been furnished to inpi [chapter 8.11 patent gazette]
B15K Others concerning applications: alteration of classification

Ipc: H04L 12/00 (2006.01)