M. Kodialam and T. V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering" Proc. IEEE INFOCOM 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Minimum Interference Hybrid Algorithm for MPLS Networks - Banglore (Correct)
....route update messages. These algorithms compute the route based on the current network circumstances. Existing algorithms for dynamic TE include the Minhop algorithm[4] the Widest Shortest Path algorithm[5] the Shortest Widest Path algorithm[5] the Minimum Interference Routing Algorithm (MIRA)[1] and the Hybrid algorithm[3] The Minhop algorithm tries to optimize on the path length by nding the path with minimum number of hops in the feasible network. This algorithm does not take into consideration factors like utilization and interference. The Widest Shortest Path algorithm nds the ....
....into account the interference factor. Minimizing Interference The goal of the Minimum Interference Routing Algorithm (MIRA) is to accommodate as many requests as possible. The idea is to use those paths which do not interfere too much with future LSP demands between other source destination pairs[1]. This algorithm assumes that there is some knowledge about the potential ingress egress pairs. Knowledge about potential ingress egress pairs helps in routing new trac along paths which are not critical to future requests, thus reducing the number of request rejections. The following is the ....
Murli Kodialam, T.V.Laksham, \Minimum Interference Routing with Applications to MPLS Traf- c Engineering", June 2000.
A Minimum Interference Routing Algorithm - Figueiredo, Fonseca, Monteiro (2003) (Correct)
....central idea behind these algorithms is that the larger the available maximum ow, the smaller is the blocking probability of requests for an SD pair. Therefore, minimum interference algorithms try to route a bandwidth request into paths which maximizes the available maximum ow of others SD pairs [2]. This is an NP hard problem, and heuristics have been proposed to deal with this problem. The Minimum Interference Routing Algorithm MIRA [2] which rstly introduced the terminology minimum interference , assumes that both SD pairs and the network topology are known. Besides, it assumes the ....
....pair. Therefore, minimum interference algorithms try to route a bandwidth request into paths which maximizes the available maximum ow of others SD pairs [2] This is an NP hard problem, and heuristics have been proposed to deal with this problem. The Minimum Interference Routing Algorithm MIRA [2], which rstly introduced the terminology minimum interference , assumes that both SD pairs and the network topology are known. Besides, it assumes the existence of a signaling protocol, which is responsible for the di usion of the network topology, the residual band and route information. The ....
[Article contains additional citation context not shown here]
M. S. Kodialam and T. V. Lakshman, \Minimum interference routing with applications to MPLS trac engineering," in INFOCOM (2), 2000, pp. 884-893. [Online]. Available: citeseer.nj.nec.com/kodialam00minimum.html
Different Algorithms for Normal and Protection - Paths Rajarshi Gupta (Correct)
....Path: To calculate the normal path for the request, we need to employ an algorithm that is distributed and source based. The most common such algorithms are shortest path algorithms like Dijkstra [7] and we can utilize these (see Section V) We consider variations like Minimum Interference Routing [8]. All algorithms, however, should meet certain conditions. A link may not reserve more traffic than it has capacity for Shorter paths are preferred because they consume fewer network resources Critical resources, e.g. residual bandwidth in bottleneck link, should be preserved for future ....
....first two topologies a small subset of the nodes are chosen to be source destination pairs. In the third topology, almost all node pairs act as source destination pairs. 1) MIRA Topology: Consider the network shown in Figure 1 (This is the same topology used to demonstrate the performance of MIRA [8]) Four pairs of nodes on the edge of the network are chosen as source destination pairs. The thin links can carry up to # calls while the fat links can carry up to ## calls. Thus, the thin and fat links represent OC 12 and OC 48 links respectively. All call arrival processes are S 3 0 1 2 ....
M. Kodialam and T. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering," IEEE INFOCOM 2000.
Survivable Lightpath Routing: A New Approach to the Design.. - Modiano, Narula-Tam (2002) (3 citations) (Correct)
....1 Furthermore, this simplified solution can be wasteful of resources. For many logical topologies, some of the lightpaths can be routed together while maintaining survivability. Of course, there has been a significant body of work in the area of optical network protection [2] 7] 14] [16]. Most previous work in WDM network protection is focused on restoration mechanisms that restore all lightpaths in the event of a physical link failure. Link based restoration recovers from a link failure by restoring the failed physical link, hence, simultaneously restoring all of the associated ....
M. Kodialam and T. V. Lakshman, "Minimum interference routing with application to MPLS traffic engineering," presented at the Infocom, 2000.
Efficient Network Resource Allocation With QoS Guarantees - Gopalan (2003) (Correct)
....network. However, the drawback of this approach (as also that of SP and WSP) is that it assumes all nodes in the network to be potential traffic sources or sinks; in reality only a small subset of nodes in the network form ingress egress pairs. The Minimum Interference Routing Algorithm (MIRA) [26] is an online technique for routing bandwidth guaranteed flows that improves upon earlier techniques by minimizing the interference of routes with critical links of the network. MIRA was the first algorithm that used the knowledge of all ingress egress pairs in the network to make intelligent ....
M.S. Kodialam and T.V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Proc. of INFOCOM'2000.
Routing Bandwidth Guaranteed Paths with Local.. - Li, Buddhikot.. (2002) (1 citation) (Correct)
....labs.com) setup policy and quality of service (QoS) constrained label switched paths (LSPs) between network nodes. The QoS constraint in the form of minimum or peak bandwidth guarantee per LSP has been considered most commonly in literature[3, 1, 10]. Such constraint based routing [3, 5] is central to network traffic engineering [3, 2] and basic constructs of several new network services such as layer3 provider provisioned VPNs (PPVPN) 15] and layer 2 PPVPNs [4] Specific examples of such constructs are the VPN tunnels in L3 PPVPNs, and the ....
....2.4 Network State Information In our work we focus on online routing algorithms that route a new path request based only on the knowledge of current state of the network and do not exploit properties of future requests. One can design schemes with varying degrees of partial state. Kodialam et al. [10] describes one such partial information scenario, referred to as the O(jEj) information case here on, wherein for every link l in network G = V; E) with capacity C l , three state variables are maintained and exchanged among peering routers: 1) F l : Amount of bandwidth used on link l by all ....
[Article contains additional citation context not shown here]
M. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Proceedings of IEEE INFOCOM, pages 376--385, 2000.
A Practical QoS Network Management System Considering Load.. - Yu, Das, Gerla (2003) (Correct)
....path is found, the connection is rejected and the application exits. Thus, the QoS routing path computation algorithm not only provides the capability of finding QoS paths but also plays an important role in CAC. Several papers have been presented to show the benefit of Multipath QoS routing. In [12], the dynamic routing algorithm for MPLS networks is proposed where the path for each request is selected to prevent the interface among paths for the future demands. It considers only single path routing for simplicity and does not include the constraint. 13] proposes an adap tive traffic ....
M. Kodialam and T.V. Lakshman, "Minimum interference routing with applications to mpls traffic engineering," in INFOCOM. ACM, 2000, also in "Computer Communication RevieW' 20 (4), Oct. 1990.
On-line routing optimization for MPLS-based IP Networks - Mardente, Casetti, Mellia, .. (2003) (Correct)
....is found, the TSBA will not do any operation for the current step. The complexity of the algorithm is proportional to the number of iterations, and its impact is investigated in Section III. D. Minimum Interference Algorithm The Minimum Interference Algorithm (MIA) is an adaptation of algorithm [17], in which new LSPs are allocated so that the impact on current and future allocations is minimal. Our implementation does not provide for admission control (like in the original algorithm) but, rather, reroutes and reallocates LSPs upon necessity. For this reason we have to define a new concept ....
M. Kodialam, T.V. Lakshman, "Minimum Interference Routing with Application to MPLS Networks", IEEE Infocom 2000.
On the Stability of Adaptive Routing in the Presence of.. - Anderson, Anderson (2003) (3 citations) (Correct)
....delay. Our proof techniques, however, do not extend to these other criteria, unless the algorithm also preserves the min max property. Finally, we note that our work is somewhat, but not completely, independent of the mechanism used to implement adaptive routes. Both source routing, as in MPLS [20], 21] and destinationbased fractional routing [22] are general purpose enough to be able to implement the min max property for all networks and workloads. However, many service providers instead use OSPF or IS IS shortest path algorithms for computing routes, adjusting weights on each link to ....
M. Kodialam and T. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in IEEE INFOCOM, 2000, pp. 884--893.
QoS Aware Path Protection Schemes for MPLS Networks - Gupta, Gupta, Jain, Tripathi (Correct)
....like conservation of protection resources by sharing of bandwidth and satisfaction of QoS constraints. Other schemes like computing maximally disjoint multiple paths for improved fault tolerance has also been proposed in [13] which can be used for computing backup paths efficiently. Another paper [14] discusses the approach of minimum interference routing , where the aim is to find backup paths that do not interfere too much with possible future demands for primary LSPs. Another approach which is based on a new concept of Backup Load Distribution Matrix has been suggested in [15] For ....
Murali S. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proceedings of INFOCOM, 2000, pp. 884--893.
ALCFRA - A robust routing algorithm which can tolerate.. - Kowalik, Collier (Correct)
....Protocols such as MPLS [4] supporting explicit routing allow traffic flows to follow a path providing the requested QoS level as chosen by a QoS routing algorithm. In this paper we consider mechanisms used to find a path with specific bandwidth requirements. Following Kodialam and Lakshman [5] we assume that other constraints such as delay and jitter can be mapped into an effective bandwidth requirement. We assume that the linkstate routing algorithm used at each router performs route calculations on an identical network topology. Flooding of link state information is used to ensure ....
Murali S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In INFOCOM (2), pages 884-- 893, 2000.
Decentralized Local Backup LSP Calculation with Efficient.. - Mélon, Blanchy, Leduc (2003) (Correct)
....with TE (Traffic Engineering) algorithms following the same decentralised philosophy, as well as with any more centralised scheme. In this paper we will always assume that the primary LSP follows the shortest path according to a certain metric (usually a hop count) The reader is referred to [8, 9, 10] for other TE schemes to establish primary paths. When the primary path is known, we compute the set of backup LSPs required to prevent any possible node failure along this path. This is done by starting to protect against last node failure and then going backward until we reach the first node. If ....
Murali S. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In INFOCOM (2), pages 884--893, 2000.
Policy-driven Traffic Engineering for Intra-domain.. - Trimintzios, Flegkas, .. (2002) (2 citations) (Correct)
....the configuration of the network in order to maximise the network utilisation. The first one uses measurements to derive the traffic demands and then by employing the offline algorithm described in [19] tries to offload overloaded links. The latter uses a semi online algorithm described in [20] to find the critical links which if they are chosen for routing would cause the greatest interference (i.e. reduce the maximum flow) of the other egress ingress pairs of the net network. Both of these works do not take into account any QoS requirements of the traffic and try only to minimize the ....
M. Kodialam, and T.V. Lakshman, "Minimum Interference Routing with Applications to Traffic Engineering", in Proc. IEEE INFOCOM00, pp. 884-893 March 2000
IEEE Communications Magazine . October 2003 126.. - Accepted From Open (2003) (Correct)
No context found.
M. Kodialam and T. V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering" Proc. IEEE INFOCOM 2000.
Adding QoS Protection in Order to Enhance MPLS QoS Routing - Jose Marzo Eusebi (2003) (3 citations) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
Virtual Flow Deviation: Dynamic Routing of Bandwidth.. - Capone, Fratta.. (Correct)
No context found.
Murali S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Tra#c Engineering. In Proceedings of INFOCOM (2), pages 884--893, 2000.
Enhanced fault recovery methods for protected traffic services in.. - Calle (2004) (Correct)
No context found.
K. Kar, M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering" Proceedings of IEEE Infocom 2000, March 2000. 139
Protection Performance Components in MPLS Networks - Calle, Marzo, Urra (2004) (Correct)
No context found.
M. Kodialam, T.V. Lakshman, Minimum Interference Routing with Applications to MPLS Traffic Engineering, Proceedings of IEEE Infocom (2000).
Protection Performance Components in MPLS Networks - Calle, Marzo, Urra (2003) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
Dynamic Routing Of Bandwidth Guaranteed Connections In.. - Capone, Fratta, Martignon (2003) (Correct)
No context found.
Kodialam, M. S. and Lakshman, T. V. [2000] "Minimum interference routing with applications to MPLS tra#c engineering," in Proceedings of INFOCOM (2), pp. 884--893.
Dynamic Routing of Bandwidth Guaranteed Connections in.. - Capone, Fratta, Martignon (2003) (Correct)
No context found.
Kodialam, M. S. and Lakshman, T. V. [2000] "Minimum interference routing with applications to MPLS tra#c engineering," in Proceedings of INFOCOM (2), pp. 884--893.
Routing in Turn-Prohibition Based Feed-Forward Networks - Fidler, Einhoff (2004) (Correct)
No context found.
M. S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Tra#c Engineering. Proccedings of IEEE INFOCOM (2), pages 884--893, 2000.
Path Allocation in Backbone Networks: Project Report - Fidler, Klimala, Sander (2004) (Correct)
No context found.
Kodialam, M. and Lakshman, T.V., Minimum Interference Routing with Applications to MPLS Tra#c Engineering, Proceedings of IEEE INFOCOM, pp. 884-893, 2000.
Analysis of Dynamic QoS Routing Algorithms for Mpls Networks - Capone, Martignon (2004) (Correct)
No context found.
Murali S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of INFOCOM (2), pages 884--893, 2000.
Quality of Service Provisioning through Traffic.. - Trimintzios.. (2003) (1 citation) (Correct)
No context found.
M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to traffic engineering, Proceedings of IEEE INFOCOM2000.
Path Allocation in Backbone Networks: Project Report - Fidler, Klimala, Sander (2004) (Correct)
No context found.
Kodialam, M. and Lakshman, T.V., Minimum Interference Routing with Applications to MPLS Tra#c Engineering, Proceedings of IEEE INFOCOM, pp. 884-893, 2000.
Load Balancing Routing with Bandwidth-Delay Guarantees - Gopalan, Chiueh, Lin (2004) (2 citations) (Correct)
No context found.
M.S. Kodialam and T.V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Proc. of INFOCOM'2000.
Delay Budget Partitioning to Maximize Network Resource.. - Gopalan, Chiueh, Lin (2004) (Correct)
No context found.
M.S. Kodialam and T.V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proc. of INFOCOM'2000.
A Simple Polynomial Time Framework for.. - Mirrokni.. (2004) (Correct)
No context found.
K. Kar, M. Kodialam, and T. V. Lakshman. Minimum interference routing with applications to (mpls) traffic engineering. Proc. IEEE INFOCOM, pages 884 -- 893, 2000.
Management of End-to-end Quality of Service - Across The Internet (Correct)
No context found.
M. Kodialam, and T.V. Lakshman, Minimum Interference Routing with Applications to Traffic Engineering, in Proc. IEEE INFOCOM00, pp. 884-893 March 2000
Load Balancing In Hop-By-Hop Routing With And Without Traffic.. - Wang (2003) (Correct)
No context found.
M. Kodialam and T.V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of IEEE Infocom 2000.
Efficient Provisioning Algorithms for Network Resource.. - Gopalan (2003) (Correct)
No context found.
M.S. Kodialam and T.V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Proc. of INFOCOM'2000.
A Survey of Service Restoration Techniques in MPLS Networks - Foo (2003) (Correct)
No context found.
T. Kodialam, M.; Lakshman, "Minimum interference routing with applications to mpls traffic engineering," in INFOCOM
A Multi-Commodity Flow Based Approach to Virtual Network.. - Szeto, Iraqi, Boutaba (2003) (Correct)
No context found.
M. Kodialam, and T.V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering," In Proceedings of Infocom 2000.
Building Edge-Failure Resilient Networks - Chekuri, Gupta, Kumar, Naor, Raz (2002) (2 citations) (Correct)
No context found.
M. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. Infocom 2000, pages 884-893, 2000.
QoS Online Routing and MPLS Multilevel Protection: A Survey - Marzo, al. (2003) (Correct)
No context found.
M. Kodialam and T. V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering" Proc. IEEE INFOCOM 2000.
Planning and Design Methods for Robust WDM Networks subject to.. - Fukushima (2003) (Correct)
No context found.
M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proceedings of IEEE INFOCOM 2000.
Adding QoS Protection in Order to Enhance MPLS QoS Routing - Marzo, Calle, Scoglio.. (2003) (3 citations) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
Delay Budget Partitioning to Maximize Network Resource.. - Gopalan, Chiueh, Lin (2004) (Correct)
No context found.
M.S. Kodialam and T.V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in Proc. of INFOCOM'2000.
Enhanced fault recovery methods for protected traffic services in.. - Calle (2004) (Correct)
No context found.
K. Kar, M. Kodialam and T. V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering" Proceedings of IEEE Infocom 2000, March 2000. 139
A Minimum Interference Routing Algorithm - Figueiredo, Fonseca, Monteiro (Correct)
No context found.
M. S. Kodialam and T. V. Lakshman, "Minimum Interference Routing with Applications to MPLS Traffic Engineering," in INFOCOM (2), 2000, pp. 884--893.
Adding QoS Protection in Order to Enhance MPLS QoS Routing - Marzo, Calle, Scoglio.. (2003) (3 citations) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
Enhancing MPLS QoS routing algorithms by using the.. - Calle, Marzo, Urra, Vila (2004) (Correct)
No context found.
M. Kodialam, T.Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". IEEE Infocom 2000.
Flow Splitting Approach for Path Provisioning and Path Protection.. - Nec (Correct)
No context found.
M. Kodialam and T.V. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering ", INFOCOM 2000.
An efficient decentralized on-line traffic engineering.. - Blanchy, Mélon, Leduc (2003) (2 citations) (Correct)
No context found.
Murali S. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS trac engineering. In INFOCOM (2), pages 884-893, 2000.
QoS protection: Formulation and experimental analysis of.. - Marzo, Calle, Vila (2002) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
An Implementation-Based Comparison of Measurement-Based Admission.. - Moore (2004) (Correct)
No context found.
M. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Tra#c Engineering. In Proceedings of IEEE INFOCOM 2000.
Protection Performance Components in MPLS Networks - Calle, Marzo, Urra (2003) (Correct)
No context found.
M. Kodialam, T.V. Lakshman. "Minimum Interference Routing with Applications to MPLS Traffic Engineering". Proceedings of IEEE Infocom 2000.
Routing Bandwidth-Guaranteed Paths with Restoration .. - Norden, Buddhikot, .. (2004) (1 citation) (Correct)
No context found.
Murali Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Proceedings of IEEE INFOCOM, Tel-Aviv, Israel, March 2000.
Survivable lightpath routing: a new approach to the design of.. - Modiano, al. (2001) (3 citations) (Correct)
No context found.
M. Kodialam and T.V. Lakshman, "Minimum Interference Routing with Application to MPLS Traffic Engineering," Infocom, 2000.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC