EP0348327A2 - Verfahren zur Auswahl eines optimalen Weges zwischen Knoten in einem Datenkommunikationsnetz - Google Patents

Verfahren zur Auswahl eines optimalen Weges zwischen Knoten in einem Datenkommunikationsnetz Download PDF

Info

Publication number
EP0348327A2
EP0348327A2 EP89480076A EP89480076A EP0348327A2 EP 0348327 A2 EP0348327 A2 EP 0348327A2 EP 89480076 A EP89480076 A EP 89480076A EP 89480076 A EP89480076 A EP 89480076A EP 0348327 A2 EP0348327 A2 EP 0348327A2
Authority
EP
European Patent Office
Prior art keywords
nodes
network
end node
node
route
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.)
Granted
Application number
EP89480076A
Other languages
English (en)
French (fr)
Other versions
EP0348327B1 (de
EP0348327A3 (de
Inventor
Alan Edward Baratz
Kathryn E. Clarke
Melinda Ross Pollard
Diane Phylis Pozefsky
Lee Mark Rafalow
William Edward Siddell
James Peyton Gray
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.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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 International Business Machines Corp filed Critical International Business Machines Corp
Publication of EP0348327A2 publication Critical patent/EP0348327A2/de
Publication of EP0348327A3 publication Critical patent/EP0348327A3/de
Application granted granted Critical
Publication of EP0348327B1 publication Critical patent/EP0348327B1/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H04Q3/665—Circuit arrangements therefor
    • 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
    • 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/44—Distributed routing

Definitions

  • the present invention relates to communications networks and more particularly to a method of determining an opti­mal or least weight route between two end nodes in a data communications network.
  • a communica­tions network can be generally defined as a collection of network nodes and end nodes interconnected through commu­nications links.
  • a network node can be characterized as a data processing system that provides certain functions within the network, such as routing of messages between itself and its adjacent or neighboring nodes, selection of routes for messages to be transmitted between two nodes and the furnishing of directory services to connected end nodes.
  • the link between nodes may be permanent communica­tions links such as conventional cable connections or links that are enabled only when needed, such as dial-up telephone connections.
  • End nodes are exemplified by devices such as display terminals, intelligent worksta­tions, printers and the like which do not provide routing or route selection or directory services to other nodes in the network.
  • Collectively, the network nodes, the end nodes and the links between the nodes are referred to as network resources.
  • the physical configuration and charac­teristics of the various nodes and links in a network are said to be the topology of the network.
  • a path or route must be set up through the network.
  • the route will include the end node at which the first user is located (the origin end node), the end node at which the second user is located (the destination end node), possibly one or more network nodes and the links or transmission groups which connect the nodes on the route.
  • a transmission group is normally defined as a set of parallel links with similar character­istics that form a single logical link that has a higher capacity than each of the individual links in the group. For purposes of the following discussion, it should be assumed that the term transmission group can also contem­plate a single physical link. The terms are used inter changeably in the following description.
  • weights generally reflects how closely a given node or transmission group meets a predetermined standard of performance. For example, if weights were to be assigned on the basis of delay characteristics alone, a high-delay transmission group would have a greater as signed weight than a low-delay transmission group.
  • the weight of nodes and transmission groups in various potential routes are summed.
  • the route having the lowest total weight which is understandably referred to as the least-weight route, is considered to be the "best" route between the users.
  • weights are assigned to nodes and transmission groups and the algorithms that compute opti­mal routes based on those weights are not essential to an understanding of the invention and are not described in other than general terms.
  • route computation is performed at a network node.
  • the network node must have access to the characteristics or weights of the various nodes and trans­mission groups in the network. This information takes the form of a topology database stored at the node.
  • the number of network nodes is considerably less than the number of end nodes connected to those network nodes. If the topology database must include information about the end nodes and the transmission groups which connect those end nodes to the network nodes, the database will necessarily be larger and more complex than if the database were to include information only about the network nodes and the transmis­sion groups interconnecting the network nodes.
  • the present invention is a method for allowing a network node to calculate an optimal end node to end node route through a network when the network topology database maintained at the network nodes contains only information about network nodes and transmission groups interconnecting those nodes.
  • a first user requests that a path be established through the network to a second user
  • information as to the characteristics of the transmission groups connecting both users' end nodes to network nodes is furnished by the users' end nodes to the network node responsible for the route computation.
  • This network node calculates an opti­mal route through the network in a staged process.
  • the information received from the end nodes is used to calculate optimal routes from the end nodes to all network nodes to which those end nodes are connected.
  • the network node uses information stored in its own network topology database to calculate optimal routes from a first set of network nodes to a second set of network nodes.
  • the first set of network nodes is all network nodes con­nected to the first user's end node.
  • the second set of network nodes is all network nodes connected to the second user's end node.
  • the results of the end node-to-network node calculations and network node to network node calcu­lations are combined to determine the optimal end node to end node route through the network.
  • each network node since each network node stores its own copy of the database and updates that database by sending and receiving topology database messages to every network node to which it is connected, storing end node transmission group information in the topology database would significantly increase the amount of information that must be included in topology database update messages broadcast through the network.
  • the illustrated network includes a plurality of network nodes NNA, NNB, NNC, NND, NNE and NNF.
  • the various network nodes are interconnected by transmission groups illustrated only as single lines.
  • a number of end nodes EN1 through EN10 are connected to various ones of the network nodes.
  • Certain end nodes may be connected to more than one network node and/or may have parallel transmission groups to the same network node.
  • end node EN2 is connected to both network node NNA and NNB with two parallel transmission groups to network node NNB.
  • end node EN6 is connected to both network nodes NND and NNF with three parallel trans mission groups to node NNF.
  • weights are assigned to each transmis­sion group and network node in the network. These weights represent the "cost" of using the node or trans­mission group to transmit data. In the figure, the weights are represented by numerals either appearing within the symbol for the network node or adjacent the line representing the transmission group connecting the network nodes.
  • the weight values themselves appearing in the figure are arbitrarily selected for purposes of illustration and should not be interpreted as actual numerical values that would be assigned in a typical data communications net work.
  • the figure also shows weights assigned to transmis­sion groups connecting end nodes to their adjacent network nodes. While the weights assigned to the end node trans­mission groups are known to the end nodes, they may not be known to the network nodes if the network nodes maintain a topology database containing only information about the network nodes themselves and the transmission groups which interconnect the network nodes. While the information stored in the network nodes is adequate to allow the network nodes to compute optimal routes between any two network nodes, it is not adequate to permit a network node to compute an optimal route between two end nodes.
  • the transmission group vectors are saved at NNB and the message is forwarded through the network via nodes NNC and NNF to end node EN6.
  • End node EN6 responds with a message unit reply (MUR) including information about the transmission groups which connect end node EN6 to its two adjacent network nodes, NND and NNF.
  • MUR message unit reply
  • the reply is forwarded through the network to the serving network node NNB, which saves the destination transmission group vectors.
  • Network node B then has the information it needs to com­pute an optimal route through the network between the origin end node EN2 and the destination end node EN6.
  • the computations are staged with the optimal end node-to-network node routes being computed separately from the routes between network nodes.
  • Figure 3 is a flow chart of operations performed. In the discus­sion of this figure and elsewhere in this description, it is assumed that only transmission groups suitable for the prospective data exchange (that is, those with the proper class of service) are involved in the computations.
  • the serving network node retrieves the vectors for the origin end point transmission groups which, in the network shown in the figure, consists of the pair of parallel transmission groups connecting origin end node EN2 to network node NNB and the single transmission group connecting origin end node EN2 to network node NNA.
  • the retrieved vectors are used in operation 32 to estab­lish the weight of all routes between the origin end node and the network nodes to which that end node is connected.
  • routes with infinite weights (unusable routes) are eliminated.
  • a check 36 is made to determine whether there are any parallel transmission groups from the origin end node to one of the network nodes. If there are, all but the best or least weight of the parallel groups are eliminated in an operation 38. As a result, one optimal route is computed from the origin end node to each network node to which that end node is connected via a finite weight transmission group.
  • the optimal routes, including their weights, are stored for later use in an operation 40.
  • a check 42 is then made to determine whether the described process has been completed for the transmission groups connecting the destination end node EN6 to its adjacent network nodes. If necessary, the vectors of the transmis­sion groups connecting the destination end node and adja­cent network nodes are retrieved in an operation 44 and the computation process including operation 32, 34, 36, 38 and 40 is repeated to determine the optimal route from the destination end node to each network node to which that end node is connected.
  • the serving network node builds a first list of network nodes (operation 46). This first list consists of all network nodes connected to the origin end node.
  • the serving network also builds a second list of network nodes in an operation 48.
  • the second list consists of all network nodes connected to the destination end node.
  • the weight of every potential route from the network nodes on the first list to the network nodes on the second list is computed in an operation 50.
  • the algorithms employed to compute the route weights may be conventional in nature. If desired, the results of the route computations can be cached or stored at the serving network node in an opera­ tion 52. The cached results would remain available for use in future route computations.
  • the serving network node has computed an optimal route from the origin end node to every network node to which it is connected, an optimal route from the destination end node to every network node to which it is connected and optimal routes from every network node connected to the origin end node to every network node connected to the destination end node.
  • the results of the separate computations are combined in an operation 54.
  • the least weight route resulting from the concatenation is chosen in an operation 56 as the optimal end node-to-end node route through the network.
  • a check 58 must be made for the presence of such a connection. If such a direct connection is found, the weight assigned to the direct connection is compared to the weight of the optimal route through the network in an operation 60. If the direct connection has a lower weight than the network route, the direct connection is selected in an operation 62. However, if there is no direct connection or if the weight assigned to an existing direct connection is greater than the computed weight for the route through the network, the network route is chosen in an operation 64.
  • Figure 4 is a table illustrating the results of route computations within the network.
  • the function of these computations is to select an optimal route from every network node connected to the origin end node to every network node connected to the destination end node. Since there are two network nodes, NNA and NNB, connected to the origin end node EN2 and two network nodes, NND and NNF, connected to the destination end node EN6, there will necessarily be four optimal routes within the network connecting these four network nodes.
  • the optimal routes are computed simply by summing the weights assigned to the nodes and transmission groups on each possible route. For example, the weight assigned to a potential route includ­ing network nodes NNA, NNB and NND is assigned a weight equal to the sum of the weights of these three nodes plus the weights assigned to the transmission groups connecting these three nodes.
  • the potential routes through the network are grouped according to the origin network node and the destination network node. It will be seen that there are three poten­tial routes in the first group; that is, the group having origin network node NNA and destination network node NND.
  • the calculated weights assigned to each of the potential routes is shown in Figure 4. Figure 4 also shows that the least weight route in each of these groups is selected for use in computation of a final end node-to-end node least weight route.
  • the selected routes in each of the four groups appears in the table shown in Figure 5.
  • the weight of the optimal route between the origin end node and each of its network nodes is combined with the weight of the selected routes within the network. For example, the weight of the optimal route from origin end node EN2 to potential origin network node NNA and the weight of the optimal route from destination end node EN6 to network node NND is added to the weight of the optimal route between network nodes NNA and NND. For the weights illustrated, the total weight of this route would have a value of 19.
  • Figure 5 shows that the least weight route through the network is formed over a path including the single transmission group between EN6 and network node NND, the network node NND itself, the transmission group between network node NND and network node NNB and the lower weighted of transmission groups connecting network node NNB to end node EN2.
  • the serving network node can discard the vectors for the end node transmission groups or allow those vectors to be over written when the next route computation is performed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
EP89480076A 1988-06-23 1989-05-23 Verfahren zur Auswahl eines optimalen Weges zwischen Knoten in einem Datenkommunikationsnetz Expired - Lifetime EP0348327B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US210273 1988-06-23
US07/210,273 US4873517A (en) 1988-06-23 1988-06-23 Method for selecting least weight end node to end node route in a data communications network

Publications (3)

Publication Number Publication Date
EP0348327A2 true EP0348327A2 (de) 1989-12-27
EP0348327A3 EP0348327A3 (de) 1992-03-11
EP0348327B1 EP0348327B1 (de) 1995-07-19

Family

ID=22782268

Family Applications (1)

Application Number Title Priority Date Filing Date
EP89480076A Expired - Lifetime EP0348327B1 (de) 1988-06-23 1989-05-23 Verfahren zur Auswahl eines optimalen Weges zwischen Knoten in einem Datenkommunikationsnetz

Country Status (4)

Country Link
US (1) US4873517A (de)
EP (1) EP0348327B1 (de)
JP (1) JPH0693680B2 (de)
DE (1) DE68923489T2 (de)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0595751A2 (de) * 1992-10-30 1994-05-04 International Business Machines Corporation Verfahren zur Leitweglenkung von elektronischen Nachrichten
EP0653135A1 (de) * 1992-07-27 1995-05-17 Codex Corporation System und verfahren für ruf-zu-ruf leitweglenkung mit auf regeln basierter rücklenkung
WO1995018498A1 (en) * 1993-12-24 1995-07-06 International Business Machines Corporation Routing bandwidth-reserved connections in information networks
WO1995035612A2 (en) * 1994-06-13 1995-12-28 Philips Electronics N.V. Communication network

Families Citing this family (86)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT1219759B (it) * 1988-05-24 1990-05-24 Cselt Centro Studi Lab Telecom Procedimento di instradamento per sistemi a commutazione veloce di pacchetto
JP2865675B2 (ja) * 1988-09-12 1999-03-08 株式会社日立製作所 通信ネットワーク制御方法
US4979118A (en) * 1989-03-10 1990-12-18 Gte Laboratories Incorporated Predictive access-control and routing system for integrated services telecommunication networks
DE69025846T2 (de) * 1989-10-13 1996-09-26 Ibm Verfahren zur Verwendung gespeicherter partieller Bäume zur Berechnung eines Weges in einem Datenkommunikationsnetz
US5068892A (en) * 1989-10-31 1991-11-26 At&T Bell Laboratories Route based network management
US5014262A (en) * 1990-01-02 1991-05-07 At&T Bell Laboratories Apparatus and method for detecting and eliminating call looping in a node-by-node routing network
US5138614A (en) * 1990-04-12 1992-08-11 At&T Bell Laboratories Transformation method for network conference connections
US5410691A (en) * 1990-05-07 1995-04-25 Next Computer, Inc. Method and apparatus for providing a network configuration database
JP2875598B2 (ja) * 1990-06-27 1999-03-31 富士通株式会社 ノードにおけるネットワーク経路設定方式
US5173933A (en) * 1990-09-25 1992-12-22 World Communication Systems, Inc. Interface between mobile telecommunication stations and trunks that link to communication carriers
US5654695A (en) * 1991-02-22 1997-08-05 International Business Machines Corporation Multi-function network
US5495474A (en) * 1991-03-29 1996-02-27 International Business Machines Corp. Switch-based microchannel planar apparatus
US5561790A (en) * 1992-03-24 1996-10-01 International Business Machines Corporation Shortest path determination processes for use in modeling systems and communications networks
DE4209906C1 (de) * 1992-03-26 1993-10-21 Siemens Ag Verfahren zur Leitweglenkung von Fernmeldeverbindungen in einem vermaschten Netz
FR2690297B1 (fr) * 1992-04-17 1994-06-10 Lebourges Marc Acheminement de communications a optimisation de revenue pour reseaux de telecommunications.
US5583928A (en) * 1992-06-19 1996-12-10 British Telecommunications Public Limited Company Detecting local exchange failure and resultant control of a communications network
US5398012A (en) * 1992-11-24 1995-03-14 International Business Machines Corporation Distributed processing of route selection across networks and subnetworks
US5444773A (en) * 1993-06-30 1995-08-22 Harris Corporation Method for releasing unnecessary trucks from a telephone call
US5485455A (en) * 1994-01-28 1996-01-16 Cabletron Systems, Inc. Network having secure fast packet switching and guaranteed quality of service
US5418779A (en) * 1994-03-16 1995-05-23 The Trustee Of Columbia University Of New York High-speed switched network architecture
US6185619B1 (en) 1996-12-09 2001-02-06 Genuity Inc. Method and apparatus for balancing the process load on network servers according to network and serve based policies
US5535195A (en) * 1994-05-06 1996-07-09 Motorola, Inc. Method for efficient aggregation of link metrics
US5694546A (en) 1994-05-31 1997-12-02 Reisman; Richard R. System for automatic unattended electronic information transport between a server and a client by a vendor provided transport software with a manifest list
DE4445800C1 (de) * 1994-12-21 1996-07-04 Siemens Ag Verfahren zum Bilden von für die nachfolgende Vermittlung von Verkehrsbeziehungen vorgesehenen Routinginformationen in einem Kommunikationsnetz
US5563878A (en) * 1995-01-05 1996-10-08 International Business Machines Corporation Transaction message routing in digital communication networks
US5627971A (en) * 1995-06-01 1997-05-06 Northern Telecom Limited Machine method for determining the eligibility of links in a network
US5590119A (en) * 1995-08-28 1996-12-31 Mci Communications Corporation Deterministic selection of an optimal restoration route in a telecommunications network
JP2982666B2 (ja) * 1995-10-05 1999-11-29 日本電気株式会社 局間の端末接続方法とその装置
JP3451415B2 (ja) * 1996-03-29 2003-09-29 富士通株式会社 ネットワーク管理システムのデータベース同期方法
US5881246A (en) * 1996-06-12 1999-03-09 Bay Networks, Inc. System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router
US6412017B1 (en) * 1996-07-01 2002-06-25 Microsoft Corporation Urgent replication facility
GB9616801D0 (en) * 1996-08-09 1996-09-25 Madge Networks Ltd Data communication network
GB9617907D0 (en) 1996-08-28 1996-10-09 British Telecomm Communications network
US6078946A (en) * 1996-09-10 2000-06-20 First World Communications, Inc. System and method for management of connection oriented networks
US5892451A (en) * 1996-10-09 1999-04-06 Hewlett-Packard Company Remote management of computing devices
US6016307A (en) 1996-10-31 2000-01-18 Connect One, Inc. Multi-protocol telecommunications routing optimization
US6252856B1 (en) * 1996-12-03 2001-06-26 Nortel Networks Limited Method and apparatus for minimizing calculations required to construct multicast trees
US5901352A (en) * 1997-02-20 1999-05-04 St-Pierre; Sylvain System for controlling multiple networks and associated services
US6003090A (en) * 1997-04-23 1999-12-14 Cabletron Systems, Inc. System for determining network connection availability between source and destination devices for specified time period
US6097727A (en) * 1997-04-29 2000-08-01 International Business Machines Corporation Methods, systems and computer program products for end-to-end route selection in compound wide/local area networks
US6236642B1 (en) * 1997-07-17 2001-05-22 Siemens Information And Communication Networks, Inc. Apparatus and method for network resource preservation
DE19743361C2 (de) * 1997-09-30 2001-02-01 Siemens Ag Verfahren zur Leitwegsuche in Telekommunikationsnetzen
US6618471B1 (en) * 1998-10-01 2003-09-09 Qwest Communications International Inc. Method and system for measuring usage of advanced intelligent network services
US6185612B1 (en) 1998-10-29 2001-02-06 Novell, Inc. Secure distribution and use of weighted network topology information
US6321238B1 (en) 1998-12-28 2001-11-20 Oracle Corporation Hybrid shared nothing/shared disk database system
JP3336614B2 (ja) * 1999-10-14 2002-10-21 日本電気株式会社 木構造通信路の設計方法、及び、通信路の木構造解
JP2001352342A (ja) * 2000-06-07 2001-12-21 Fujitsu Ltd ネットワーク管理方法及びネットワークノード装置並びにメッシュ型ネットワーク
US7162499B2 (en) * 2000-06-21 2007-01-09 Microsoft Corporation Linked value replication
US20020099787A1 (en) * 2001-01-12 2002-07-25 3Com Corporation Distributed configuration management on a network
US6879564B2 (en) * 2001-02-28 2005-04-12 Microsoft Corp. Method for designating communication paths in a network
US6973529B2 (en) * 2001-09-28 2005-12-06 International Business Machines Corporation Multiple I/O path selection among disparate channel paths
US7035922B2 (en) * 2001-11-27 2006-04-25 Microsoft Corporation Non-invasive latency monitoring in a store-and-forward replication system
US7185359B2 (en) * 2001-12-21 2007-02-27 Microsoft Corporation Authentication and authorization across autonomous network systems
US20040039839A1 (en) * 2002-02-11 2004-02-26 Shivkumar Kalyanaraman Connectionless internet traffic engineering framework
JP3924480B2 (ja) * 2002-03-06 2007-06-06 株式会社エヌ・ティ・ティ・ドコモ ハンドオーバ制御装置、中継ルータ、ゲートウェイ装置、アクセスルータ、基地局、移動通信システム、及びハンドオーバ制御方法
US7206281B2 (en) * 2002-05-03 2007-04-17 Ciena Corporation Calculating physical routes in a communication network
US8611919B2 (en) 2002-05-23 2013-12-17 Wounder Gmbh., Llc System, method, and computer program product for providing location based services and mobile e-commerce
US10489449B2 (en) 2002-05-23 2019-11-26 Gula Consulting Limited Liability Company Computer accepting voice input and/or generating audible output
GB0220660D0 (en) * 2002-09-05 2002-10-16 Nokia Corp Signal propogation delay routing
US6973152B2 (en) * 2002-12-04 2005-12-06 Cirrus Logic, Inc. Exploiting shortest path for improved network clock distribution
EP1570604A4 (de) * 2002-12-13 2008-05-07 Internap Network Services Corp Topologiebewusste routensteuerung
US7299273B2 (en) * 2002-12-16 2007-11-20 International Business Machines Corporation Method and system to bundle message over a network
US20040121789A1 (en) * 2002-12-23 2004-06-24 Teddy Lindsey Method and apparatus for communicating information in a global distributed network
US6845384B2 (en) 2003-08-01 2005-01-18 Oracle International Corporation One-phase commit in a shared-nothing database system
US7120651B2 (en) * 2003-08-01 2006-10-10 Oracle International Corporation Maintaining a shared cache that has partitions allocated among multiple nodes and a data-to-partition mapping
US7139772B2 (en) * 2003-08-01 2006-11-21 Oracle International Corporation Ownership reassignment in a shared-nothing database system
US7277897B2 (en) * 2003-08-01 2007-10-02 Oracle International Corporation Dynamic reassignment of data ownership
US8234517B2 (en) * 2003-08-01 2012-07-31 Oracle International Corporation Parallel recovery by non-failed nodes
US7668953B1 (en) 2003-11-13 2010-02-23 Cisco Technology, Inc. Rule-based network management approaches
US7467219B2 (en) 2003-11-24 2008-12-16 At&T Intellectual Property I, L.P. Methods for providing communications services
US7509373B2 (en) * 2003-11-24 2009-03-24 At&T Intellectual Property I, L.P. Methods for providing communications services
FI20040149A0 (fi) * 2004-01-30 2004-01-30 Nokia Corp Reijitystiedon hankkiminen
US8880664B1 (en) * 2004-07-26 2014-11-04 Cisco Technology, Inc. Method and apparatus for generating a network profile and device profile
KR100655780B1 (ko) * 2004-12-20 2006-12-08 삼성전자주식회사 플래시 메모리 장치 및 그 제조 방법
US20070115947A1 (en) * 2004-12-30 2007-05-24 Nathan Nelson System and method for routing call traffic
US7814065B2 (en) 2005-08-16 2010-10-12 Oracle International Corporation Affinity-based recovery/failover in a cluster environment
US7978611B2 (en) * 2005-09-06 2011-07-12 At&T Intellectual Property I, L.P. Systems and methods to determine network routes based on transmission medium length
US7779098B1 (en) 2005-12-20 2010-08-17 At&T Intellectual Property Ii, L.P. Methods for identifying and recovering stranded and access-no-revenue network circuits
US8307057B1 (en) 2005-12-20 2012-11-06 At&T Intellectual Property Ii, L.P. Methods for identifying and recovering non-revenue generating network circuits established outside of the united states
US20090063211A1 (en) * 2007-08-30 2009-03-05 Camilo Yamauchi Campo Finding a Shortest Waste Credit Path for a Manufacturing Process
CA2605281A1 (en) * 2007-09-28 2009-03-28 International Business Machines Corporation System and method for increasing usage of recycling in manufacturing processes
KR100980593B1 (ko) * 2008-07-31 2010-09-06 아주대학교산학협력단 유비쿼터스 모니터링 시스템
US8285900B2 (en) 2009-02-17 2012-10-09 The Board Of Regents Of The University Of Texas System Method and apparatus for congestion-aware routing in a computer interconnection network
US8510334B2 (en) 2009-11-05 2013-08-13 Oracle International Corporation Lock manager on disk
US20150195189A1 (en) * 2014-01-07 2015-07-09 Alcatel Lucent Usa, Inc. Multiple tree routed selective randomized load balancing
JP6520362B2 (ja) * 2014-08-25 2019-05-29 富士通株式会社 生成方法、装置、及びプログラム

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IT1108325B (it) * 1978-04-10 1985-12-09 Cselt Centro Studi Lab Telecom Procedimento e dispositivo di in stradamento per una rete di comunicazione a commutazione di pacchetto
US4317193A (en) * 1980-02-04 1982-02-23 Bell Telephone Laboratories, Incorporated Time division nodal switching network
JPS5827449A (ja) * 1981-08-11 1983-02-18 Nippon Telegr & Teleph Corp <Ntt> パケツト交換の径路選択方式
FR2567345B1 (fr) * 1984-07-04 1992-03-13 Jeumont Schneider Procede de determination du dernier noeud intermediaire dans un reseau de plusieurs noeuds interconnectes
JPS62120147A (ja) * 1985-11-20 1987-06-01 Fujitsu Ltd 論理パス接合通信方式

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
ICC'88,CONFERENCE RECORD,PHILADELPHIA,IEEE vol. 2/3, 12 June 1988, NEW YORK,US pages 999 - 1003; F.AMER ET AL.: 'A survey of hierarchical routing algorithms and a new hierarchcal hybrid adaptive routing algorithm for large scale computer communication networks.' *
ICC'88,CONFERNCE RECORD,PHILADELPHIA vol. 1/3, 12 June 1988, NEW YORK,US pages 443 - 451; G.LAUER: 'Address servers in hierarchcal networks' *
IEEE TRANSACTIONS ON COMMUNICATIONS vol. COM28, no. 4, April 1980, NEW YORK,US pages 539 - 553; M.SCHWARTZ ET AL.: 'Routing techniqus used in computer communication networks' *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0653135A1 (de) * 1992-07-27 1995-05-17 Codex Corporation System und verfahren für ruf-zu-ruf leitweglenkung mit auf regeln basierter rücklenkung
EP0653135A4 (de) * 1992-07-27 1997-03-12 Codex Corp System und verfahren für ruf-zu-ruf leitweglenkung mit auf regeln basierter rücklenkung.
EP0595751A2 (de) * 1992-10-30 1994-05-04 International Business Machines Corporation Verfahren zur Leitweglenkung von elektronischen Nachrichten
EP0595751A3 (en) * 1992-10-30 1994-08-10 Ibm Method of routing electronic messages
WO1995018498A1 (en) * 1993-12-24 1995-07-06 International Business Machines Corporation Routing bandwidth-reserved connections in information networks
WO1995035612A2 (en) * 1994-06-13 1995-12-28 Philips Electronics N.V. Communication network
WO1995035612A3 (en) * 1994-06-13 1996-02-01 Philips Electronics Nv Communication network
US5640384A (en) * 1994-06-13 1997-06-17 U.S. Philips Corporation Reconfigurable communication network

Also Published As

Publication number Publication date
JPH0693680B2 (ja) 1994-11-16
DE68923489T2 (de) 1996-03-07
JPH0241053A (ja) 1990-02-09
EP0348327B1 (de) 1995-07-19
EP0348327A3 (de) 1992-03-11
DE68923489D1 (de) 1995-08-24
US4873517A (en) 1989-10-10

Similar Documents

Publication Publication Date Title
EP0348327A2 (de) Verfahren zur Auswahl eines optimalen Weges zwischen Knoten in einem Datenkommunikationsnetz
US5398012A (en) Distributed processing of route selection across networks and subnetworks
US5321815A (en) Route selection using cached partial trees in a data communications network
EP0348328B1 (de) Verfahren zur Auswahl des geringstwertigen Weges in einem Kommunikationsnetz
US5495479A (en) Method and apparatus for an automatic decomposition of a network topology into a backbone and subareas
KR100221381B1 (ko) 웜홀 네트워크 및 웜홀 네트워크의 메시지 전송 방법
CA1137584A (en) Multiprocessor system for the processing of digital data
ES2253742T3 (es) Un metodo para encaminar multiples circuitos virtuales.
US5410586A (en) Method for analyzing an IDNX network
US5025491A (en) Dynamic address binding in communication networks
EP0568477A2 (de) Verfahren und Vorrichtung zur optimalen Wegeauswahl in Paketübertragungsnetzen
EP0635958A3 (de) Entwurfs- und Verwaltungsverfahren für Kommunikationsnetze
CZ250296A3 (en) System for controlling applications of a network computer
US20030065758A1 (en) Module-building method for designing interconnect fabrics
KR100273774B1 (ko) 초고속 전용통신망 최적 설계를 위한 망 설계 방법
JP2980031B2 (ja) 再構成可能なネットワーク
US6667958B2 (en) Routing calls to external networks from a private network
CN101166290B (zh) 一种全局码翻译方法
WO1999065268A1 (en) Resource interface unit for telecommunications switching node
JP3035802B2 (ja) Ａｔｍ交換機およびこれを用いるシステム
JP3185785B2 (ja) 再構成サーバ及び通信ノード
Chlamtac et al. Differential service in high-speed interconnection systems: an algorithm for prioritized access
JPH0715469A (ja) ルーチングデータ自動生成機能
JPH0771162B2 (ja) 信号リンク負荷分散方法
JPH07297909A (ja) 回線網ルーチング方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): DE FR GB

17P Request for examination filed

Effective date: 19900419

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 19940204

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

ET Fr: translation filed
REF Corresponds to:

Ref document number: 68923489

Country of ref document: DE

Date of ref document: 19950824

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20020516

Year of fee payment: 14

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20040130

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20050425

Year of fee payment: 17

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20061201

REG Reference to a national code

Ref country code: GB

Ref legal event code: 746

Effective date: 20080416

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20080522

Year of fee payment: 20

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20090522

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20090522