Processing

Please wait...

PATENTSCOPE will be unavailable a few hours for maintenance reason on Tuesday 25.01.2022 at 9:00 AM CET
Settings

Settings

Goto Application

1. WO2002043324 - ROUTING COSTS IN DATA NETWORKS

Publication Number WO/2002/043324
Publication Date 30.05.2002
International Application No. PCT/IB2001/002078
International Filing Date 12.11.2001
Chapter 2 Demand Filed 19.06.2002
IPC
H04L 12/18 2006.1
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12Data switching networks
02Details
16Arrangements for providing special services to substations
18for broadcast or conference
H04L 12/721 2013.1
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12Data switching networks
70Packet switching systems
701Routing or path finding
721Routing procedures, e.g. shortest path routing, source routing, link state routing or distance vector routing
H04Q 11/04 2006.1
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
QSELECTING
11Selecting arrangements for multiplex systems
04for time-division multiplexing
CPC
H04L 12/28
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
12Data switching networks
28characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
H04L 45/124
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
45Routing or path finding of packets in data switching networks
12Shortest path evaluation
124using a combination of metrics
H04Q 11/0478
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
QSELECTING
11Selecting arrangements for multiplex systems
04for time-division multiplexing
0428Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
0478Provisions for broadband connections
Applicants
  • INTERNATIONAL BUSINESS MACHINES CORPORATION [US]/[US] (AllExceptUS)
  • BAUER, Daniel [CH]/[CH] (UsOnly)
  • DAIGLE, John [US]/[US] (UsOnly)
  • ILIADIS, Ilias [GR]/[CH] (UsOnly)
  • SCOTTON, Paolo [IT]/[CH] (UsOnly)
Inventors
  • BAUER, Daniel
  • DAIGLE, John
  • ILIADIS, Ilias
  • SCOTTON, Paolo
Agents
  • WILLIAMS, Julian, David
Priority Data
00811104.921.11.2000EP
Publication Language English (en)
Filing Language English (EN)
Designated States
Title
(EN) ROUTING COSTS IN DATA NETWORKS
(FR) COUTS DANS DES RESEAUX DE DONNEES
Abstract
(EN) A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.
(FR) L'invention concerne un procédé permettant de dériver un ensemble de coûts de résolution efficaces pour un groupe de noeuds comprenant un noeud source et plusieurs noeuds de destination dans un réseau de communication de données. Les coûts de résolution pour les trajectoires entre les noeuds dans le groupe sont définis dans le réseau et chaque coût de résolution comprend un coût restrictif et un coût additif. Ce procédé consiste à identifier, de manière itérative, les trajectoires de largeur de bande supérieure puis, lorsque deux ou plusieurs trajectoires de largeur de bande égale sont rencontrées, à sélectionner la trajectoire à laquelle est associé un retard de transit inférieur.
Latest bibliographic data on file with the International Bureau