WO2004001621A3 - Fibonacci heap for use with internet routing protocols - Google Patents

Fibonacci heap for use with internet routing protocols Download PDF

Info

Publication number
WO2004001621A3
WO2004001621A3 PCT/US2003/019674 US0319674W WO2004001621A3 WO 2004001621 A3 WO2004001621 A3 WO 2004001621A3 US 0319674 W US0319674 W US 0319674W WO 2004001621 A3 WO2004001621 A3 WO 2004001621A3
Authority
WO
WIPO (PCT)
Prior art keywords
candidate list
processing
link
djkstra
nodes
Prior art date
Application number
PCT/US2003/019674
Other languages
French (fr)
Other versions
WO2004001621A2 (en
Inventor
Nicholas Amato
Original Assignee
Nexthop Technologies Inc
Nicholas Amato
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 Nexthop Technologies Inc, Nicholas Amato filed Critical Nexthop Technologies Inc
Priority to JP2004516101A priority Critical patent/JP2005531222A/en
Priority to EP03761232A priority patent/EP1535184A2/en
Priority to AU2003243721A priority patent/AU2003243721A1/en
Priority to US10/506,596 priority patent/US7343424B2/en
Publication of WO2004001621A2 publication Critical patent/WO2004001621A2/en
Publication of WO2004001621A3 publication Critical patent/WO2004001621A3/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/12—Shortest path evaluation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • 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/14—Routing performance; Theoretical aspects

Abstract

In accordance with an aspect of the invention, one or more shortest paths is determined through a portion of a computer network, from a source vertex to one or more destination vertices according to a link-state protocol. A graph representation of the network portion is processed. The graph representation includes nodes and edges representing the vertices and connections therebetween. The processing includes operating on the graph representation according to a Djkstra-like algorithm. A subset of the Djkstra-like algorithm processing includes candidate list processing, to maintain and operate upon a candidate list (OSPF, IS-IS) of nodes that have been visited in the Djkstra-like algorithm processing. Finally, the candidate list processing is optimized relative to standard Djkstra algorithm processing for the link-state protocol. The optimized candidate list processing may be, for example, such that the candidate list processing operates on a candidate list of nodes that is stored in a generic format, as a Fibonacci heap of Fibonacci nodes in a generic format that is independent of the link-state protocol. Furthermore, the candidate list processing may be accessible via a generic application programming interface (API). As a result, the candidate list processing is useable for various link-state protocols, including various link-state routing protocols such as OSPF and IS-IS.
PCT/US2003/019674 2002-06-21 2003-06-20 Fibonacci heap for use with internet routing protocols WO2004001621A2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP2004516101A JP2005531222A (en) 2002-06-21 2003-06-20 Fibonacci heap for using internet routing protocol
EP03761232A EP1535184A2 (en) 2002-06-21 2003-06-20 Fibonacci heap for use with internet routing protocols
AU2003243721A AU2003243721A1 (en) 2002-06-21 2003-06-20 Fibonacci heap for use with internet routing protocols
US10/506,596 US7343424B2 (en) 2002-06-21 2003-06-20 Fibonacci heap for use with internet routing protocols

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US39057602P 2002-06-21 2002-06-21
US60/390,576 2002-06-21

Publications (2)

Publication Number Publication Date
WO2004001621A2 WO2004001621A2 (en) 2003-12-31
WO2004001621A3 true WO2004001621A3 (en) 2004-02-12

Family

ID=30000573

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/019674 WO2004001621A2 (en) 2002-06-21 2003-06-20 Fibonacci heap for use with internet routing protocols

Country Status (6)

Country Link
US (1) US7343424B2 (en)
EP (1) EP1535184A2 (en)
JP (1) JP2005531222A (en)
KR (1) KR20050040868A (en)
AU (1) AU2003243721A1 (en)
WO (1) WO2004001621A2 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7468952B2 (en) * 2005-11-29 2008-12-23 Sony Computer Entertainment Inc. Broadcast messaging in peer to peer overlay network
US7696908B2 (en) * 2006-01-04 2010-04-13 Hitachi Global Storage Technologies Netherlands, B.V. Techniques for reducing error propagation using modulation codes having a variable span
US7593341B1 (en) * 2006-06-08 2009-09-22 At&T Corp. Method and apparatus for updating a shortest path graph
JP4820781B2 (en) * 2007-06-26 2011-11-24 Ｋｄｄｉ株式会社 Route management apparatus and computer program
US8159944B2 (en) 2008-12-24 2012-04-17 At&T Intellectual Property I, L.P. Time based queuing
US20110238493A1 (en) * 2010-03-29 2011-09-29 Yahoo! Inc. Efficient ad selection in ad exchange with intermediaries
CN103763199B (en) * 2014-01-10 2017-03-15 杭州华三通信技术有限公司 A kind of link-state information treating method and apparatus

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020141345A1 (en) * 2001-01-30 2002-10-03 Balazs Szviatovszki Path determination in a data network
US20030043756A1 (en) * 2001-08-20 2003-03-06 Sun Microsystems, Inc. System and method for deadlock-free routing on arbitrary network topologies
US20030172180A1 (en) * 2001-10-19 2003-09-11 Sun Microsystems, Inc. Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69127198T2 (en) * 1991-10-14 1998-02-12 Ibm Routing of messages in a network consisting of local network segments connected by bridges
US6098107A (en) * 1997-10-31 2000-08-01 Lucent Technologies Inc. Dynamic algorithms for shortest path tree computation
US6477515B1 (en) * 1999-08-11 2002-11-05 The United States Of America As Represented By The Secretary Of The Navy Efficient computation of least cost paths with hard constraints
US6836463B2 (en) * 1999-10-15 2004-12-28 Nokia Corporation System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
WO2001058237A2 (en) * 2000-02-12 2001-08-16 Hrl Laboratories, Llc Scalable unidirectional routing for mobile ad-hoc networks
JP3501093B2 (en) * 2000-04-18 2004-02-23 日本電気株式会社 QoS path calculator
US6996065B2 (en) * 2000-07-06 2006-02-07 Lucent Technologies Inc. Dynamic backup routing of network tunnel paths for local restoration in a packet network
US20020141346A1 (en) * 2000-08-31 2002-10-03 The Regents Of The University Of California Method for approximating minimum delay routing
US7203191B2 (en) * 2000-10-10 2007-04-10 The Regents Of The University Of California Method for loop-free multipath routing using predecessor information
US20030026268A1 (en) * 2000-11-28 2003-02-06 Siemens Technology-To-Business Center, Llc Characteristic routing
US7158486B2 (en) * 2001-03-12 2007-01-02 Opcoast Llc Method and system for fast computation of routes under multiple network states with communication continuation
US7035937B2 (en) * 2001-04-25 2006-04-25 Cornell Research Foundation, Inc. Independent-tree ad hoc multicast routing
US7209449B2 (en) * 2002-03-27 2007-04-24 Intel Corporation Systems and methods for updating routing and forwarding information
US7304955B2 (en) * 2002-03-28 2007-12-04 Motorola, Inc. Scalable IP multicast with efficient forwarding cache
US7062743B2 (en) * 2002-09-24 2006-06-13 The Regents Of The University Of California Floorplan evaluation, global routing, and buffer insertion for integrated circuits

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020141345A1 (en) * 2001-01-30 2002-10-03 Balazs Szviatovszki Path determination in a data network
US20030043756A1 (en) * 2001-08-20 2003-03-06 Sun Microsystems, Inc. System and method for deadlock-free routing on arbitrary network topologies
US20030172180A1 (en) * 2001-10-19 2003-09-11 Sun Microsystems, Inc. Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies

Also Published As

Publication number Publication date
KR20050040868A (en) 2005-05-03
US20050108424A1 (en) 2005-05-19
WO2004001621A2 (en) 2003-12-31
EP1535184A2 (en) 2005-06-01
AU2003243721A1 (en) 2004-01-06
JP2005531222A (en) 2005-10-13
US7343424B2 (en) 2008-03-11

Similar Documents

Publication Publication Date Title
WO2007140165A3 (en) Selecting routes through a network
JP2002530011A5 (en)
AU2003260592A1 (en) Method, terminal and server for selecting a server address
TW200711385A (en) Access node selection in a network
WO2005103931A3 (en) Method, system and graphical user interface for dynamically updating transmission characteristics in a web mail reply
WO2007001679A3 (en) Secure and stable hosting of third-party extensions to web services
WO2004062227A3 (en) Multi-factor application selection
WO2002065278A3 (en) A presentation server which enables a client device to run a network based application
US10021071B2 (en) Detector tree for detecting rule anomalies in a firewall policy
JP2015159486A (en) relay node and route control method
WO2015101113A1 (en) Packet processing method and device
WO2004001621A3 (en) Fibonacci heap for use with internet routing protocols
EP3616369B1 (en) Communications network node, communications network and communication method
WO2007030305A3 (en) Data communication with remote network node
CN101764728B (en) Network topology discovering method and equipment
JPWO2004045164A1 (en) Data relay apparatus, method for determining transmission destination of acquired request, and program for realizing the same in computer
JP5601067B2 (en) Relay device
HUP0401180A2 (en) Data communication network, method for operating said network, network terminal, and computer program for this
JP4936544B2 (en) Network design method, design apparatus and program thereof
EP3214806B1 (en) Network control device and network information management method
JP4462159B2 (en) Telephone equipment
Bagnulo Default Locator-pair selection algorithm for the Shim6 protocol
JP6579025B2 (en) Packet relay device, packet relay control device, packet relay system, and packet relay method
JP5292988B2 (en) Program, information processing apparatus and information processing system
JP2008079098A (en) Method and program for controlling communication path between terminals, and communication terminal

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 10506596

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2004516101

Country of ref document: JP

Ref document number: 1020047020879

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 2003761232

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020047020879

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 2003761232

Country of ref document: EP