+

WO2003003138A2 - Procede et systeme ameliorant la gestion et l'acheminement de trafic sur un reseau - Google Patents

Procede et systeme ameliorant la gestion et l'acheminement de trafic sur un reseau Download PDF

Info

Publication number
WO2003003138A2
WO2003003138A2 PCT/IB2002/001787 IB0201787W WO03003138A2 WO 2003003138 A2 WO2003003138 A2 WO 2003003138A2 IB 0201787 W IB0201787 W IB 0201787W WO 03003138 A2 WO03003138 A2 WO 03003138A2
Authority
WO
WIPO (PCT)
Prior art keywords
network
router
path
destination node
traffic
Prior art date
Application number
PCT/IB2002/001787
Other languages
English (en)
Other versions
WO2003003138A3 (fr
Inventor
Chunsheng Xin
Yinghua Ye
Sudhir Dixit
Original Assignee
Nokia Corporation
Nokia Inc.
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 Nokia Corporation, Nokia Inc. filed Critical Nokia Corporation
Priority to AU2002304386A priority Critical patent/AU2002304386A1/en
Publication of WO2003003138A2 publication Critical patent/WO2003003138A2/fr
Publication of WO2003003138A3 publication Critical patent/WO2003003138A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/825—Involving tunnels, e.g. MPLS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
    • 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/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • 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/60—Router architectures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
    • H04L47/785—Distributed allocation of resources, e.g. bandwidth brokers among multiple network domains, e.g. multilateral agreements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/829—Topology based
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]

Definitions

  • This invention relates to network traffic transport, and more specifically to managing and transport of traffic from a source node or subnet over a network to a destination node or subnet.
  • IP Internet protocol
  • WDM wavelength division multiplexing
  • DWDM dense wavelength division multiplexing
  • IP subnets are interconnected by another network.
  • IP subnetworks are interconnected by an intermediate network composed of a switched optical core.
  • Routers in IP subnets which are directly connected with the intermediate network are called border routers.
  • the border routers are directly connected with the optical core network via an optical cross connect (OXC).
  • OXC optical cross connect
  • the border routers are high speed and capable of statistically multiplexing data streams to the capacity that an OXC supports.
  • a border router can generate and terminate the traffic from an optical label switched path (OLSP), i.e., one lightpath. It may not be desirable or necessary for the non-border router to maintain routing information inside the intermediate network, e.g., optical core.
  • the non-border routers in the IP domain may send the LSP setup request to the border routers. Generally, an established lightpath is needed to carry LSPs across the optical core from a source border router to a destination border router.
  • the lightpaths are set up to carry the LSPs by the border routers.
  • the LSPs between the same source and destination border router are aggregated onto a directed lightpath or existing lightpaths that provide IP connectivity between these two border routers.
  • this method can only accomplish a limited network resource optimization.
  • a network reconfiguration may be applied to optimize the resource utilization, however, such a reconfiguration is inherently static and can only be conducted in a large time scale because the frequent lightpath setup and tear down due to a frequent reconfiguration will result in an undesirable thrash effect for customer traffic and degraded network performance.
  • Fig. la shows a topology diagram of lightpaths in an optical core.
  • Router 22 in network 10 is connected to border router 15.
  • a path ⁇ R2, R3> is established via optical cross connects 20 that exist throughout optical core network 12.
  • Non-border router 22 then initiates a request for a path from border router 15 (Rl) through network 12 to border router 16.
  • a new path ⁇ R1, R3> is established from border router 15 to border router 16 through network 12.
  • Fig. lb shows another topology diagram of lightpaths in an optical core.
  • Border router 15 initiates a request for a path ⁇ R1, R3>.
  • the directed lightpath ⁇ R1, R3> is established from border router 15 to border router 16. As can be seen in Figs, la and lb, these two paths have not shared any resource in network 12.
  • This current method presents several other problems such as: increases the number of connections across the center of the optical network thereby increasing wavelength resources used; increases the blocking probability of a lightpath setup across the center of the optical core; presents unbalanced load distribution problems; and increases setup delay since new lightpaths are established for each request.
  • Fig. 2 shows a topology diagram of management of lightpaths through a network to different destinations. Lightpaths between routers are shown as dotted lines.
  • Label switched router (LSR) 70 border router
  • LSR 70 further has an established path from IP subnet 60 through network 62 to LSR 76 at IP subnet 64.
  • LSR 72 at IP subnet 60 has established paths from EP subnet 60 through network 62 to LSR 78 at IP subnet 66 and from IP subnet 60 through network 62 to LSR 76 at IP subnet 64.
  • Paths from LSR 70 and LSR 72 may enter network 62 at optical cross connect 74 before traveling through other optical cross connects in network 62 to their destination subnets. This is inefficient management of routing considering that there are two separate paths carrying traffic between the same source and destination subnets, i.e., two paths between EP subnets 60 and 66, and two paths between EP subnets 60 and 64.
  • the traffic may pass several intermediate nodes that process the traffic electronically. This causes a glass ceiling effect because of the limits of electronic processing, e.g., IP or Asynchronous Transfer Mode (ATM) buffering/classification/scheduling.
  • IP IP or Asynchronous Transfer Mode
  • ATM Asynchronous Transfer Mode
  • This approach increases equipment costs, plant space requirements, and cannot keep pace with full, multi-wavelength line rates.
  • the virtual topology design such as how connections among the optical nodes are determined, becomes very critical to providing good performance.
  • a second approach also known as an overlay model or client server model, provides a separation of EP and optical domains.
  • IP routers are the client, and the optical network is the server.
  • this model is similar to "circuit-layer" interworkings, e.g., IP-over- ATM incarnations such as Multiprotocol Over Asynchronous Transfer Mode (MPOA).
  • MPOA Multiprotocol Over Asynchronous Transfer Mode
  • scalability is a critical factor and requires ⁇ (n 3 ) control message flooding and ⁇ (n ) client connections, where ⁇ represents the magnitude order and n represents the number of border routers.
  • the EP routers submit connection requests to an optical controller and the optical controller allocates the lightpaths to those requests.
  • an optical cross connect is treated as a network element, e.g., a label switched router (LSR).
  • LSR label switched router
  • GPLS General Multiprotocol Label/Lambada switching
  • Lightpaths are requested by LSRs.
  • the number of connections will be ⁇ (n 2 ) where n is the number of LSRs in the network.
  • the present invention is directed to a method for efficient management and transport of traffic over a network that includes: storing the available bandwidth capacity of paths in a network in a first router; receiving a request at the first router from a network node of a second network for a signaled path through the network to a destination node; and examining the paths by the first router and assigning the signaled path to a path from the first router to the destination node.
  • the path may or may not be an existing path to the destination node through the network.
  • the present invention is directed to a method for efficient management and transport of traffic over a network that includes: leaking the available bandwidth capacity of paths in a network to a first router by the network; receiving a request at the first router from a network node of a second network for a signaled path through the network to a destination node; and examining all paths by the first router and assigning the signaled path to a path from the first router to the destination node using an existing path to the destination node through the network.
  • the present invention is further directed to a method for efficient management and transport of traffic over a network that includes: receiving a request at a first router from a network node of a second network for a signaled path through a network to a destination node; requesting information from the network by the first router; receiving the information by the first router, the information including the available bandwidth capacity of paths in a network; and examining paths by the first router using the information and assigning the signaled path to a path from an intermediate node to the destination node using an existing path to the destination node through the network.
  • the present invention is directed to a method for efficient management and transport of traffic over a network that includes: receiving a request at a first router from a network node of a second network for a signaled path through a network to a destination node; requesting information from the network by the first router; receiving the information by the first router, where the information includes the available bandwidth capacity of paths in a network and a list of routers close to the destination node; and examining paths by the first router using the information and assigning the signaled path to a path from an intermediate node to the destination node
  • the present invention is also directed to a method for efficient management and transport of traffic over a network comprising: monitoring traffic between the second network through the first network to one or more remote network by a mobile agent candidate at the second network; and assigning traffic between the second network through the first network to each remote network by the mobile agent to a different one of one or more routers, where new traffic from the second network to one remote network may be assigned to the one router assigned to that one remote network.
  • the present invention is directed to a router that includes a database, a decision module, a mapping and aggregation module, an LIB agent module, a routing and wavelength assignment module, a traffic monitoring module, and a mobile agent selection module.
  • the database stores information regarding the available bandwidth capacity of paths in a network.
  • the decision module receives a request for a path to route traffic through the network and uses the information to return a sequence of paths in the network to handle the traffic.
  • the LIB agent module shares and collects the information from other routers and performs signaling.
  • the routing and wavelength assignment module computes and selects paths and assigns wavelengths.
  • the mapping and aggregation module aggregates the traffic to existing paths that have enough bandwidth to carry the traffic.
  • the traffic monitoring module monitors the traffic load initiating from the subnet.
  • the mobile agent selection module uses the results of the monitoring to choose or de-select a router to manage the traffic through the sequence of paths.
  • the present invention is further directed to a system for efficient management and transport of traffic that includes a first network having a source node, a second network having a plurality of paths through the second network, a third network having a destination node, and a router operably connected to the first network and the second network.
  • the router receives a request from the source node for a path through the second network to route traffic from the first network to the destination node at the third network.
  • the router routes the traffic using an existing path to the destination node through the second network.
  • New traffic from the first network to the destination node at the third network may be assigned to a router assigned to handle traffic to the destination node at the third network.
  • Fig. la is a topology diagram of lightpaths in an optical core
  • Fig. lb is another topology diagram of lightpaths in an optical core
  • Fig. 2 is a topology diagram of management of lightpaths through a network to different destinations
  • Fig. 3 is a block diagram of a border router according to an example embodiment of the present invention.
  • Figs. 4a and 4b are topology diagrams of transport of traffic according to example embodiments of the present invention.
  • Fig. 5 is a topology diagram of traffic management using a mobile agent according to an example embodiment of the present invention.
  • Fig. 6 is a topology diagram of traffic management using a mobile agent where traffic volume is light according to an example embodiment of the present invention.
  • the present invention relates to methods and systems for efficient management and transport of traffic over a network where existing paths through a network are used to aggregate new traffic. This maximizes the use of existing paths while maintaining bandwidth requirements for each individual path.
  • a mobile agent may be used to manage traffic destined to other subnets over a network by assigning to border routers all or part of the traffic between the source network of the border router and that destination network.
  • IP subnets which may or may not contain the border routers
  • an optical core network (which may or may not contain border routers), where traffic is passed through from a source border router to a destination border router in another network, will also be used.
  • the present invention is not limited to EP subnets or optical core networks but any networks (e.g., Asynchronous Transfer Mode (ATM) networks, frame-relay networks, etc.) are within the spirit and scope of the present invention.
  • ATM Asynchronous Transfer Mode
  • FIG. 3 shows a block diagram of a border router according to an example embodiment of the present invention.
  • a lightpath information base (LIB) 40 stores the available bandwidth capacity of paths over a network, e.g., optical core.
  • the bandwidth of locally originating paths may be provided by a local border router.
  • Bandwidth information of all other paths may be obtained via an LEB agent 42.
  • Border routers communicate with each other via LEB agent 42 to collect path bandwidth information into LEB 40.
  • a centralized approach may be used to synchronize the LEBs in all border routers.
  • each LEB agent may communicate with a central controller.
  • a distributed approach may be desirable to distribute the bandwidth information.
  • LEB 40 may be implemented using a fast look up table, such as a hash table or a search tree.
  • LEB agent 42 may be implemented by extending an interior gateway protocol (IGP) used in the routing process.
  • IGP interior gateway protocol
  • OSPF a lightpath link state advertisement
  • LSA lightpath link state advertisement
  • an LIB agent may be implemented using a simple TCP-based message processing application. Some message types may need to be defined and an OSPF-like flooding mechanism may need to be used.
  • the IGP control channels among border routers may be utilized as the communication channels between LIB agents.
  • interior gateway protocol such as OSPF, some sort of IP connectivity may be required for the IGP to work.
  • Decision process 44 may be a function that takes a LSP request and uses the information in LIB 40 to determine and return a lightpath sequence.
  • An LSP request may contain the bandwidth requirement and two border routers (i.e., source border router and destination) between which the traffic crosses the optical core.
  • En a lightpath sequence returned by decision process 44 there may be some lightpaths that do not exist and need to be set up.
  • Decision process 44 examines all lightpaths and tries to aggregate the LSP to existing lightpaths and, if necessary, establish new lightpaths which require less resources compared with establishing a direct lightpath for the LSP. The aggregation may shift the load to the edge from the center in the optical network and improve the network resource utilization. If such an aggregation cannot be found, decision process 44 outputs a lightpath sequence which contains one lightpath to be established between the source and destination border routers of the LSP.
  • LEB agent 42 is responsible for signaling and information collecting. Signaling functions include connection set up, tear down, query, abort, and failure notification, etc. In addition, LEB agent can also request a remote node to establish a lightpath from that remote node to another node. RSVP and CR-LDP may be used for this purpose. An LEB agent is also responsible for resource discovery and information exchange. Each LEB agent may exchange path information with other border routers by sending the locally originating path information and receiving path information originating at other border routers. Therefore, through LEB agent 42, each individual border router maintains bandwidth information of all or some paths over the optical core in its LEB 40.
  • Routing and wavelength assignment process 46 is a component that computes and selects paths and assigns wavelengths. Routing and wavelength assignment processes optical LSP (lightpath) requests, and handles the wavelength allocation in the optical network. There are many RWA algorithms available for this purpose, e.g., first-fit, leased-cost, maxed-sum, etc. There are two scenarios in terms of routing and signaling of lightpaths. In scenario 1 , each border router has the full connectivity information of the optical core in the border routers. The border router computes the routing path across the optical core and initiates the signaling procedure to the optical cross connects along the routing path to set up a lightpath. In this scenario, the EP -centric routing and signaling protocols with appropriate optical extension may be used.
  • a link state routing protocol such as open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS), may be used for the lightpath routing, and reservation protocol (RSVP)-TE or CR-LDP may be used for the lightpath establishment.
  • OSPF open shortest path first
  • IS-IS intermediate system-intermediate system
  • RSVP reservation protocol
  • CR-LDP CR-LDP
  • the optical core may appear as a cloud to the EP domain.
  • Each border router may have the reachability information of other border routers and may request the optical core to set up a lightpath to a destination border router through user network interface (UNI) signaling.
  • the optical core computes the routing path and initiates the signaling procedure.
  • the routing and signaling is as simple as only requesting a lightpath via UNI.
  • the address or reachability information of other border routers is obtained through UNI query or automatic leaking by a protocol like border gateway protocol (BGP).
  • Border gateway protocol BGP
  • Mapping and aggregation process 48 sets up a LSP over a lightpath sequence in which each lightpath has been established and has enough available bandwidth to carry the LSP.
  • the mapping and aggregation process maps EP LSPs which may have the same destination subnets over a optical LSP. It also updates the bandwidth availability information on optical LSP which carries the data traffic.
  • the utilization of optical LSPs may be updated and exchanged by LEB agents. Every intermediate border router (i.e., termination border router of each lightpath in the lightpath sequence) updates its routing and forwarding table to store the LSP information.
  • the pertinent lightpath information in LIB 40 of each intermediate border router may then updated and exchanged by each LIB agent 42 to all other border routers.
  • Figs. 4a and 4b show topology diagrams of transport of traffic according to example embodiments of the present invention.
  • This figure is identical to Fig. 1 except that Fig. 4a shows the routing path from border router 15 to destination border router 16 according to the present invention.
  • Border router 15 receives a request for a path through network 12 from non-border router 22 at IP subnet 10. Border router 15, using the capacity and bandwidth information, determines that a path already exists between border router 14 and destination border router 16. Border router 15, therefore, creates a path from border 15 through optical cross connects to border router 14 and then utilizes the existing path from border router 14 to border router 16.
  • the border routers may be part of the source network (e.g., 10), the network that the path traverses through (e.g., 12), or a third network and still be within the spirit and scope of the present invention.
  • each border router also may contain information related to a list of border routers that are close to it in the routing distance in the optical core. This list is named a collaboration group (CRG).
  • CRG collaboration group
  • border routers 14 and 17 are both in the CRG of border router 15 since border router 15 only needs to go one hop in the optical core to set up a lightpath to either border router 14 or border router 17.
  • CRG information may be obtained through different methodologies.
  • each border router may compute its CRG via the topology database.
  • the reachability together with routing distance of other border routers may need to leaked to each border router through the optical core. Every border router may then compute its CRG based on such information.
  • the routing information of the optical core may be completely hidden from the border routers and the border router only may request lightpath services through a UNI, the UNI may need to be extended to provide not only the address of other border routers but also the routing distance to those border routers.
  • each border router may maintain a CRG.
  • the source border router attempts to aggregate the LSP onto an existing lightpath between the source and destination border routers. If this is not possible, the source border router examines its own CRG to find a border router, namely relay router, that has an existing lightpath to the destination border router that has enough available bandwidth to carry the requested LSP. If a relay router is found, then the source border router makes a decision to utilize an existing lightpath and/or a new lightpath from itself to the relay router.
  • a lightpath is composed by concatenating the lightpath from the source border router to the relay router (which may need to be set up), and the existing lightpath from the relay router to the destination border router.
  • the source border router examines the destination border routers CRG, via signaling, and attempts to find a relay router to which the source border router has an existing lightpath. If a relay router is found, the source border router requests the relay router to setup a lightpath from the relay router to the destination border router as shown in Fig. 4b. If a relay router cannot be found, a lightpath sequence may be composed of setting up only a direct lightpath between the source and destination border routers.
  • the first scenario corresponds to the peer network model
  • the second scenario corresponds to the augmented and overlay models.
  • IGP P-centric interior gateway protocols
  • signaling protocols e.g., RSVP-TE or CR-LDP
  • ETF standard IGPs e.g., OSPF or IS-IS
  • RSVP-TE or CR-LDP signaling protocols
  • each border router may have the reachability information of other border routers and can request the optical core to set up a lightpath to a destination border router through the user network interface (UNI) signaling.
  • UNI user network interface
  • two separate routing instances may have to be established.
  • One instance may be used inside the optical core for lightpath routing.
  • Another instance may be used among the border routers.
  • an overlay topology may be established across the optical core and used as the control channels of the border routers routing instance.
  • the control channels may be a dedicated wavelength in a link between two nodes (e.g., a border router or optical cross connect (OXC)). Therefore, in both scenarios, the LIB agents may use the IGP control channels of the border routers to communicate with each other.
  • Mapping and aggregation process 48 may be implemented by the label mapping and stacking mechanism in multiprotocol label switching (MPLS).
  • MPLS multiprotocol label switching
  • the LSPs originating from non-border routers may be stacked onto an OLSP on the optical core.
  • the relay router pops the LSPs from OLSP originating at the source border router and pushes onto another OLSP terminating at the destination border router.
  • the decision process and routing and signaling may be invoked to establish the lightpath sequence which may be used to aggregate the LSP by the mapping and aggregation process.
  • each lightpath in the lightpath sequence may be taken as a virtual hop, and the whole lightpath sequence may be taken as a strict exclusive subroute and inserted into the explicit route of the LSP request with the subroute sitting between the source and destination border routers. Then, the normal MPLS LSP signaling can continue as in a traditional EP network. During this time, the border routers communicate with each other using the established lightpaths since they are seen as virtually to provide IP connectivity. Border routers may not need LEB agents to send or receive information to perform the normal MPLS LSP signaling as in the collection of lightpath bandwidth information for LIB 40.
  • border routers may be candidates for taking the role of agents.
  • Traffic monitoring process 50 and mobile agents selection process 52 may be included in border routers.
  • An agent delivers traffic to certain destinations. Once an agent is chosen, LSPs (possibly from non-border routers) going to the certain destination network (e.g., EP subnet) go through the agent node. After traffic aggregation, an agent router maps these LSPs into optical LSPs if there are existing optical LSPs between the source network and the destination network. Otherwise, the agent router may be responsible to set up connections (that are needed but don't exist) over the optical network. Routing and wavelength assignment process 46 and decision process 44 allocate the corresponding route and wavelength for optical LSPs.
  • Mobile agent selection process 52 chooses an agent from border routers according to the results from traffic monitoring process 50. If the traffic load is heavy, the number of agents may be increased and, conversely, if traffic is light, there may be no dedicated agent needed. Mobile agent selection process 52 may flexibly select any border router as an agent. Mobile agent process 52 may use a centralized approach, where one of the border routers decides who is agent for each of the destination networks. A distributed approach may also be used where an election method may be adopted according to traffic demands and LEB information. Since the agent is "mobile", once a border router failure happens, other border routers may quickly take the role of the failed border router (i.e., agent) thus reliability is increased.
  • Fig. 5 shows a topology diagram of traffic management using a mobile agent according to an example embodiment of the present invention.
  • Border routers 70 and 72 of source network 60 each handle dedicated traffic between EP subnet 60 and EP subnets 66 and 64 respectively.
  • Border router 70 handles the routing of traffic from IP subnet 60 through network 62 to destination border router 78 at IP subnet 66.
  • border router 72 handles all traffic between source subnet 60 and destination border router 76 at EP subnet 64.
  • network 62 is shown as an optical core network for illustration, network 62 may be any network and still be within the spirit and scope of the present invention, for example, an ATM, frame relay, X.25, EP, etc.
  • IP subnet 60 selects border router 70 as an agent to connect with EP subnet 66.
  • Border router 72 is also selected by EP subnet 60 as the agent to set up connections with and communicate to P subnet 64.
  • border routers 70 and 72 handle all the traffic outgoing and incoming from subnet 66 and subnet 64, respectively. Therefore, after traffic aggregation at each agent, the number of connections through network 62 can be greatly reduced.
  • Fig. 6 shows a topology diagram of traffic management using a mobile agent where traffic volume is light according to an example embodiment of the present invention.
  • traffic volume is light between a source network and a destination network
  • a direct connection between the two networks may not be necessary, and the approach applied for the border routers can be adopted.
  • subnet 60 has a LSP request to subnet 66, demanding 50% or less bandwidth of a lightpath capacity.
  • EP subnet 60 is aware that a connection exists between border router 72 of EP subnet 60 and IP subnet 64 which is a neighbor of EP subnet 66.
  • EP subnet 60 also knows that this connection between EP subnet 60 and EP subnet 64 is under utilized (i.e., 50% or less).
  • Border router 70 may currently handle traffic to destination network 66.
  • Subnet 60 may then deselect border router 70 and forward the traffic from border router 70 (destined to subnet 66) to border router 72.
  • Border router 72 may then set up a lightpath to EP subnet 66 and aggregate the fraffic further from border router 76 at EP subnet 64 to border router 80 at EP subnet 64.
  • the traffic then travels from IP subnet 64, border router 80 to EP subnet 66 through border router 82 at IP subnet 66. Therefore, the traffic is pushed away from the center of network 62 to the edge, therefore, allowing more connections inside network 62 to be accommodated.
  • the agent for a destination network may be moved among the border routers.
  • the mobile agent process may be accomplished using a centralized approach where one border router decides who is agent for other subnets, or a distributed approach where an election method may be adopted depending on the traffic demands and LEB information.
  • the traffic monitoring process determines whether a load is heavy or light.
  • a traffic monitoring process in border routers monitor the EP traffic in each queue for different destination network traffic. For each destination network there may be an associated queue corresponding to it. When traffic volume achieves certain levels, a new agent may be needed to be assigned for that traffic destination network. When the traffic drops below a certain level, the role of one or more border routers as an agent may be eliminated.
  • mobile agent selection process may be implemented by using a centralized approach or distributed approach.
  • one of the border routers is designated as a controller to collect the traffic information from all border routers, and to compute how many agents are needed for specific network connections and where the agents should be put. Once the decision is made, the controller may broadcast the decision to the whole subnet. The fraffic which has the same subnet destination may be groomed and mapped into the same optical connection.
  • every border router exchanges the traffic information (such as queue length and existing optical LSPs). Every border router works independently to decide whether it will be the agent or whether other border routers need to work as co- agents for a subnet connection.
  • information will be exchanged, including link state protocols (IS-IS, or OSPF).
  • a constraint based routing may take a role as a traffic engineering to select paths for P LSPs.
  • Methods and systems according to the present invention have several advantages. Specifically, network resources are saved, load balancing may be performed, efficient support of small bandwidth requirements of LSPs occurs, an alternative if a direct lightpath cannot be established between two border routers is provided, elegant integration of EP layered granularity with optical layered granularity is provided, routing of traffic between border routers followed by aggregation takes advantage of the lightpath loading of the optical core at the edge and heavy loading in the center of the optical core, effectively relieves the wavelength exhausting in optical core network, improves optical network availability, enhances network survivability, improves network scalability, simplifies the optical network virtual topology design, simplifies control and signaling mechanisms in optical networks, dynamically applies EP aware traffic control at the optical edge and traffic aggregation in border routers (LSRs), provides an alternative approach if the direct connection between two networks doesn't exist, and balances fraffic load in EP over wavelength division multiplexing (WDM) network.
  • LSRs border routers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur un procédé et sur un appareil améliorant la gestion et l'acheminement de trafic sur un réseau. La capacité en largeur de bande disponible des voies du réseau peut être mémorisée dans un premier routeur. Une demande peut être reçue par le premier routeur en provenance d'un noeud de réseau d'un second réseau, cette demande portant sur une voie de signal du réseau aboutissant au noeud de destination. Les voies peuvent être examinées par le premier routeur et la voie de signal affectée à une voie allant du premier routeur et aboutissant au noeud de destination en utilisant une voie existante du réseau. D'autre part, tout trafic s'effectuant d'un sous-réseau à un réseau de destination donné peut être traité par un ou plusieurs agents mobiles au niveau du sous-réseau. Un ou plusieurs agents mobiles peuvent être affectés à tout ou partie du trafic sur la base de la charge de la voie courante.
PCT/IB2002/001787 2001-06-27 2002-05-23 Procede et systeme ameliorant la gestion et l'acheminement de trafic sur un reseau WO2003003138A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2002304386A AU2002304386A1 (en) 2001-06-27 2002-05-23 Method and system for efficient management and transport of traffic over a network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US89137801A 2001-06-27 2001-06-27
US09/891,378 2001-06-27

Publications (2)

Publication Number Publication Date
WO2003003138A2 true WO2003003138A2 (fr) 2003-01-09
WO2003003138A3 WO2003003138A3 (fr) 2003-04-17

Family

ID=25398086

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2002/001787 WO2003003138A2 (fr) 2001-06-27 2002-05-23 Procede et systeme ameliorant la gestion et l'acheminement de trafic sur un reseau

Country Status (3)

Country Link
US (1) US8320254B2 (fr)
AU (1) AU2002304386A1 (fr)
WO (1) WO2003003138A2 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7039672B2 (en) 2002-05-06 2006-05-02 Nokia Corporation Content delivery architecture for mobile access networks
WO2009116019A3 (fr) * 2008-03-17 2009-11-12 Alcatel Lucent Procédé et appareil assurant une connectivité logique totale dans des réseaux à commutation d'étiquettes multiprotocole

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7685311B2 (en) * 1999-05-03 2010-03-23 Digital Envoy, Inc. Geo-intelligent traffic reporter
WO2002089508A1 (fr) * 2001-04-25 2002-11-07 Nokia Corporation Reseau de telecommunication comprenant au moins deux unites de reseau, et procede de communication
US7171124B2 (en) * 2001-07-19 2007-01-30 Lucent Technologies Inc. Wavelength routing and switching mechanism for a photonic transport network
US7218852B1 (en) * 2001-12-21 2007-05-15 Ciena Corporation System and method for optical light path discovery
US7292542B2 (en) * 2003-03-05 2007-11-06 At&T Bls Intellectual Property, Inc. Method for traffic engineering of connectionless virtual private network services
US8655173B2 (en) * 2007-09-21 2014-02-18 Futurewei Technologies, Inc. Extending routing protocols to accommodate wavelength switched optical networks
US7860027B2 (en) * 2007-11-21 2010-12-28 Cisco Technology, Inc. Extending an IP everywhere network over a plurality of flooding domains
US20100166420A1 (en) * 2008-12-22 2010-07-01 Electronics And Telecommunications Research Institute Apparatus and method for controlling route and resource in packet-optic convergence network
US8443107B2 (en) 2009-11-11 2013-05-14 Digital Envoy, Inc. Method, computer program product and electronic device for hyper-local geo-targeting
US8346965B2 (en) * 2010-11-09 2013-01-01 Fujitsu Limited Systems and methods for multi-layer traffic grooming
US9210046B2 (en) * 2011-03-14 2015-12-08 Hewlett Packard Enterprise Development Lp Zone-based network traffic analysis
US9083627B2 (en) * 2011-12-20 2015-07-14 Cisco Technology, Inc. Assisted traffic engineering for minimalistic connected object networks
US9112793B2 (en) 2012-05-31 2015-08-18 International Business Machines Corporation End-to-end multipathing through network having switching devices compatible with different protocols
US9118573B2 (en) * 2012-05-31 2015-08-25 International Business Machines Corporation Multipath effectuation within singly contiguous network fabric via switching device routing logic programming
JP6939726B2 (ja) * 2018-07-17 2021-09-22 日本電信電話株式会社 攻撃対処箇所選択装置及び攻撃対処箇所選択方法
US10721168B1 (en) * 2019-03-15 2020-07-21 Juniper Networks, Inc. Utilizing constraint optimization for egress peer engineering to determine optimized traffic plans and to implement an optimized traffic plan

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5029164A (en) * 1990-04-13 1991-07-02 Digital Equipment Corporation Congestion avoidance in high-speed network carrying bursty traffic
EP0594196B1 (fr) * 1992-10-22 1999-03-31 Cabletron Systems, Inc. Sélection d'adresses de paquets de communications par hashing et une mémoire associative
US6175870B1 (en) * 1995-11-30 2001-01-16 Lucent Technologies Inc. Method of admission control and routing of virtual circuits
US6108304A (en) * 1996-03-08 2000-08-22 Abe; Hajime Packet switching network, packet switching equipment, and network management equipment
US5917820A (en) * 1996-06-10 1999-06-29 Cisco Technology, Inc. Efficient packet forwarding arrangement for routing packets in an internetwork
US5856923A (en) * 1997-03-24 1999-01-05 Micron Technology, Inc. Method for continuous, non lot-based integrated circuit manufacturing
US6341127B1 (en) * 1997-07-11 2002-01-22 Kabushiki Kaisha Toshiba Node device and method for controlling label switching path set up in inter-connected networks
US6711152B1 (en) * 1998-07-06 2004-03-23 At&T Corp. Routing over large clouds
US6697361B2 (en) * 1998-09-15 2004-02-24 Nortel Networks Limited Method and apparatus for stream aggregation in a multiprotocol label switching network environment
US6563793B1 (en) * 1998-11-25 2003-05-13 Enron Warpspeed Services, Inc. Method and apparatus for providing guaranteed quality/class of service within and across networks using existing reservation protocols and frame formats
US6363319B1 (en) * 1999-08-31 2002-03-26 Nortel Networks Limited Constraint-based route selection using biased cost
SE521516C2 (sv) * 1999-09-14 2003-11-11 Ericsson Telefon Ab L M Anordning och förfarande relaterande till routing ett nätverk
US6671256B1 (en) * 2000-02-03 2003-12-30 Alcatel Data channel reservation in optical burst-switched networks
JP4150159B2 (ja) * 2000-03-01 2008-09-17 富士通株式会社 伝送経路制御装置及び伝送経路制御方法並びに伝送経路制御プログラムを記録した媒体
JP4388667B2 (ja) * 2000-04-12 2009-12-24 富士通株式会社 ラベルスイッチングネットワークにおけるパス設定装置および方法
JP3501093B2 (ja) * 2000-04-18 2004-02-23 日本電気株式会社 ＱｏＳ経路計算装置
US7299284B2 (en) * 2000-05-19 2007-11-20 Scientific-Atlanta, Inc. Solicitations for allocations of access across a shared communications medium
US6996065B2 (en) * 2000-07-06 2006-02-07 Lucent Technologies Inc. Dynamic backup routing of network tunnel paths for local restoration in a packet network
US7158515B1 (en) * 2000-07-06 2007-01-02 Nortel Networks Limited Method of optical network bandwidth representation for optical label switching networks
US7283477B1 (en) * 2000-08-24 2007-10-16 Nortel Networks Limited Allocating network resources
US7319700B1 (en) * 2000-12-29 2008-01-15 Juniper Networks, Inc. Communicating constraint information for determining a path subject to such constraints
US6956821B2 (en) * 2001-01-30 2005-10-18 Telefonaktiebolaget L M Ericsson (Publ) Path determination in a data network
US6947669B2 (en) * 2001-03-07 2005-09-20 Meriton Networks Inc. Generic optical routing information base support
US6914886B2 (en) * 2001-05-03 2005-07-05 Radware Ltd. Controlling traffic on links between autonomous systems

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7039672B2 (en) 2002-05-06 2006-05-02 Nokia Corporation Content delivery architecture for mobile access networks
WO2009116019A3 (fr) * 2008-03-17 2009-11-12 Alcatel Lucent Procédé et appareil assurant une connectivité logique totale dans des réseaux à commutation d'étiquettes multiprotocole
US8155028B2 (en) 2008-03-17 2012-04-10 Alcatel Lucent Method and apparatus for providing full logical connectivity in MPLS networks

Also Published As

Publication number Publication date
AU2002304386A1 (en) 2003-03-03
US20050271038A1 (en) 2005-12-08
US8320254B2 (en) 2012-11-27
WO2003003138A3 (fr) 2003-04-17

Similar Documents

Publication Publication Date Title
US11451471B2 (en) Using PCE as SDN controller
US8320254B2 (en) Method and system for efficient management and transport of traffic over a network
EP1395003B1 (fr) Procédé de routage selon le plus court chemin à base de contraintes pour des réseaux optiques de transport commutés dynamiquement
US7212526B2 (en) Method and apparatus for composing virtual links in a label switched network
US7860392B2 (en) Optical network topology databases based on a set of connectivity constraints
US9559944B2 (en) Method and related apparatus for establishing link-diverse traffic paths in a telecommunications network
US7031299B2 (en) Control of optical connections in an optical network
Rouskas et al. A tutorial on optical networks
US7580359B2 (en) Method and system for maximizing network capacity utilization in multiprotocol label switched networks by moving label switched paths
EP3979598B1 (fr) Contrainte de bande passante pour un routage de segments à trajets multiples
Yao et al. A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks
WO2007099286A1 (fr) Commutation multiprotocole par étiquette
Zheng et al. Toward automated provisioning of advance reservation service in next-generation optical Internet
Jue Lightpath establishment in wavelength-routed WDM optical networks
WO2007069256A2 (fr) Partage de ressources entre des tunnels de réseau
US7412168B2 (en) MPLS application to optical cross-connect using wavelength as a label
Durresi et al. IP over all-optical networks-issues
Pal GMPLS based Multilayer Service Network Architecture
Murtaza et al. An Advanced Practice for Congestion Control, Routing and Security Issues in Multi Protocol Label Switching (Mpls)
Datta et al. New schemes for connection establishment in gmpls environment for wdm networks
Khair An implementation approach for an inter-domain routing protocol for DWDM
Martinez et al. Architecture and implementation of a resilient control plane for optical networks based on GMPLS OSPF-TE
Assi et al. Real-time provisioning of optical communication networks
Yu Signaling and Control of Dynamically Switched Optical Networks
Shami Traffic engineering in hybrid, IP-centric DWDM-based optical networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

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

AL Designated countries for regional patents

Kind code of ref document: A2

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

121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载