GB2440461B - A method of determining a shortest path in a network - Google Patents

A method of determining a shortest path in a network

Info

Publication number
GB2440461B
GB2440461B GB0719578A GB0719578A GB2440461B GB 2440461 B GB2440461 B GB 2440461B GB 0719578 A GB0719578 A GB 0719578A GB 0719578 A GB0719578 A GB 0719578A GB 2440461 B GB2440461 B GB 2440461B
Authority
GB
United Kingdom
Prior art keywords
network
determining
shortest path
shortest
path
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Fee Related
Application number
GB0719578A
Other versions
GB0719578D0 (en
GB2440461A (en
Inventor
Andrew Reeve
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Roke Manor Research Ltd
Original Assignee
Roke Manor Research Ltd
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
Priority claimed from GBGB0519648.0A external-priority patent/GB0519648D0/en
Application filed by Roke Manor Research Ltd filed Critical Roke Manor Research Ltd
Priority to GB0719578A priority Critical patent/GB2440461B/en
Publication of GB0719578D0 publication Critical patent/GB0719578D0/en
Publication of GB2440461A publication Critical patent/GB2440461A/en
Application granted granted Critical
Publication of GB2440461B publication Critical patent/GB2440461B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/74—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for increasing reliability, e.g. using redundant or spare channels or apparatus
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/74—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for increasing reliability, e.g. using redundant or spare channels or apparatus
    • H04B1/745—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for increasing reliability, e.g. using redundant or spare channels or apparatus using by-passing or self-healing methods
    • 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
    • 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
    • H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • 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/22—Alternate 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/28—Routing or path finding of packets in data switching networks using route fault recovery
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
GB0719578A 2005-09-27 2006-09-11 A method of determining a shortest path in a network Expired - Fee Related GB2440461B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB0719578A GB2440461B (en) 2005-09-27 2006-09-11 A method of determining a shortest path in a network

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
GBGB0519648.0A GB0519648D0 (en) 2005-09-27 2005-09-27 Resilient path protocol
GB0719578A GB2440461B (en) 2005-09-27 2006-09-11 A method of determining a shortest path in a network
GB0617780A GB2432494B (en) 2005-09-27 2006-09-11 Resilient network

Publications (3)

Publication Number Publication Date
GB0719578D0 GB0719578D0 (en) 2007-11-21
GB2440461A GB2440461A (en) 2008-01-30
GB2440461B true GB2440461B (en) 2008-07-16

Family

ID=39540651

Family Applications (1)

Application Number Title Priority Date Filing Date
GB0719578A Expired - Fee Related GB2440461B (en) 2005-09-27 2006-09-11 A method of determining a shortest path in a network

Country Status (1)

Country Link
GB (1) GB2440461B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220015006A1 (en) * 2018-11-27 2022-01-13 Telefonaktiebolaget Lm Ericsson (Publ) Methods for Multi-Lane Discovery with Partially Disjoint Paths

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020065936A1 (en) * 2000-07-10 2002-05-30 International Business Machines Corporation Multi-platform application
US20040246901A1 (en) * 2003-06-03 2004-12-09 Palo Alto Research Center, Incorporated Time-aware strategy for message-initiated constraint-based routing
US20040258064A1 (en) * 2003-05-16 2004-12-23 Oki Electric Industry Co., Ltd. Communication terminal and communication network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020065936A1 (en) * 2000-07-10 2002-05-30 International Business Machines Corporation Multi-platform application
US20040258064A1 (en) * 2003-05-16 2004-12-23 Oki Electric Industry Co., Ltd. Communication terminal and communication network
US20040246901A1 (en) * 2003-06-03 2004-12-09 Palo Alto Research Center, Incorporated Time-aware strategy for message-initiated constraint-based routing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Proc. 1st Internat. Symposium on Wireless Communication Systems, 20-22 Sep 2004, Mauritius, pub. IEEE, US, ISBN 0-7803-8472-5, pp.215-219, Chao et al, "Least-hop routing analysis of on-demand routing protocols" *

Also Published As

Publication number Publication date
GB0719578D0 (en) 2007-11-21
GB2440461A (en) 2008-01-30

Similar Documents

Publication Publication Date Title
EP1880512A4 (en) Optimal path routing method in wireless network
GB2455932B (en) Formation evaluation method
GB2430261B (en) Acoustic flowmeter calibration method
EP1869828A4 (en) Network element architecture for deep packet inspection
GB0501131D0 (en) A method of operating a node in a network
GB0505633D0 (en) Network optimisation
EP1844563A4 (en) Inter-domain path computation technique
EP1932082A4 (en) Network routing
GB0604746D0 (en) A method of optimizing routing of demands in a network
EP1864785A4 (en) Seterolithography method
HK1116471A1 (en) Continuous method for making chlorhydrines
GB0507887D0 (en) Immersion method
GB2428533B (en) Determining data flows in a network
GB2445068B (en) Method for determining genotoxicity
GB0416952D0 (en) Scale making method
HUE043508T2 (en) Method for determining network parameters
EP2085764A4 (en) Method for determining agglutination
PL1781061T3 (en) Method for communication of several sensor nodes in a sensor network
EP1735492A4 (en) Method for cleaning
PL1780516T3 (en) Method for creating a sensor network
FI20051312A0 (en) Quality Evaluation Method
GB2440461B (en) A method of determining a shortest path in a network
GB0413950D0 (en) Sanitizing method
EP1965530A4 (en) A method for soft rerouting in optical network
GB0524234D0 (en) Cleaning method

Legal Events

Date Code Title Description
PCNP Patent ceased through non-payment of renewal fee

Effective date: 20140911