US6016306A - Routing bandwidth-reserved connections in information networks - Google Patents

Routing bandwidth-reserved connections in information networks Download PDF

Info

Publication number
US6016306A
US6016306A US08/666,377 US66637796A US6016306A US 6016306 A US6016306 A US 6016306A US 66637796 A US66637796 A US 66637796A US 6016306 A US6016306 A US 6016306A
Authority
US
United States
Prior art keywords
path
link
weight
links
network
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 - Lifetime
Application number
US08/666,377
Other languages
English (en)
Inventor
Jean-Yves Le Boudec
Antoni B. Przygienda
Robert Sultan
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
Assigned to IBM CORPORATION reassignment IBM CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SULTAN, R., PRZYGIENDA, A. B., BOUDEC, J-Y LE
Application granted granted Critical
Publication of US6016306A publication Critical patent/US6016306A/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • 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/34—Source routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching

Definitions

  • the present invention concerns the routing function in information networks, e.g. switch-based computer networks. In such a network it is necessary to determine paths from source nodes to destination nodes.
  • This invention enhances and expands the known Dijkstra routing method to support additional types of service, e.g. reserved bandwidth service, which are not possible with the Dijkstra method.
  • the invented method will also be called “widest-path method” throughout this description.
  • a specific path metric is used, called “bottleneck metric” in the sequel, which was found to be compatible with the algebraic rules that govern the routing method. With this metric, it is possible to reflect realistically enough at least the bandwidth characteristics of the paths, but other characteristics may also be represented.
  • the widest-path method can be used e.g.
  • connection-oriented networks as Asynchronous Transmission Mode (ATM) or Internet Stream Protocol Version II (ST.II) networks, where the routing decisions are made at connection setup, but it is not limited thereto. It can be used to precompute paths from any source to any destination and prestore all paths until a respective one is used for a connection request.
  • Such precomputed routing trees are advantageous in source routing methods, where the local source node tree is used to produce a source vector, which describes the path as a sequence of nodes to be covered during packet transmission.
  • the present invention is especially useful in link-state routing mechanisms for networks, but it could be used in the context of any routing problem for which the widest-path method is applicable and for which the bottleneck metric is an appropriate representation of the respective path characteristic.
  • Link-state algorithms such as Open Shortest Path First (OSPF) are in common use for providing the routing function in computer networks implementing a connectionless network layer.
  • OSPF Open Shortest Path First
  • the network routing algorithm builds routing tables as a background task. Information about links is maintained and updated by a topology function replicated in all nodes; as a result, every node owns an image of the network, see e.g. EP 0 348 327 or EP 0 447 725. This image is used with a shortest-path algorithm to compute routes to all destinations.
  • the routing tables, produced by the routing algorithm normally are used to forward individual packets. With the traditional metrics, optimal paths are "shortest" paths.
  • a metric that reflects the allocatable capacity available on links is also known from U.S. Pat. Nos. 5,088,032 and 5,067,127.
  • U.S. Pat. No. 5,067,127 a congestion avoidance control method for communication networks is described, which uses a link weight inversely proportional to the available bandwidth and the path weight is the sum of the link weights.
  • U.S. Pat. No. 5,088,032 a modified Ford path computation algorithm is described. There, the weight of a link can be inversely proportional to the available bandwidth, and the path weight is determined as the maximum of the weights of its links.
  • a distance vector method is described; the Dijkstra method is not mentioned at all.
  • the traditional Dijkstra method uses a path weight, which is determined as the sum of the weights of its links, and therefore it is no substitute for the modified Ford algorithm.
  • the widest-path method (as the Dijkstra method) builds a complete spanning tree of paths from a source to all destinations using a topology database of all nodes, their directly attached links and related link weights. This is especially useful in link-state routing mechanisms and source routing.
  • routing is connection-oriented and the routing decision is made at connection setup. If, in addition, connections must have guaranteed bandwidth, e.g. for loss-sensitive communication, a virtual circuit network with bandwidth reservation is necessary. Examples are networks of ST.II routers and ATM networks. There, all packets or cells belonging to a connection follow the same path. In such cases, the routing algorithm applies to the routing of connection setup messages, this is also referred to "call routing".
  • a further object is to improve a network node by implementing in it a routing function enhancement comprising the widest-path method; improvements to the topology function are proposed to include in its update method a modified dampening method and/or a bandwidth encoding method to enable consideration of dynamically varying available bandwidths. Further disclosed is a network comprising improved nodes which may be mixed with normal nodes not supporting the devised enhancement.
  • the above objects are accomplished by enhancing and extending the Dijkstra routing method by applying an appropriate metric to determine link weights and path weights.
  • An appropriate metric must reflect at least approximately the characteristics of the paths to be taken into account in the routing method and it must be compatible with this method.
  • the bottleneck metrics comply with these constraints. They include metrics which are defined so that the weight of a path is given by the maximum of the weights of its links, and a link or path with smaller weight is the better link or path, respectively. In this case, with the widest-path method, the best paths are still paths with minimal weight in this case, as with the Dijkstra method. A formal description of such an example of the method in algorithm form is given in the appendix.
  • the minimum (or another extremum) of the component link weights can be used to determine the path weight directly or after further calculation, provided that the calculation applied is a non-decreasing function.
  • the median of component link weights or the component link weight closest to a predetermined target value can be used, if these reflect the path characteristic to be described.
  • an operation on the weights of the component links of a path is applied to select at least one link (the "bottleneck link") of the path, and the path's weight is then determined from the weights of its bottleneck links.
  • the metric reflects the allocatable capacity available on links and the widest-path method is used for the computation of the path with the highest allocatable capacity.
  • link-state routing network nodes share link state information that reflects the available bandwidth on each of the links of the network. This is performed by encoding the available capacities as link weights and using a known distribution mechanism, called "topology function", for transmission. As the available capacity varies very dynamically, it is necessary to prevent excessive amounts of link state updates. This is known as "dampening" and an appropriate dampening method is described.
  • the routing function can be applied to connection setup requests instead of individual packets.
  • the widest-path method computes paths from any source to any destination, using the information obtained from the topology function.
  • the paths can be stored and used to route connection requests as they arrive.
  • One feature of the "widest-path" definition is that either a connection setup can be routed along a widest path, no matter how much bandwidth it requests, or it cannot be routed at all in the network. In other words, the method guarantees that the connection will find a path with sufficient bandwidth, assuming there exists such capacity in the network at all, and assuming the information provided by the topology function is up-to-date. This also means that one single computation can serve all possible bandwidth requests.
  • One benefit of the widest-path method is that it is compatible with and allows the reuse of the well-tested routing function code. An additional benefit is that the routes produced by the method are computed and stored in advance of connection requests, thus supporting fast connection setup.
  • the method can be used in conjunction with a routing protocol such as OSPF to work with standard network nodes that do not support the widest-path method.
  • OSPF a routing protocol
  • standard network nodes that do not support the widest-path method.
  • OSPF a routing protocol
  • the method does not limit the number of hops. This is insignificant in many applications, but the limitation can be changed if necessary.
  • FIG. 1A illustrates schematically the widest-path method according to the invention.
  • a typical routing problem with a bandwidth bottleneck situation in a network domain is assumed to explain this method in contrast to the state of the art.
  • FIG. 1B shows in more detail a node of the domain of FIG. 1A and the related information flow.
  • FIG. 2 depicts a mixed network of widest-path areas and standard areas.
  • FIG. 3 shows an exponential bandwidth encoding format for link-state update information.
  • FIG. 4 illustrates call routing and the related information flow.
  • a path is the concatenation of links, also called “component links” of the path, between network nodes.
  • the width Cpath of a path is defined as the minimum of the available capacity on each of the component links.
  • the available capacity is the bandwidth, in bits per second, that can be allocated to user connections. Therefore, the capacity bottleneck link determines what capacity is available on a path.
  • a "widest path” is a path that, among all paths between one source and one destination, has the largest width.
  • FIG. 1 illustrates a widest-path example in a domain including nodes 1 to 7 of an arbitrarily meshed network. Links of different available bandwidths are shown and the respective bandwidth is depicted by the width of the link connecting line.
  • a widest path from node 1 to 2 is the path 1-4-5-2, with an assumed width of say 40 Mb/s, determined by link 5-2.
  • link 1-3 100 Mb/s
  • path 1-3-2 is narrower than 1-4-5-2. It has a width of only 20 Mb/s, say, due to the bottleneck link 3-2.
  • Weights are applied to the links in such a way that a link with smaller weight is wider (has more available bandwidth) than a link with bigger weight. Then, the widest link is a link with smallest weight and the narrowest link is a link with biggest weight.
  • the weight Wlink of a link is defined as
  • Clink is the available capacity, or bandwidth of the link.
  • the weight of a path is defined as the maximum of the weights of its component links, that is, it is determined by its narrowest link.
  • the reason for defining the weights as complements to Cmax is the compatibility with the shortest path method used in network domains that do not use the widest-path method.
  • the widest-path method builds a tree of paths (as the Dijkstra method), so the resulting graph is always loop-free.
  • paths e.g. 1-4-5-6-7-5-2 that are optimal in the sense of the widest-path metric, but contain loops. Such paths are excluded automatically by the widest-path method.
  • the quality of the paths can be further improved by adding to the method the constraint that, among all widest paths, only the ones with the least number of hops or, more precisely, number of link state advertisements used are retained. This defines a precedence of equal-weight routes. In the example, path 1-4-5-2 precedes path 1-4-7-5-2 of equal weight which is determined by bottleneck link 5-2 in both cases.
  • FIG. 1B shows a network node according to the invention including a known topology function 10.
  • a widest-path generator 12 is connected to the topology function 10.
  • link-state update information 14 is exchanged between network nodes to keep the topology function up to date.
  • a bandwidth information update module 11 is connected to the topology function to include bandwidth information in the link-state update information 14 for variable available link capacity.
  • Module 11 is comprising an encoder to format a bandwidth information to be sent out by the node, a receiver for receiving and, if necessary, decoding bandwidth information of other nodes, and a dampening mechanism avoiding immediate updating reaction to small bandwidth changes.
  • the encoding uses 8 as the exponentiation basis, 3 bits of exponent 21 starting from the most significant bit 23, and 13 bits of mantissa 22, ending with the least significant bit 24.
  • WET-OSPF OSPF standard routing protocol
  • network nodes are called “routers”.
  • Widest-path areas consist only of routers supporting the widest-path method. This is determined by a similar mechanism as the one used to have all routers in a stub area agree about the stub property.
  • a new option bit is introduced, called W-bit. Routers of a widest-path area set this bit sending so-called hello-packets on area interfaces and refuse to build adjacency to routers in the area that do not have this bit set.
  • the summary link advertisements are installed in intervals equal to or larger than MinLSlnterval. Nevertheless, this does not influence the router link advertisement, which can be installed as fast as WET-MinLSInterval allows, because all routers inside the area are using this interval on such interfaces.
  • Every node in the network produces a local routing tree.
  • This information can be used for call routing in a number of ways.
  • One particularly attractive method is to use source routing, as mentioned above.
  • An example of a call routing method used for setting up calls is illustrated in FIG. 4.
  • a connection setup request 13 is sent from a source 25 to route a connection to destination 26.
  • the local, pre-computed routing tree from a widest-path generator 12 at the source node 1 is used to produce a source vector, describing the path as a sequence of nodes 1,4,5 to be visited.
  • Intermediate nodes 4,5 do not use the local routing tree, but instead consult the routing vector carried by every packet or connection setup message 13. This guarantees loop free routing of the call setup, since the widest-path method according to the invention always builds a loop free graph.
  • Link-state update information 14 is exchanged between the nodes 1,4,5 as necessary.
  • the method presented here provides a means for computing paths.
  • a routing method is described, which allows to determine the best path in a network from link weights in situations where these weights are not additive, but the weight of a path is defined by its bottleneck link.
  • the metric must be chosen from a specific set of metrics, called bottleneck metrics in this description.
  • the new widest-path method has some characteristics of the well known Dijkstra method for additive weights.
  • the method can be extended in many ways, depending on the application, without departing from the general inventive concept; it is envisioned to account for path quality, path security, or passenger comfort, to name a few applications.
  • Various call setup schemes are possible, including multiparty calls; also, numerous modifications depending on intended network environment and types of nodes can be made in accordance with the general concept of the invention. All these different embodiments can be implemented by someone skilled in the art and thus fall within the scope of this invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)
US08/666,377 1993-12-24 1993-12-24 Routing bandwidth-reserved connections in information networks Expired - Lifetime US6016306A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP1993/003683 WO1995018498A1 (en) 1993-12-24 1993-12-24 Routing bandwidth-reserved connections in information networks

Publications (1)

Publication Number Publication Date
US6016306A true US6016306A (en) 2000-01-18

Family

ID=8165810

Family Applications (1)

Application Number Title Priority Date Filing Date
US08/666,377 Expired - Lifetime US6016306A (en) 1993-12-24 1993-12-24 Routing bandwidth-reserved connections in information networks

Country Status (6)

Country Link
US (1) US6016306A (de)
EP (1) EP0736237B1 (de)
JP (1) JP3084066B2 (de)
KR (1) KR100218624B1 (de)
DE (1) DE69325398T2 (de)
WO (1) WO1995018498A1 (de)

Cited By (64)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6256295B1 (en) * 1997-09-25 2001-07-03 Nortel Networks Limited Method and apparatus for determining multiple minimally-overlapping paths between nodes in a network
US6260072B1 (en) * 1997-06-12 2001-07-10 Lucent Technologies Inc Method and apparatus for adaptive routing in packet networks
WO2001069866A1 (en) * 2000-03-15 2001-09-20 Infosim Networking Solutions Ag Method and system for controlling data traffic in a network
EP1170964A2 (de) * 2000-06-28 2002-01-09 Tenovis GmbH & Co. KG Verfahren zur Herstellung einer Verbindung in einem Leitungsnetz
US6356911B1 (en) * 1997-12-11 2002-03-12 International Business Machines Corporation Shortest path search system
US6363319B1 (en) * 1999-08-31 2002-03-26 Nortel Networks Limited Constraint-based route selection using biased cost
US6370119B1 (en) * 1998-02-27 2002-04-09 Cisco Technology, Inc. Computing the widest shortest path in high-speed networks
US20020051458A1 (en) * 1998-04-24 2002-05-02 Avici Systems Composite trunking
US6391620B1 (en) 1999-11-02 2002-05-21 Paul A. Olivier Method for bio-conversion of putrescent wastes
US20020069340A1 (en) * 2000-12-06 2002-06-06 Glen Tindal System and method for redirecting data generated by network devices
US20020069291A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Dynamic configuration of network devices to enable data transfers
US20020069274A1 (en) * 2000-12-06 2002-06-06 Tindal Glen D. System and method for configuration, management and monitoring of network resources
US20020069367A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Network operating system data directory
US20020069271A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Event manager for network operating system
US20020147842A1 (en) * 2001-02-01 2002-10-10 Breitbart Yuri J. System and method for optimizing open shortest path first aggregates and autonomous network domain incorporating the same
US20020178380A1 (en) * 2001-03-21 2002-11-28 Gold Wire Technology Inc. Network configuration manager
US20030035166A1 (en) * 2001-08-17 2003-02-20 Quantum Bridge Communications, Inc. Method and apparatus for path selection and wavelength assignment in an optical network
US20030046370A1 (en) * 2001-08-29 2003-03-06 Mike Courtney System and method for modeling a network device's configuration
US20030051008A1 (en) * 2001-08-29 2003-03-13 Gorthy Scott B. System and method for generating a configuration schema
US6535923B1 (en) * 1999-03-30 2003-03-18 International Business Machines Corporation Method and system for defining an efficient and reliable meshing of CP-CP sessions in an advanced peer to peer network
US20030090996A1 (en) * 2001-11-09 2003-05-15 Fujitsu Network Communications, Inc. Focused link state advertisements
US20030101240A1 (en) * 2001-11-26 2003-05-29 Mike Courtney System and method for generating a representation of a configuration schema
US20030124889A1 (en) * 2001-11-27 2003-07-03 Kenichi Yamaguchi Electrical connector
US6600722B1 (en) * 1998-10-15 2003-07-29 Alcatel Routing calls in a telecommunications network on the basis of passband
US20030143728A1 (en) * 2002-01-25 2003-07-31 Olivier Paul A. Disposal apparatus and method for efficiently bio-converting putrescent wastes
US20030167322A1 (en) * 2002-03-04 2003-09-04 International Business Machines Corporation System and method for determining weak membership in set of computer nodes
US20030182430A1 (en) * 2000-03-09 2003-09-25 Mika Aalto Adaptation of transmission capacity in packet-switched networks, using atm-cells
US6650626B1 (en) * 1999-12-10 2003-11-18 Nortel Networks Limited Fast path forwarding of link state advertisements using a minimum spanning tree
US20040004938A1 (en) * 2002-07-02 2004-01-08 Lucent Technologies Routing bandwidth guaranteed paths with local restoration in label switched networks
US20040030923A1 (en) * 2002-08-07 2004-02-12 Tindal Glen D. Method and apparatus for protecting a network from attack
US20040032832A1 (en) * 2002-07-30 2004-02-19 Snehal Desai System and method for determining the shortest path between a pair of nodes in an equal cost network
US20040039839A1 (en) * 2002-02-11 2004-02-26 Shivkumar Kalyanaraman Connectionless internet traffic engineering framework
US20040047294A1 (en) * 2002-09-10 2004-03-11 International Business Machines Corporation System and method for selecting fibre channel switched fabric frame paths
US6711171B1 (en) * 1995-11-15 2004-03-23 Enterasys Networks, Inc. Distributed connection-oriented services for switched communications networks
US20040148369A1 (en) * 2002-07-11 2004-07-29 John Strassner Repository-independent system and method for asset management and reconciliation
US20040153536A1 (en) * 2002-09-13 2004-08-05 John Strassner System and method for mapping between and controlling different device abstractions
US20040184441A1 (en) * 2003-03-19 2004-09-23 Fuming Wu Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks
US20040264503A1 (en) * 2003-06-30 2004-12-30 Microsoft Corporation Method and system for providing a virtual protocol interlayer
US6842425B1 (en) * 2000-02-14 2005-01-11 Lucent Technologies Inc. Method and apparatus for optimizing routing through network nodes
US20050083949A1 (en) * 1995-11-15 2005-04-21 Kurt Dobbins Distributed connection-oriented services for switched communication networks
US6931608B1 (en) * 2002-06-04 2005-08-16 Cadence Design Systems, Inc. Method and apparatus for determining viability of path expansions
US6959329B2 (en) 2002-05-15 2005-10-25 Intelliden System and method for transforming configuration commands
US6959335B1 (en) * 1999-12-22 2005-10-25 Nortel Networks Limited Method of provisioning a route in a connectionless communications network such that a guaranteed quality of service is provided
US6978301B2 (en) 2000-12-06 2005-12-20 Intelliden System and method for configuring a network device
US20060067294A1 (en) * 2004-09-30 2006-03-30 Netravali Arun N Methods and devices for selecting internet routing paths
US7065045B2 (en) 2001-01-03 2006-06-20 International Business Machines Corporation Method and system for providing an optimal path choice for differentiated services
US20060146717A1 (en) * 2005-01-05 2006-07-06 Intel Corporation Methods and apparatus for identifying a distance-vector route associated with a wireless mesh network
US20060173999A1 (en) * 2002-08-07 2006-08-03 Rider Kenneth D System and method for securing network resources
US7173912B2 (en) * 2000-05-05 2007-02-06 Fujitsu Limited Method and system for modeling and advertising asymmetric topology of a node in a transport network
EP1811713A1 (de) * 2004-11-03 2007-07-25 Huawei Technologies Co., Ltd. Verfahren zur bestimmung des taktverfolgungspfads und verfahren zur taktverfolgung in dem netzwerk
US7324453B2 (en) 2002-08-30 2008-01-29 Alcatel Lucent Constraint-based shortest path first method for dynamically switched optical transport networks
US7428271B2 (en) 2003-07-15 2008-09-23 Samsung Electronics Co., Ltd. Network device and data transmission method for efficient data transmission and reception in mobile ad hoc network environment
US7577958B1 (en) * 1999-12-09 2009-08-18 Nortel Networks Limited Expediting an operation in a computer system
US7672331B1 (en) 2004-02-25 2010-03-02 At&T Intellectual Property Ii, L.P. Method and apparatus for initiating routing messages in a communication network
US20100180048A1 (en) * 2009-01-09 2010-07-15 Microsoft Corporation Server-Centric High Performance Network Architecture for Modular Data Centers
US7768927B1 (en) * 2003-11-06 2010-08-03 Sprint Communications Company L.P. Method for altering link weights in a communication network to provide traffic information for improved forecasting
US20110047291A1 (en) * 2009-01-26 2011-02-24 Tomoki Ishii Relay device, control method, and program
US7953011B1 (en) 2003-11-06 2011-05-31 Sprint Communications Company L.P. Method for estimating telecommunication network traffic using link weight changes
US20110202682A1 (en) * 2010-02-12 2011-08-18 Microsoft Corporation Network structure for data center unit interconnection
US20140215032A1 (en) * 2013-01-31 2014-07-31 Fujitsu Limited Systems and methods of network reconfiguration
US9806988B2 (en) 1996-10-31 2017-10-31 Patentmarks Communications, Llc Multi-protocol telecommunications routing optimization
US11469988B1 (en) 2021-04-30 2022-10-11 Bank Of America Corporation Communication analysis for dynamic auto-routing and load balancing
US11784930B2 (en) 2021-04-30 2023-10-10 Bank Of America Corporation Communication system with auto-routing and load balancing
US11792108B2 (en) 2021-04-30 2023-10-17 Bank Of America Corporation Dynamic auto-routing and load balancing for communication systems

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0615772U (ja) * 1992-07-24 1994-03-01 株式会社ニッテク ピペット洗浄装置
US5754543A (en) * 1996-07-03 1998-05-19 Alcatel Data Networks, Inc. Connectivity matrix-based multi-cost routing
SE9604491L (sv) * 1996-12-05 1998-06-06 Ericsson Telefon Ab L M Anordning och förfarande i överföringssystem
US6266610B1 (en) 1998-12-31 2001-07-24 Honeywell International Inc. Multi-dimensional route optimizer
KR100332410B1 (ko) * 1999-09-28 2002-04-13 서평원 유사 클로즈 네트워크에서의 가상컨테이너 신호들의 복합경로 탐색방법
KR20010000336A (ko) * 2000-09-16 2001-01-05 최종선 방송문안 자동편집 송출방법 및 장치
DE10142372B4 (de) * 2001-01-05 2005-03-03 Siemens Ag Vorrichtung und Verfahren zum Wiederherstellen von Verbindungen in automatisch schaltbaren optischen Netzen
US7706282B2 (en) * 2003-06-25 2010-04-27 Leping Huang Bluetooth personal area network routing protocol optimization using connectivity metric
US7688739B2 (en) * 2005-08-02 2010-03-30 Trilliant Networks, Inc. Method and apparatus for maximizing data transmission capacity of a mesh network
CN101286835B (zh) * 2007-04-11 2013-03-20 华为技术有限公司 一种时钟跟踪的方法、装置及网元设备
US8385231B2 (en) * 2009-07-30 2013-02-26 Roberto Rojas-Cessa Disseminating link state information to nodes of a network
JP5877385B2 (ja) * 2010-09-09 2016-03-08 パナソニックＩｐマネジメント株式会社 無線通信システム

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5088032A (en) * 1988-01-29 1992-02-11 Cisco Systems, Inc. Method and apparatus for routing communications among computer networks
US5115495A (en) * 1988-10-18 1992-05-19 The Mitre Corporation Communications network system using full-juncture and partial-juncture station status information for alternate-path distance-vector routing
US5163042A (en) * 1988-11-24 1992-11-10 Kabushiki Kaisha Toshiba Exchange route decision system and method
US5218676A (en) * 1990-01-08 1993-06-08 The University Of Rochester Dynamic routing system for a multinode communications network
US5521910A (en) * 1994-01-28 1996-05-28 Cabletron Systems, Inc. Method for determining a best path between two nodes
US5596719A (en) * 1993-06-28 1997-01-21 Lucent Technologies Inc. Method and apparatus for routing and link metric assignment in shortest path networks
US5596722A (en) * 1995-04-03 1997-01-21 Motorola, Inc. Packet routing system and method for achieving uniform link usage and minimizing link load
US5600794A (en) * 1995-08-04 1997-02-04 Bay Networks, Inc. Method and apparatus for managing exchange of metrics in a computer network by exchanging only metrics used by a node in the network
US5606669A (en) * 1994-05-25 1997-02-25 International Business Machines Corporation System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in each network node
US5608721A (en) * 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2610161B1 (fr) * 1987-01-23 1994-03-25 Telic Alcatel Procede de routage des communications pour reseau d'autocommutateurs temporels numeriques
US4905233A (en) * 1987-11-23 1990-02-27 Harris Corporation Multiple path routing mechanism for packet communications network
US4873517A (en) * 1988-06-23 1989-10-10 International Business Machines Corporation Method for selecting least weight end node to end node route in a data communications network
JPH03108845A (ja) * 1989-09-21 1991-05-09 Toshiba Corp 輻輳回避制御方式
EP0423053B1 (de) * 1989-10-13 1996-03-13 International Business Machines Corporation Verfahren zur Verwendung gespeicherter partieller Bäume zur Berechnung eines Weges in einem Datenkommunikationsnetz
US5128926A (en) * 1990-03-21 1992-07-07 Digital Equipment Corporation Updating link state information in networks
EP0498967B1 (de) * 1991-02-13 1996-01-24 BELL TELEPHONE MANUFACTURING COMPANY Naamloze Vennootschap Bandbreitezuteilung für permanente virtuelle Verbindungen

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5088032A (en) * 1988-01-29 1992-02-11 Cisco Systems, Inc. Method and apparatus for routing communications among computer networks
US5115495A (en) * 1988-10-18 1992-05-19 The Mitre Corporation Communications network system using full-juncture and partial-juncture station status information for alternate-path distance-vector routing
US5163042A (en) * 1988-11-24 1992-11-10 Kabushiki Kaisha Toshiba Exchange route decision system and method
US5218676A (en) * 1990-01-08 1993-06-08 The University Of Rochester Dynamic routing system for a multinode communications network
US5596719A (en) * 1993-06-28 1997-01-21 Lucent Technologies Inc. Method and apparatus for routing and link metric assignment in shortest path networks
US5521910A (en) * 1994-01-28 1996-05-28 Cabletron Systems, Inc. Method for determining a best path between two nodes
US5606669A (en) * 1994-05-25 1997-02-25 International Business Machines Corporation System for managing topology of a network in spanning tree data structure by maintaining link table and parent table in each network node
US5596722A (en) * 1995-04-03 1997-01-21 Motorola, Inc. Packet routing system and method for achieving uniform link usage and minimizing link load
US5608721A (en) * 1995-04-03 1997-03-04 Motorola, Inc. Communications network and method which implement diversified routing
US5600794A (en) * 1995-08-04 1997-02-04 Bay Networks, Inc. Method and apparatus for managing exchange of metrics in a computer network by exchanging only metrics used by a node in the network

Cited By (114)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100182934A1 (en) * 1995-11-15 2010-07-22 Enterasys Networks, Inc. Distributed connection-oriented services for switched communication networks
US8462794B2 (en) 1995-11-15 2013-06-11 Enterasys Networks, Inc. Distributed connection-oriented services for switched communication networks
US20050083949A1 (en) * 1995-11-15 2005-04-21 Kurt Dobbins Distributed connection-oriented services for switched communication networks
US6711171B1 (en) * 1995-11-15 2004-03-23 Enterasys Networks, Inc. Distributed connection-oriented services for switched communications networks
US7720076B2 (en) 1995-11-15 2010-05-18 Enterasys, Inc. Distributed connection-oriented services for switched communication networks
US20100177778A1 (en) * 1995-11-15 2010-07-15 Enterasys Networks, Inc. Distributed connection-oriented services for switched communication networks
US8023515B2 (en) 1995-11-15 2011-09-20 Enterasys Networks, Inc. Distributed connection-oriented services for switched communication networks
US9806988B2 (en) 1996-10-31 2017-10-31 Patentmarks Communications, Llc Multi-protocol telecommunications routing optimization
US6260072B1 (en) * 1997-06-12 2001-07-10 Lucent Technologies Inc Method and apparatus for adaptive routing in packet networks
US6256295B1 (en) * 1997-09-25 2001-07-03 Nortel Networks Limited Method and apparatus for determining multiple minimally-overlapping paths between nodes in a network
US6356911B1 (en) * 1997-12-11 2002-03-12 International Business Machines Corporation Shortest path search system
US6370119B1 (en) * 1998-02-27 2002-04-09 Cisco Technology, Inc. Computing the widest shortest path in high-speed networks
US7920555B2 (en) * 1998-04-24 2011-04-05 Futurewei Technologies, Inc. Composite trunking
US20020051458A1 (en) * 1998-04-24 2002-05-02 Avici Systems Composite trunking
US6600722B1 (en) * 1998-10-15 2003-07-29 Alcatel Routing calls in a telecommunications network on the basis of passband
US6535923B1 (en) * 1999-03-30 2003-03-18 International Business Machines Corporation Method and system for defining an efficient and reliable meshing of CP-CP sessions in an advanced peer to peer network
US6363319B1 (en) * 1999-08-31 2002-03-26 Nortel Networks Limited Constraint-based route selection using biased cost
US6391620B1 (en) 1999-11-02 2002-05-21 Paul A. Olivier Method for bio-conversion of putrescent wastes
US7577958B1 (en) * 1999-12-09 2009-08-18 Nortel Networks Limited Expediting an operation in a computer system
US6650626B1 (en) * 1999-12-10 2003-11-18 Nortel Networks Limited Fast path forwarding of link state advertisements using a minimum spanning tree
US6959335B1 (en) * 1999-12-22 2005-10-25 Nortel Networks Limited Method of provisioning a route in a connectionless communications network such that a guaranteed quality of service is provided
US6842425B1 (en) * 2000-02-14 2005-01-11 Lucent Technologies Inc. Method and apparatus for optimizing routing through network nodes
US20030182430A1 (en) * 2000-03-09 2003-09-25 Mika Aalto Adaptation of transmission capacity in packet-switched networks, using atm-cells
US20030185153A1 (en) * 2000-03-15 2003-10-02 Koehler Stefan Method and system for controlling data traffic in a network
US7869359B2 (en) 2000-03-15 2011-01-11 Koehler Stefan Method and system for controlling data traffic in a network
US7633873B1 (en) 2000-03-15 2009-12-15 Koehler Stefan Method and system for communication of data via an optimum data path in a network
AU2001250382B2 (en) * 2000-03-15 2005-07-07 Infosim Networking Solutions Ag Method and system for controlling data traffic in a network
KR100788762B1 (ko) * 2000-03-15 2007-12-31 나우루 벤처스 엘엘씨 데이터 트래픽 제어 방법 및 시스템
WO2001069866A1 (en) * 2000-03-15 2001-09-20 Infosim Networking Solutions Ag Method and system for controlling data traffic in a network
US7173912B2 (en) * 2000-05-05 2007-02-06 Fujitsu Limited Method and system for modeling and advertising asymmetric topology of a node in a transport network
EP1170964A2 (de) * 2000-06-28 2002-01-09 Tenovis GmbH & Co. KG Verfahren zur Herstellung einer Verbindung in einem Leitungsnetz
EP1170964A3 (de) * 2000-06-28 2004-11-10 Tenovis GmbH & Co. KG Verfahren zur Herstellung einer Verbindung in einem Leitungsnetz
US20020069271A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Event manager for network operating system
US7054946B2 (en) 2000-12-06 2006-05-30 Intelliden Dynamic configuration of network devices to enable data transfers
US7650396B2 (en) 2000-12-06 2010-01-19 Intelliden, Inc. System and method for defining a policy enabled network
US20020069367A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Network operating system data directory
WO2002047326A3 (en) * 2000-12-06 2003-02-27 Intelliden Inc Dynamic configuration of network devices to enable data transfers
US8219662B2 (en) 2000-12-06 2012-07-10 International Business Machines Corporation Redirecting data generated by network devices
US20020069340A1 (en) * 2000-12-06 2002-06-06 Glen Tindal System and method for redirecting data generated by network devices
US20020069291A1 (en) * 2000-12-06 2002-06-06 Glen Tindal Dynamic configuration of network devices to enable data transfers
WO2002047326A2 (en) * 2000-12-06 2002-06-13 Intelliden, Inc. Dynamic configuration of network devices to enable data transfers
US7249170B2 (en) 2000-12-06 2007-07-24 Intelliden System and method for configuration, management and monitoring of network resources
US6978301B2 (en) 2000-12-06 2005-12-20 Intelliden System and method for configuring a network device
US20020069274A1 (en) * 2000-12-06 2002-06-06 Tindal Glen D. System and method for configuration, management and monitoring of network resources
US7065045B2 (en) 2001-01-03 2006-06-20 International Business Machines Corporation Method and system for providing an optimal path choice for differentiated services
US20020147842A1 (en) * 2001-02-01 2002-10-10 Breitbart Yuri J. System and method for optimizing open shortest path first aggregates and autonomous network domain incorporating the same
US7082473B2 (en) * 2001-02-01 2006-07-25 Lucent Technologies Inc. System and method for optimizing open shortest path first aggregates and autonomous network domain incorporating the same
US20020178380A1 (en) * 2001-03-21 2002-11-28 Gold Wire Technology Inc. Network configuration manager
US7150037B2 (en) 2001-03-21 2006-12-12 Intelliden, Inc. Network configuration manager
US7020394B2 (en) 2001-08-17 2006-03-28 Quantum Bridge Communications, Inc. Method and apparatus for path selection and wavelength assignment in an optical network
US20030035166A1 (en) * 2001-08-17 2003-02-20 Quantum Bridge Communications, Inc. Method and apparatus for path selection and wavelength assignment in an optical network
US8296400B2 (en) 2001-08-29 2012-10-23 International Business Machines Corporation System and method for generating a configuration schema
US7200548B2 (en) 2001-08-29 2007-04-03 Intelliden System and method for modeling a network device's configuration
US20030046370A1 (en) * 2001-08-29 2003-03-06 Mike Courtney System and method for modeling a network device's configuration
US20030051008A1 (en) * 2001-08-29 2003-03-13 Gorthy Scott B. System and method for generating a configuration schema
US7042850B2 (en) 2001-11-09 2006-05-09 Fujitsu Limited Focused link state advertisements
US20030090996A1 (en) * 2001-11-09 2003-05-15 Fujitsu Network Communications, Inc. Focused link state advertisements
US20030101240A1 (en) * 2001-11-26 2003-05-29 Mike Courtney System and method for generating a representation of a configuration schema
US7065562B2 (en) 2001-11-26 2006-06-20 Intelliden, Inc. System and method for generating a representation of a configuration schema
US20030124889A1 (en) * 2001-11-27 2003-07-03 Kenichi Yamaguchi Electrical connector
US20030143728A1 (en) * 2002-01-25 2003-07-31 Olivier Paul A. Disposal apparatus and method for efficiently bio-converting putrescent wastes
US20040039839A1 (en) * 2002-02-11 2004-02-26 Shivkumar Kalyanaraman Connectionless internet traffic engineering framework
US20030167322A1 (en) * 2002-03-04 2003-09-04 International Business Machines Corporation System and method for determining weak membership in set of computer nodes
US8321543B2 (en) * 2002-03-04 2012-11-27 International Business Machines Corporation System and method for determining weak membership in set of computer nodes
US6959329B2 (en) 2002-05-15 2005-10-25 Intelliden System and method for transforming configuration commands
US6931608B1 (en) * 2002-06-04 2005-08-16 Cadence Design Systems, Inc. Method and apparatus for determining viability of path expansions
US20040004938A1 (en) * 2002-07-02 2004-01-08 Lucent Technologies Routing bandwidth guaranteed paths with local restoration in label switched networks
US8675493B2 (en) * 2002-07-02 2014-03-18 Alcatel Lucent Routing bandwidth guaranteed paths with local restoration in label switched networks
US20040148369A1 (en) * 2002-07-11 2004-07-29 John Strassner Repository-independent system and method for asset management and reconciliation
US7464145B2 (en) 2002-07-11 2008-12-09 Intelliden, Inc. Repository-independent system and method for asset management and reconciliation
US20040032832A1 (en) * 2002-07-30 2004-02-19 Snehal Desai System and method for determining the shortest path between a pair of nodes in an equal cost network
US7461158B2 (en) 2002-08-07 2008-12-02 Intelliden, Inc. System and method for controlling access rights to network resources
US20040030923A1 (en) * 2002-08-07 2004-02-12 Tindal Glen D. Method and apparatus for protecting a network from attack
US7366893B2 (en) 2002-08-07 2008-04-29 Intelliden, Inc. Method and apparatus for protecting a network from attack
US20060173999A1 (en) * 2002-08-07 2006-08-03 Rider Kenneth D System and method for securing network resources
US7324453B2 (en) 2002-08-30 2008-01-29 Alcatel Lucent Constraint-based shortest path first method for dynamically switched optical transport networks
US20080101256A1 (en) * 2002-09-10 2008-05-01 International Business Machines Corporation System and method for selecting fibre channel switched fabric frame paths
US7327692B2 (en) * 2002-09-10 2008-02-05 International Business Machines Corporation System and method for selecting fibre channel switched fabric frame paths
US20040047294A1 (en) * 2002-09-10 2004-03-11 International Business Machines Corporation System and method for selecting fibre channel switched fabric frame paths
US7558847B2 (en) 2002-09-13 2009-07-07 Intelliden, Inc. System and method for mapping between and controlling different device abstractions
US20040153536A1 (en) * 2002-09-13 2004-08-05 John Strassner System and method for mapping between and controlling different device abstractions
US7215644B2 (en) 2003-03-19 2007-05-08 Alcatel Lucent Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks
US20040184441A1 (en) * 2003-03-19 2004-09-23 Fuming Wu Inter-domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks
US20040264503A1 (en) * 2003-06-30 2004-12-30 Microsoft Corporation Method and system for providing a virtual protocol interlayer
US20070280249A1 (en) * 2003-06-30 2007-12-06 Microsoft Corporation Method and system for providing a virtual protocol interlayer
CN100456673C (zh) * 2003-07-15 2009-01-28 三星电子株式会社 移动专用网络环境中有效发送接收数据的网络设备和方法
US7428271B2 (en) 2003-07-15 2008-09-23 Samsung Electronics Co., Ltd. Network device and data transmission method for efficient data transmission and reception in mobile ad hoc network environment
US7768927B1 (en) * 2003-11-06 2010-08-03 Sprint Communications Company L.P. Method for altering link weights in a communication network to provide traffic information for improved forecasting
US7953011B1 (en) 2003-11-06 2011-05-31 Sprint Communications Company L.P. Method for estimating telecommunication network traffic using link weight changes
US10826818B2 (en) 2004-02-25 2020-11-03 At&T Intellectual Property Ii, L.P. Advertising messages in networks
US9900241B2 (en) 2004-02-25 2018-02-20 At&T Intellectual Property Ii, L.P. Method and apparatus for initiating routing messages in a communication network
US7672331B1 (en) 2004-02-25 2010-03-02 At&T Intellectual Property Ii, L.P. Method and apparatus for initiating routing messages in a communication network
US20060067294A1 (en) * 2004-09-30 2006-03-30 Netravali Arun N Methods and devices for selecting internet routing paths
EP1643699A1 (de) * 2004-09-30 2006-04-05 Lucent Technologies Inc. Verfahren und Anordnung zur Auswahl von Internet-Rouring-Pfaden
US7471632B2 (en) 2004-09-30 2008-12-30 Alcatel-Lucent Usa Inc. Methods and devices for selecting internet routing paths
US20080317183A1 (en) * 2004-11-03 2008-12-25 Huawei Technologies Co., Ltd. Method for Determining Clock Trace Path and Method for Clock Trace in the Network
EP1811713A1 (de) * 2004-11-03 2007-07-25 Huawei Technologies Co., Ltd. Verfahren zur bestimmung des taktverfolgungspfads und verfahren zur taktverfolgung in dem netzwerk
EP1811713A4 (de) * 2004-11-03 2007-12-26 Huawei Tech Co Ltd Verfahren zur bestimmung des taktverfolgungspfads und verfahren zur taktverfolgung in dem netzwerk
US20060146717A1 (en) * 2005-01-05 2006-07-06 Intel Corporation Methods and apparatus for identifying a distance-vector route associated with a wireless mesh network
DE112006000145B4 (de) * 2005-01-05 2013-01-31 Intel Corporation Verfahren und Vorrichtung zum Identifizieren einer Distanz-Vektor-Route, die mit einem drahtlosen Mesh-Netzwerk assoziiert ist
US7697459B2 (en) * 2005-01-05 2010-04-13 Intel Corporation Methods and apparatus for identifying a distance-vector route associated with a wireless mesh network
US9674082B2 (en) 2009-01-09 2017-06-06 Microsoft Technology Licensing, Llc Server-centric high performance network architecture for modular data centers
US20100180048A1 (en) * 2009-01-09 2010-07-15 Microsoft Corporation Server-Centric High Performance Network Architecture for Modular Data Centers
US8065433B2 (en) * 2009-01-09 2011-11-22 Microsoft Corporation Hybrid butterfly cube architecture for modular data centers
US10129140B2 (en) 2009-01-09 2018-11-13 Microsoft Technology Licensing, Llc Server-centric high performance network architecture for modular data centers
US9288134B2 (en) 2009-01-09 2016-03-15 Microsoft Technology Licensing, Llc Server-centric high performance network architecture for modular data centers
US8392607B2 (en) 2009-01-26 2013-03-05 Panasonic Corporation Relay device, control method, and program
US20110047291A1 (en) * 2009-01-26 2011-02-24 Tomoki Ishii Relay device, control method, and program
US20110202682A1 (en) * 2010-02-12 2011-08-18 Microsoft Corporation Network structure for data center unit interconnection
US9197542B2 (en) * 2013-01-31 2015-11-24 Fujitsu Limited Systems and methods of network reconfiguration
US20140215032A1 (en) * 2013-01-31 2014-07-31 Fujitsu Limited Systems and methods of network reconfiguration
US11469988B1 (en) 2021-04-30 2022-10-11 Bank Of America Corporation Communication analysis for dynamic auto-routing and load balancing
US11784930B2 (en) 2021-04-30 2023-10-10 Bank Of America Corporation Communication system with auto-routing and load balancing
US11792108B2 (en) 2021-04-30 2023-10-17 Bank Of America Corporation Dynamic auto-routing and load balancing for communication systems

Also Published As

Publication number Publication date
WO1995018498A1 (en) 1995-07-06
KR960706729A (ko) 1996-12-09
KR100218624B1 (ko) 1999-09-01
JPH09504671A (ja) 1997-05-06
JP3084066B2 (ja) 2000-09-04
EP0736237A1 (de) 1996-10-09
DE69325398D1 (de) 1999-07-22
EP0736237B1 (de) 1999-06-16
DE69325398T2 (de) 2000-01-20

Similar Documents

Publication Publication Date Title
US6016306A (en) Routing bandwidth-reserved connections in information networks
US5535195A (en) Method for efficient aggregation of link metrics
US7158486B2 (en) Method and system for fast computation of routes under multiple network states with communication continuation
US7298704B2 (en) Dynamic path routing with service level guarantees in optical networks
EP0724800B1 (de) Mindestkosten-leitwegsauswahl in verteilten kommunikationsnetzen
US7948996B2 (en) Communicating constraint information for determining a path subject to such constraints
JP4768192B2 (ja) ネットワーク中でデータトラフィックを制御する方法とシステム
US8014291B2 (en) Relaxed constrained shortest path first (R-CSPF)
Taft-Plotkin et al. Quality-of-service routing using maximally disjoint paths
US6606303B1 (en) Method and device in a packet switched network
US5995503A (en) Method and apparatus for providing quality of service routing in a network
US20080253290A1 (en) Optimization of Traffic Distribution in Multipath Routing
US7903563B2 (en) Shortest-path routing optimized for network utilization
US7065045B2 (en) Method and system for providing an optimal path choice for differentiated services
US7397761B2 (en) Routing restorable service-level-guaranteed connections using maximum 2-route flows
US20060209785A1 (en) Dynamic routing in packet-switching multi-layer communications networks
US20020067693A1 (en) Dynamic backup routing of network tunnel paths for local restoration in a packet network
US20040083277A1 (en) Method for fast cost-effective internet network topology design
US5946295A (en) Method of routing and multiplexing demands in a telecommunications network
Pornavalai et al. QoS routing algorithms for pre-computed paths
CA2179713A1 (en) Routing bandwidth-reserved connections in information networks
Matsuura Multipath creation algorithm optimizing traffic dispersion on networks
Wang Survivable label switching networks
Fournié et al. Distributed multi-path and multi-objective routing for network operation and dimensioning
Bak A hierarchical routing method for load-balancing

Legal Events

Date Code Title Description
AS Assignment

Owner name: IBM CORPORATION, NEW YORK

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BOUDEC, J-Y LE;PRZYGIENDA, A. B.;SULTAN, R.;REEL/FRAME:008136/0414;SIGNING DATES FROM 19960606 TO 19960621

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12