A hierarchical multicriteria routing model with traffic splitting for MPLS networks


 Myron Wade
 2 years ago
 Views:
Transcription
1 A hierarchical multicriteria routing model with traffic splitting for MPLS networks João Clímaco, José Craveirinha, Marta Pascoal University of Coimbra and INESC Coimbra PORTUGAL IIASA 2006 p1/14
2 Abstract Routing problems in multiservice communication networks involve the calculation of paths satisfying multiple constraints and seeking simultaneously to optimise the relevant metrics We address a novel bilevel multicriteria routing model for MPLS networks using trafficsplitting and propose a resolution approach We will begin by describing a previous bilevel multicriteria routing model for multiservice networks and its application to a videotraffic routing problem where the objective functions of the first level seek to minimise the negative impact of the use of a path in the remaining traffic flows of the network, while the second level objective functions seek to optimise transmission parameters of the flow associated with the chosen path An extension of this model, suitable for MPLS networks using a twopath routing scheme with traffic splitting will be presented IIASA 2006 p2/14
3 Contents 1 Introduction 2 Routing models in multiservice networks 3 A bilevel multicriteria routing model for multiservice networks (a) Mathematical formulation (b) Basis of the resolution approach (c) Application model and computational tests 4 A hierarchical routing model with traffic splitting for MPLS networks (a) Extension of the previous model (b) Mathematical formulation 5 Basis of the resolution approach 6 Conclusions IIASA 2006 p3/14
4 1 Introduction Routing problems in communication networks supporting multiple services, namely multimedia applications, involve the selection of paths satisfying multiple constraints of a technical nature, designated as QoS (Quality of Service) requirements and seeking simultaneously to optimise the chosen objective functions The objective functions are concerned with the necessity of minimizing the consumption of (transmission) resources along a path and to obtain a minimum negative impact in all traffic flows that may use the network The specific models of these cost functions and of the QoS constraints depend on the type of multimedia service associated with the calls which are being routed from origin to destination, as it is case in the recent MPLS (Multiprotocol Label Switching) Internet technology IIASA 2006 p4/14
5 2 Routing Models in Multiservice Networks Although traditional models in this area are singleobjective, in many situations it is important to consider explicitly different, eventually conflicting objectives Most routing algorithms that have been traditionally employed in current networks or proposed for this type of problem, are heuristics based on Dijkstra or BellmanFord shortest path algorithm Therefore this is an area where there are potential advantages in introducing multicriteria routing approaches, taking into account the major network functional features and the nature of the multiple QoS (Quality of Service) metrics IIASA 2006 p5/14
6 3 A Bilevel Multicriteria Routing Model for Multiservice Networks We consider: 1 st level Objective functions seek to diminish the negative impact on the remaining traffic flows resulting from the utilisation of a given path by the considered nodetonode flow and to minimise the blocking probability of the given nodetonode traffic flow: 1 cost of accepting a call in a path expressed in the available bandwidth in its arcs (or links ): the cost of an arc varies inversely with the available bandwidth, 2 number of arcs in a path (its minimisation tends to optimise the number of used resources per connection and favours path reliability) IIASA 2006 p6/14
7 3 A Bilevel Multicriteria Routing Model for Multiservice Networks 2 nd level Objective functions seek to optimise the path from the point of view of the transmission conditions (QoS parameters) of the considered nodetonode flow: 1 bottleneck bandwidth i e the minimal available bandwidth among the links of a path, 2 total delay experienced along a path expressed in the delays on the links Constraints on the paths: minimal bandwidth required by a connection request in the flow, maximal allowed delay, maximal allowed jitter, which may be expressed, for certain queueing disciplines in terms of a constraint on the number of links per path IIASA 2006 p6/14
8 31 Mathematical Formulation This multimedia traffic routing problem is formulated as a hierarchical multicriteria network problem Values associated with each arc (or link) (i, j) in (N, A): b ij IR + representing the available bandwidth on (i, j), c ij IR + representing the cost of using (i, j), c ij = 1/b ij in this model, d ij IR + representing the associated delay, R ij IR + representing the capacity of (i, j) Moreover: c(p) = (i,j) p c ij, (path cost), b(p) = min (i,j) p {b ij }, (bottleneck bandwidth), d(p) = (i,j) p d ij, (total delay), h(p) = number of arcs of path p IIASA 2006 p7/14
9 31 Mathematical Formulation Given jitter IN, bandwidth IR + and delay IR +, where jitter is a limit on the number of arcs related to a bound on the jitter The problem is to determine loopless paths p satisfying the constraints: b(p) bandwidth, d(p) delay, p has at most jitter arcs which are solutions of the bilevel multicriteria routing problem: 1 st level min{c(p) : p P} min{h(p) : p P} (path cost) (number of arcs of the path) 2 nd level max b(p) min d(p) (bottleneck bandwidth) (path delay) IIASA 2006 p7/14
10 31 Mathematical Formulation In general such a problem does not have a solution due to possible conflict between the considered functions Thus, it will be useful to consider the set of nondominated solutions, ie paths such that there is no other feasible path which improves one objective function without worsening at least one of the other objective functions The set of nondominated solutions concerning the 1 st level is defined as follows: Given paths p and q, p dominates q (p D q) if and only if c(p) c(q), h(p) h(q) and at least one of the inequalities is strict Path q is dominated if and only if there is another path p such that p D q P N denotes the set of nondominated paths IIASA 2006 p7/14
11 32 Basis of the Resolution Approach In the 1 st level a bicriterion problem is solved by an adaptation of Clímaco & Martins algorithm, based on a loopless paths ranking method by Martins et al (MPS) Compute p the path with less arcs, ĉ = c(p) Compute q the lowest cost path, m h = h(q), M c = c(q) Rank loopless paths p k by nondecreasing order of c, until c(p k ) > ĉ Apply a dominance test to p k (compare p k with previous loopless paths): c(p k ) = M c If h(p k ) < m h, then p k dominates the stored candidates and it is candidate to be nondominated If h(p k ) = m h, then p k is candidate to be nondominated If h(p k ) > m h, then p k P N c(p k ) > M c If h(p k ) < m h, then the stored candidates belong to P N, p k is candidate to be nondominated If h(p k ) m h, then p k P N IIASA 2006 p8/14
12 32 Basis of the Resolution Approach Note that the relaxation of the nondominance definition can be useful in this context So, we also tested the calculation of ǫnondominated solutions, where ǫ = (ǫ c, ǫ h ) and ǫ c, ǫ h are small and positive IIASA 2006 p8/14
13 32 Basis of the Resolution Approach Preference thresholds are defined for the solutions of level 1, enabling the definition of priority regions Required (aspiration level) and acceptable (reservation level) values of h: ( arcs > 2), where: h req = int(m p ) + 1, h acc = int(m p ) + arcs 1, int(x): the smallest integer greater than or equal to x, and m p : average value of the shortest paths length for all node pairs Required and acceptable values of c: where: c req = c min + c m 2, c acc = c max + c m 2 c min, c max : average minimal and maximal path costs for all node pairs, c m = c min + c max 2, IIASA 2006 p8/14
14 32 Basis of the Resolution Approach Priority regions: h acc h h req B 1 A C B 2 c req c c acc IIASA 2006 p8/14
15 32 Basis of the Resolution Approach Solutions from level 1 are considered in level 2, namely: 1 being filtered according to acceptable bounds defined for the functions of level 2, 2 ordering the resulting according to a specific metric The acceptable bounds, b m (lowerbound) and d M (upperbound), are: b m = b(p ), where p = argmin q P 1 N {d(q)} d M = d(p ), where p = argmax q P 1 N {b(q)} and P 1 N is the set of nondominated solutions of level 1 Finally, in each priority area of level 1 a ranking is made of the solutions taking into account the objective functions of level 2 In a priority area the resulting solutions are ordered according to a weighted Chebyshev distance to the ideal solution IIASA 2006 p8/14
16 32 Basis of the Resolution Approach Solutions of level 1 are aggregated with acceptable and preference levels defined by the Decision Maker, regarding the two criteria of level 2 Then, solutions in the same priority area are ranked according to a weighted Chebyshev distance to the ideal solution of the considered area The weights follow the proportionality of the intervals regarding both criteria in the considered area IIASA 2006 p8/14
17 33 Application Model and Computational Tests A video traffic routing problem in random generated networks was considered for application of this model Each node is modeled as a queueing system using Weighted Fair Queueing (WFQ) service discipline, enabling to represent the bound on jitter through a constraint on the number of arcs jitter Given a link (i, j), we considered: random b ij {052, 252,, 15052} (in Mb/s), for a total link capacity of Mb/s; c ij = 1/b ij ; ( d ij = S max r k ) + S max R ij + D ij 2c/3 (in ms), where D ij is the Euclidean distance between nodes of coordinates (x i, y i ) and (x j, y j ), c is the speed of light, R uv = bit/s is the bandwidth capacity of (u, v), r k = bit/s is the token generation rate of the leaky bucket, and S max = 53 8 bit is the size of an ATM cell IIASA 2006 p9/14
18 33 Application Model and Computational Tests bandwidth = 15 Mb/s, jitter = ma(s, t) + arcs, with: arcs = 4, and ma(s, t) = minimal number of arcs of a feasible path from s to t Partition of {052, 252,,15052} in 5 classes with equal amplitude, with a predefined percentage of values of b ij I 0 I 1 I 2 I 3 I 4 50% 20% 15% 10% 5% IIASA 2006 p9/14
19 33 Application Model and Computational Tests Computational tests) Tests were performed for a set of randomly generated networks constructed on a grid with points (mesh space unit 10 Km) and average node degree equal to 4, with: n {500, 1000, 1500, 2000, 2500, 3000}, n 2 st node pairs, and different seeds Code and computer: C language, AMD Athlon at 13 GHz, with 512 Mbytes of RAM, Linux IIASA 2006 p9/14
20 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 1000) ǫ c = ǫ h = 0 1 st level solutions: Zone c 10 2 h b d C C h c 10 2 Req Acc Solutions filtered by the bounds of the 2 nd level (both with the same rank): c 10 2 h b d d M b m Acc IIASA 2006 p9/14
21 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 1000) ǫ c = 10%, ǫ h = 1 1 st level solutions: Zone c 10 2 h b d C C C C C h c 10 2 Req Acc Solutions filtered by the bounds of the 2 nd level (both with the same rank): c 10 2 h b d d M b m Acc IIASA 2006 p9/14
22 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 1000) 1 st level solutions Solutions filtered by the bounds of the 2 nd level h acc h req h c c req c acc IIASA 2006 p9/14
23 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 2000) ǫ c = ǫ h = 0 1 st level solutions: Zone c 10 2 h b d B h c 10 2 Req Acc Solutions filtered by the bounds of the 2 nd level: c 10 2 h b d d M b m Acc IIASA 2006 p9/14
24 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 2000) ǫ c = 10%, ǫ h = 1 1 st level solutions: Zone c 10 2 h b d B C C h c 10 2 Req Acc Solutions filtered by the bounds of the 2 nd level: c 10 2 h b d d M b m Acc IIASA 2006 p9/14
25 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 2000) 1 st level solutions Solutions filtered by the bounds of the 2 nd level h acc h req h c c req c acc IIASA 2006 p9/14
26 33 Application Model and Computational Tests Solutions for one pair of nodes (n = 2000) Ideal point: (d, b ) = (227663, 12252) Chebyshev distance: C(p) = max{w b d(p) d, w d b(p) b } where w b = b M b m = 42 and w d = d M d m = Solutions selected by nondecreasing order of C: Rank C c 10 2 h b d This process of aggregation is subjective, as all, but it has the great advantage of being defined as with basis on the intervals defined by the decisions relatively to the preferences for each criterion IIASA 2006 p9/14
27 33 Application Model and Computational Tests CPU times S ec 12 S ec 12 s 8 4 s n n (a) ǫ c = ǫ h = 0 (b) ǫ c = 10%, ǫ h = 1 Average Max Min IIASA 2006 p9/14
28 33 Application Model and Computational Tests Number of obtained solutions # n d s o ls # n d s o ls n n (a) ǫ c = ǫ h = 0 (b) ǫ c = 10%, ǫ h = 1 Average Max Min IIASA 2006 p9/14
29 4 A Hierarchical Multicriteria Routing Model with traffic splitting for MPLS Networks We propose an extension of the previous model, suitable for MPLS networks using a twodisjoint path routing scheme with traffic splitting such that the bandwidth required by each nodetonode traffic flow is divided by the two paths MPLS is a recent Internet technology based on the forwarding of packets using a specific label switching technique Among other advanced routing mechanisms it enables the utilisation of explicitroutes characterised by the fact the path followed by each nodetonode packet stream, of a certain type, is entirely determined by the ingress router (corresponding to the originating node) This technological platform is prepared to deal with multipath routing, using the concept of the traffic of the splitting that consists of the division of the packet stream of each flow, along two or more disjoint paths such that the sum of the bandwidths available in those paths satisfies the bandwidth requirement of each type of flow, depending on the service class IIASA 2006 p10/14
30 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks 1 st level objective functions: 1 a load balancing cost function that is the sum of the cost associated with the two paths, where the load balancing of an arc is a piecewise linear function of the bandwidth used in the arc, as proposed in previous MPLS routing models, eg [Erbas et al, 2003] The minimisation of this function aims at minimising the negative impact on the remaining network flows resulting from the utilisation of a given path by the considered nodetonode flow IIASA 2006 p11/14
31 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks 1 st level objective functions: min {Φ(q) + q,q P Φ(q )}, Φ(p) = (i,j) p φ ij where φ ij is the load balancing cost associated with arc (i, j), given by φ ij = o ij, 0 o ij /R ij 05 2o ij 1 2 R ij, 05 < o ij /R ij 06 5o ij R ij, 06 < o ij /R ij 07 15o ij R ij, 07 < o ij /R ij 08 60o ij R ij, 08 < o ij /R ij o ij R ij, 09 < o ij /R ij 1 where o ij = R ij b ij is the bandwidth occupied in arc (i, j), and b ij is the available bandwidth in arc (i, j) with capacity R ij φ ij is a convex piecewise linear function which increases monotonically with o ij IIASA 2006 p11/14
32 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks 1 st level objective functions: 2 nonblocking probability S on both disjoint paths simultaneously, to be maximised (equivalent to minimise the blocking probability, L, of the traffic flow, using both paths simultaneously) max S(q, q,q P q ) = (1 B(q))(1 B(q )) min L(q, q,q P q ) = 1 S(q, q ), where B(p) is the blocking probability on path p Assuming statistical independence in the link occupations B(p) = 1 Π (i,j) p (1 B ij ), where B ij is the blocking probability on link (i, j) To obtain an additive metric we consider as coefficients of the objective function to be minimised c 2 ij = ln(1 B ij), leading to: min q,q P L (q, q ) = (i,j) q,q c 2 ij IIASA 2006 p11/14
33 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks 2 st level objective functions: 1 minimal available bandwidths in the links of the paths (bottleneck bandwidths) to be maximised: max q,q P { min{b(q), b(q )} = } min (i,j) q,q {b ij}, This function aims at distributing the load of the flows through the least occupied links 2 average delay experienced along the two paths to be minimised: min max{d(q), q,q P d(q )}, where d(p) = (i,j) p d ij and d ij is the average packet delay on link (i, j) This function seeks the choice of pairs of paths with minimal average packet delay Note that the criteria formulation in the model needs experimental validation with realistic data and possible adjustments may be required IIASA 2006 p11/14
34 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks Constraints: 1 The first constraint corresponds to a trafficsplitting requirement using two paths, ie, the sum of the bottleneck bandwidths in the two paths cannot be less than the bandwidth required by microflows of the considered nodetonode flow, bandwidth : For any q, q P, b(q) + b(q ) bandwidth 2 The second constraint is a jitter related constraint, which can be transformed for certain queueing disciplines, into a constraint on the maximal number of arcs per path, jitter : For any q, q P, h(q), h(q ) jitter, where h(p) denotes the number of arcs of paths p This constraint is important for certain types of QoS traffic flows (ie with guaranteed levels of Quality of Service) as in the case of video traffic and should be eliminated for Best Effort traffic IIASA 2006 p11/14
35 41 Hierarchical Formulation of the Multicriteria Routing Model for MPLS Networks The addressed hierarchical multicriteria routing problem consists of finding satisfactory solutions (q, q ), q, q P, where q and q are disjoint loopless paths, taking into account the optimisation hierarchy IIASA 2006 p11/14
36 5 Basis of the Resolution Approach Network modification Modification of the network topology: Duplicate the nodes: N = N {i : i N }, Duplicate the arcs and add a new arc linking t and the new s : A = A {(i, j ) : (i, j) A} {(t, s )}, Maintain the initial node: s, Consider a new terminal node: t New costs: c i j = c ij, if (i, j) A, and c t,s = 0 Each simple path p from s to t in (N, A ) corresponds to a pair of paths from s to t in (N, A), ie, there exist q P st and q P s t, such that p = q (t, s ) q Thus, if q q =, then q, q correspond to a pair of disjoint simple paths in (N, A) IIASA 2006 p12/14
37 5 Basis of the Resolution Approach Network modification s t s t s t When implementing the modified network (N, A ): A copy of any node is created There only has to be one new arc: (t, s ) Arcs starting at i are (i, j ) such that (i, j) A (There s no need to enlarge the set of arcs) IIASA 2006 p12/14
38 5 Basis of the Resolution Approach In the 1 st level a bicriterion problem is solved calculating the nondominated solutions set by an adaptation of Clímaco & Martins algorithm, based on a simple path ranking method by Martins et al Ranking simple paths from s to t in (N, A ) by nondecreasing order of the number of arcs, until a feasible one (with respect to constraint (1)) is found, p = q (t, s ) q Ranking simple paths from s to t in (N, A ) by nondecreasing order of Φ, until a feasible one (with respect to constraints (1) and ( 2)) is found, p = q (t, s ) q Φ Φ(q) + Φ(q ), ˆL L (q) + L (q ) Ranking simple paths from s to t in (N, A ) by nondecreasing order of L, until a feasible one (with respect to constraints (1) and ( 2)) is found, p = q (t, s ) q M Φ ˆΦ Φ(q) + Φ(q ), m L L L (q, q ) IIASA 2006 p13/14
39 5 Basis of the Resolution Approach Ranking simple feasible paths (with respect to constraints (1) and ( 2)) p k = q k (t, s ) q k from s to t in (N, A ) by nondecreasing order of L, until L (q k, q k ) > ˆL Apply a dominance test to p k (compare p k with previous simple feasible paths): L (q k, q k ) = M L If Φ(q k ) + Φ(q k ) < m Φ, then p k dominates the stored candidates and it is candidate to be nondominated If Φ(q k ) + Φ(q k ) = m Φ, then p k is candidate to be nondominated If Φ(q k ) + Φ(q k ) > m Φ, then p k P N L (q k, q k ) > M L If Φ(q k ) + Φ(q k ) < m Φ, then the stored candidates belong to P N, p k is candidate to be nondominated If Φ(q k ) + Φ(q k ) m Φ, then p k P N IIASA 2006 p13/14
40 5 Basis of the Resolution Approach Preference thresholds are defined for the solutions of level 1, enabling the definition of priority regions Required (aspiration level) and acceptable (reservation level) values of L : L req = ( L min + L m)/2, L acc = ( L max + L m)/2, where: L min, L max : average minimal and maximal path blocking probability obtained for the pairs of paths associated with all nodetonode flows, L m = (L min + L max)/2 Required and acceptable values of C: C req = ( C min + C m )/2, C acc = ( C max + C m )/2, where: C min, C max : average minimal and maximal path costs for all node pairs, C m = (C min + C max )/2 IIASA 2006 p13/14
41 5 Basis of the Resolution Approach Solutions from level 1 are then filtered according to acceptable bounds defined for the functions of level 2, which are applied to both paths of each candidate solution Those acceptable bounds for the subpaths q, q of the path p = q (t, s ) q, b m (lower bound) and d M (upper bound), are defined as follows: b m = min{b(q ), b(q )}, where p = argmin{max{d(q), d(q )} : p = q (t, s ) q P N}, with P N the set of nondominated paths with respect to the objective functions of the 1 st level in network (N, A ) d M = max{d(q ), d(q )}, where p = argmax{min{b(q), b(q )} : p = q (t, s ) q P N } Finally, in each priority area of level 1 a ranking can be made of the solutions taking into account the objective function of level 2 IIASA 2006 p13/14
42 Conclusions A hierarchical multicriteria routing model to calculate and select a set of nondominated paths for traffic flows associated with multimedia type services in multiservice networks was developed: 1 st level obj functions seek to diminish the negative impact on the remaining flows, resulting from the utilisation of a given path 2 nd level obj functions seek to optimise the path from the point of view of the transmission conditions of the considered nodetonode flow A variant of this model and the corresponding algorithm suitable for MPLS networks using a twopath routing scheme with traffic splitting will be presented The formulated problem involves the calculation of a pair of disjoint paths such that the sum of the minimal available bandwidth in the two paths is not less than the bandwidth required for the considered traffic flow (twopath trafficsplitting); a constraint related to the allowed jitter is also considered IIASA 2006 p14/14
Traffic splitting in MPLS networks a hierarchical multicriteria approach
Paper Traffic splitting in MPLS networks a hierarchical multicriteria approach José M. F. Craveirinha, João C. N. Clímaco, Marta M. B. Pascoal, and Lúcia M. R. A. Martins Abstract In this paper we address
More informationHierarchical Multiobjective Routing in MPLS Networks with Two Service Classes A MetaHeuristic Solution
Paper Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes A MetaHeuristic Solution Rita GirãoSilva, José Craveirinha, and João Clímaco Abstract The paper begins by reviewing
More informationInstituto de Engenharia de Sistemas e Computadores de Coimbra. Institute of Systems Engineering and Computers INESC  Coimbra
Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC  Coimbra Carlos Simões, Teresa Gomes, José Craveirinha, and João Clímaco A BiObjective
More informationInstituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra
Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra João Clímaco and Marta Pascoal A new method to detere unsupported nondoated solutions
More informationRita GirãoSilva 1,2*, José Craveirinha 1,2 and João Clímaco 2
GirãoSilva et al. Journal of Uncertainty Analysis and Applications 2014, 2:3 RESEARCH Open Access Stochastic hierarchical multiobjective routing model in MPLS networks with two service classes: an experimental
More informationOn the effect of forwarding table size on SDN network utilization
IBM Haifa Research Lab On the effect of forwarding table size on SDN network utilization Rami Cohen IBM Haifa Research Lab Liane Lewin Eytan Yahoo Research, Haifa Seffi Naor CS Technion, Israel Danny Raz
More informationInstituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra
Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC Coimbra João Clímaco, M. Eugénia Captivo and Marta Pascoal On the bicriterion minimum
More informationA New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks
A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationA New Forwarding Policy for Load Balancing in Communication Networks
A New Forwarding Policy for Load Balancing in Communication Networks Martin Heusse Yvon Kermarrec ENST de Bretagne BP 83, 985 Brest Cedex, France Martin.Heusse@enstbretagne.fr Abstract We present in this
More informationCHAPTER 2. QoS ROUTING AND ITS ROLE IN QOS PARADIGM
CHAPTER 2 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 22 QoS ROUTING AND ITS ROLE IN QOS PARADIGM 2.1 INTRODUCTION As the main emphasis of the present research work is on achieving QoS in routing, hence this
More informationMultiobjective Multicast Routing Algorithm
Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9  National University of Asunción Asunción Paraguay. Tel/Fax: (+9) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py
More informationQuality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/netsece Overview What is QoS? Queuing discipline and scheduling Traffic
More informationQoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationLoad Balancing by MPLS in Differentiated Services Networks
Load Balancing by MPLS in Differentiated Services Networks Riikka Susitaival, Jorma Virtamo, and Samuli Aalto Networking Laboratory, Helsinki University of Technology P.O.Box 3000, FIN02015 HUT, Finland
More informationMultilayer MPLS Network Design: the Impact of Statistical Multiplexing
Multilayer MPLS Network Design: the Impact of Statistical Multiplexing Pietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli Tepper School of Business, Carnegie Mellon University, Pittsburgh
More informationNetwork management and QoS provisioning  QoS in the Internet
QoS in the Internet Inernet approach is based on datagram service (best effort), so provide QoS was not a purpose for developers. Mainly problems are:. recognizing flows;. manage the issue that packets
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. Traffic Shaping: Leaky Bucket Algorithm
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationRouting in Switched Networks
Routing in Switched Networks Chapter 12 CS420/520 Axel Krings Page 1 Routing in Circuit Switched Network Many connections will need paths through more than one switch Need to find a route Efficiency Resilience
More informationBranchandPrice Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN BranchandPrice Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
More informationPATH SELECTION AND BANDWIDTH ALLOCATION IN MPLS NETWORKS
PATH SELECTION AND BANDWIDTH ALLOCATION IN MPLS NETWORKS James E Burns and Teunis J Ott Telcordia Technologies Inc, 445 South Street, Morristown NJ 079606438, USA Anthony E Krzesinski and Karen E Müller
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOORULHUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More information6.231 Dynamic Programming and Stochastic Control Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.231 Dynamic Programming and Stochastic Control Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.231
More informationPROTECTION ALGORITHMS FOR BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS WONG SHEK YOON
PROTECTION ALGORITHMS FOR BANDWIDTH GUARANTEED CONNECTIONS IN MPLS NETWORKS WONG SHEK YOON (B.Eng.(Hons), NUS) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER
More informationNew QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints
New QOS Routing Algorithm for MPLS Networks Using Delay and Bandwidth Constraints Santosh Kulkarni 1, Reema Sharma 2,Ishani Mishra 3 1 Department of ECE, KSSEM Bangalore,MIEEE, MIETE & ISTE 2 Department
More information2004 Networks UK Publishers. Reprinted with permission.
Riikka Susitaival and Samuli Aalto. Adaptive load balancing with OSPF. In Proceedings of the Second International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET
More informationSupporting Differentiated QoS in MPLS Networks
Supporting Differentiated QoS in MPLS Networks Roberto A. Dias 1, Eduardo Camponogara 2, and JeanMarie Farines 2 1 Federal Technology Center of Santa Catarina, Florianópolis, 88020300, Brazil 2 Federal
More informationCS640: Introduction to Computer Networks. Why a New Service Model? Utility curve Elastic traffic. Aditya Akella. Lecture 20 QoS
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 QoS Why a New Service Model? Best effort clearly insufficient Some applications need more assurances from the network What is the basic
More informationAnalysis of QoS Routing Approach and the starvation`s evaluation in LAN
www.ijcsi.org 360 Analysis of QoS Routing Approach and the starvation`s evaluation in LAN 1 st Ariana Bejleri Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department,
More informationPART II. OPSbased metro area networks
PART II OPSbased metro area networks Chapter 3 Introduction to the OPSbased metro area networks Some traffic estimates for the UK network over the next few years [39] indicate that when access is primarily
More informationPath Selection Analysis in MPLS Network Based on QoS
Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 6 Özel Sayı (2015) ISSN: 13001949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 6 Special
More informationDesign of IP Networks with EndtoEnd Performance Guarantees
Design of IP Networks with EndtoEnd Performance Guarantees By Irena Atov Outline QoS technologies and issues that surround IP network design with QoS Overview of IP network design model and the various
More informationA Scalable Monitoring Approach Based on Aggregation and Refinement
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL 20, NO 4, MAY 2002 677 A Scalable Monitoring Approach Based on Aggregation and Refinement YowJian Lin, Member, IEEE and Mun Choon Chan, Member, IEEE
More informationSearch Heuristics for Load Balancing in IPnetworks
Search Heuristics for Load Balancing in IPnetworks Mattias Söderqvist Swedish Institute of Computer Science mso@sics.se 3rd March 25 SICS Technical Report T25:4 ISSN 113154 ISRN:SICST25/4SE Abstract
More informationAN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK
Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar144001, Punjab,
More informationMotivation. QoS Guarantees. Internet service classes. Certain applications require minimum level of network performance:
QoS Guarantees Motivation introduction call admission traffic specification linklevel scheduling call setup protocol reading: Tannenbaum, 393395, 458471 Ch 6 in Ross/Kurose Certain applications require
More informationQuality of Service using Traffic Engineering over MPLS: An Analysis. Praveen Bhaniramka, Wei Sun, Raj Jain
Praveen Bhaniramka, Wei Sun, Raj Jain Department of Computer and Information Science The Ohio State University 201 Neil Ave, DL39 Columbus, OH 43210 USA Telephone Number: +1 6142923989 FAX number: +1
More informationDynamic Network Resources Allocation in Grids through a Grid Network Resource Broker
INGRID 2007 Instrumenting the GRID Second International Workshop on Distributed Cooperative Laboratories Session 2: Networking for the GRID Dynamic Network Resources Allocation in Grids through a Grid
More informationJoint Optimization of Routing and Radio Configuration in Fixed Wireless Networks
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks David Coudert, Napoleão Nepomuceno, Hervé Rivano Projet Mascotte, I3S(CNRSUNSA) INRIA Réunion Mascotte, March 2009 MASCOTTE
More informationChapter 2 Goal Programming Variants
Chapter 2 Goal Programming Variants This chapter introduces the major goal programming variants. The purpose and underlying philosophy of each variant are given. The three major variants in terms of underlying
More informationScheduling for QoS Management
Scheduling for QoS Management Domenico Massimo Parrucci Condello isti information science Facoltà and di Scienze technology e Tecnologie institute 1/number 1 Outline What is Queue Management and Scheduling?
More informationDisjoint Path Algorithm for Load Balancing in MPLS network
International Journal of Innovation and Scientific Research ISSN 23518014 Vol. 13 No. 1 Jan. 2015, pp. 193199 2015 Innovative Space of Scientific Research Journals http://www.ijisr.issrjournals.org/
More informationRouting in packetswitching networks
Routing in packetswitching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationEQBGP: an efficient interdomain QoS routing protocol
EQBGP: an efficient interdomain QoS routing protocol Andrzej Beben Institute of Telecommunications Warsaw University of Technology Nowowiejska 15/19, 00665 Warsaw, Poland abeben@tele.pw.edu.pl Abstract
More informationQoS optimization for an. ondemand transportation system via a fractional linear objective function
QoS optimization for an Load charge ratio ondemand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization
More informationInfluence of Load Balancing on Quality of Real Time Data Transmission*
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 3, December 2009, 515524 UDK: 004.738.2 Influence of Load Balancing on Quality of Real Time Data Transmission* Nataša Maksić 1,a, Petar Knežević 2,
More informationChapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
More informationChapter 4. VoIP Metric based Traffic Engineering to Support the Service Quality over the Internet (Interdomain IP network)
Chapter 4 VoIP Metric based Traffic Engineering to Support the Service Quality over the Internet (Interdomain IP network) 4.1 Introduction Traffic Engineering can be defined as a task of mapping traffic
More informationThe network we see so far. Internet Best Effort Service. Is besteffort good enough? An Audio Example. Network Support for Playback
The network we see so far CSE56  Lecture 08 QoS Network Xiaowei Yang TCP sawtooth FIFO w/ droptail or red Besteffort service Websurfing, email, ftp, filesharing Internet Best Effort Service Our network
More informationIP Traffic Engineering over OMP technique
IP Traffic Engineering over OMP technique 1 Károly Farkas, 1 Zoltán Balogh, 2 Henrik Villför 1 High Speed Networks Laboratory Department of Telecommunications and Telematics Technical University of Budapest,
More informationAnalysis of traffic engineering parameters while using multiprotocol label switching (MPLS) and traditional IP networks
Analysis of traffic engineering parameters while using multiprotocol label switching (MPLS) and traditional IP networks Faiz Ahmed Electronic Engineering Institute of Communication Technologies, PTCL
More informationNetwork Efficient QoS Routing for Multimedia Services in MPLS Networks
Network Efficient QoS Routing for Multimedia Services in MPLS Networks HahnEarl Jeon The Graduate School Yonsei University Department of Electrical and Electronic Engineering Network Efficient QoS Routing
More informationQoS Routing. Jonathan Osting Matt Hoffman Sheng Shen
QoS Routing Jonathan Osting Matt Hoffman Sheng Shen The Goal To guarantee a predetermined level of service to certain connections, the required resources must be reserved when the connection is established.
More informationCS/ECE 438: Communication Networks. Internet QoS. Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE
CS/ECE 438: Communication Networks Internet QoS Syed Faisal Hasan, PhD (Research Scholar Information Trust Institute) Visiting Lecturer ECE Introduction The Internet only provides a best effort service
More informationNetwork Architecture and Topology
1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches and routers 6. End systems 7. Endtoend
More informationResearch Article Average Bandwidth Allocation Model of WFQ
Modelling and Simulation in Engineering Volume 2012, Article ID 301012, 7 pages doi:10.1155/2012/301012 Research Article Average Bandwidth Allocation Model of WFQ TomášBaloghandMartinMedvecký Institute
More informationA Localized Adaptive Proportioning Approach to QoS Routing
QOS ROUTING A Localized Adaptive Proportioning Approach to QoS Routing Srihari Nelakuditi and ZhiLi Zhang, University of Minnesota Here we assume source routing with bandwidth guarantees. ABSTRACT In
More informationMultimedia Requirements. Multimedia and Networks. Quality of Service
Multimedia Requirements Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Transfer/Control Protocols Quality of Service
More informationQuality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints
Quality of Service Routing in MPLS Networks Using Delay and Bandwidth Constraints Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationTraffic Engineering approaches using Multicriteria Optimization Techniques
Traffic Engineering approaches using Multicriteria Optimization Techniques Pedro Sousa, Paulo Cortez 3, Miguel Rio 2, Miguel Rocha Dept. of Informatics, University of Minho, Portugal, {pns,mrocha}@di.uminho.pt
More informationProject Report on Traffic Engineering and QoS with MPLS and its applications
Project Report on Traffic Engineering and QoS with MPLS and its applications Brief Overview Multiprotocol Label Switching (MPLS) is an Internet based technology that uses short, fixedlength labels to
More informationFlow aware networking for effective quality of service control
IMA Workshop on Scaling 2224 October 1999 Flow aware networking for effective quality of service control Jim Roberts France Télécom  CNET james.roberts@cnet.francetelecom.fr Centre National d'etudes
More informationClustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 20080429 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating
More informationIndepth Voice over IP and SIP Networking Course
Introduction SIP is fast becoming the Voice over IP protocol of choice. During this 3day course delegates will examine SIP technology and architecture and learn how a functioning VoIP service can be established.
More informationA Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks Didem Gozupek 1,Symeon Papavassiliou 2, Nirwan Ansari 1, and Jie Yang 1 1 Department of Electrical and Computer Engineering
More informationINTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS. Lucie Galand. LIP6, University of Paris 6, France
INTERACTIVE SEARCH FOR COMPROMISE SOLUTIONS IN MULTICRITERIA GRAPH PROBLEMS Lucie Galand LIP6, University of Paris 6, France Abstract: In this paper, the purpose is to adapt classical interactive methods
More informationThe changing face of global data network traffic
The changing face of global data network traffic Around the turn of the 21st century, MPLS very rapidly became the networking protocol of choice for large national and international institutions. This
More informationOn realtime delay monitoring in softwaredefined networks
On realtime delay monitoring in softwaredefined networks Victor S. Altukhov Lomonosov Moscow State University Moscow, Russia victoralt@lvk.cs.msu.su Eugene V. Chemeritskiy Applied Research Center for
More information10CS64: COMPUTER NETWORKS  II
QUESTION BANK 10CS64: COMPUTER NETWORKS  II Part A Unit 1 & 2: PacketSwitching Networks 1 and PacketSwitching Networks 2 1. Mention different types of network services? Explain the same. 2. Difference
More informationTesting VoIP on MPLS Networks
Application Note Testing VoIP on MPLS Networks Why does MPLS matter for VoIP? Multiprotocol label switching (MPLS) enables a common IPbased network to be used for all network services and for multiple
More informationMathematical Modelling Lecture 8 Networks
Lecture 8 Networks phil.hasnip@york.ac.uk Overview of Course Model construction dimensional analysis Experimental input fitting Finding a best answer optimisation Tools for constructing and manipulating
More information6.1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches?
TUTORIAL 2 (EKT 332) 6.1. Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches? Why broadcast network? The computers in a LAN are separated by a short
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationBlue 102. IP Service Architecture Futures. Geoff Huston May 2000
Blue 102 IP Service Architecture Futures Geoff Huston May 2000 Next Wave IP Services Service Requirements Connectivity service for customeroperated routers Service payload is IP packet High peak carriage
More informationHorizon: Balancing TCP over multiple paths in wireless mesh networks
Horizon: Balancing TCP over multiple paths in wireless mesh networks Bozidar Radunovic, Christos Gkantsidis, Dinan Gunawardena, Peter Key Microsoft Research Cambridge, UK Wireless Mesh Networks Goals 1.
More informationQuality of Service. Overview
Quality of Service Overview Why QoS? When QoS? One model: Integrated services Contrast to Differentiated Services (more modern; more practical; not covered) 1 What is QoS? Providing guarantees (or rough
More informationA ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING IN LEO SATELLITE CONSTELLATION NETWORK. Received September 2012; revised January 2013
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 13494198 Volume 9, Number 10, October 2013 pp. 4139 4149 A ROUTING ALGORITHM FOR MPLS TRAFFIC ENGINEERING
More informationBuilding MPLS VPNs with QoS Routing Capability i
Building MPLS VPNs with QoS Routing Capability i Peng Zhang, Raimo Kantola Laboratory of Telecommunication Technology, Helsinki University of Technology Otakaari 5A, Espoo, FIN02015, Finland Tel: +358
More informationQuality of Service (QoS)) in IP networks
Quality of Service (QoS)) in IP networks Petr Grygárek rek 1 Quality of Service (QoS( QoS) QoS is the ability of network to support applications without limiting it s s function or performance ITUT T
More informationNEW VERSION OF DECISION SUPPORT SYSTEM FOR EVALUATING TAKEOVER BIDS IN PRIVATIZATION OF THE PUBLIC ENTERPRISES AND SERVICES
NEW VERSION OF DECISION SUPPORT SYSTEM FOR EVALUATING TAKEOVER BIDS IN PRIVATIZATION OF THE PUBLIC ENTERPRISES AND SERVICES Silvija Vlah Kristina Soric Visnja Vojvodic Rosenzweig Department of Mathematics
More informationIntroduction to LAN/WAN. Network Layer
Introduction to LAN/WAN Network Layer Topics Introduction (55.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues StoreandForward Packet Switching Services
More informationManagement of Telecommunication Networks. Prof. Dr. Aleksandar Tsenov akz@tusofia.bg
Management of Telecommunication Networks Prof. Dr. Aleksandar Tsenov akz@tusofia.bg Part 1 Quality of Services I QoS Definition ISO 9000 defines quality as the degree to which a set of inherent characteristics
More informationPreparing Your IP Network for High Definition Video Conferencing
WHITE PAPER Preparing Your IP Network for High Definition Video Conferencing Contents Overview...3 Video Conferencing Bandwidth Demand...3 Bandwidth and QoS...3 Bridge (MCU) Bandwidth Demand...4 Available
More informationNGN Network Architecture
ITU/BDT Regional Seminar on Costs and Tariffs for Member Countries of the Tariff Group for Africa (TAF) Midrand,, South Africa, June 2005 NGN Network Architecture Oscar González Soto ITU Consultant Expert
More informationSome optimization issues arising in Internet traffic engineering
Some optimization issues arising in Internet traffic engineering Talk given at University of Arizona Tucson, Arizona November 16, 2006 2005 Mauricio G. C. Resende AT&T Labs Research Florham Park, New Jersey
More informationComparison between Vertical Handoff Decision Algorithms for Heterogeneous Wireless Networks
Comparison between Vertical Handoff Decision Algorithms for Heterogeneous Wireless Networks Enrique StevensNavarro and Vincent W.S. Wong Department of Electrical and Computer Engineering The University
More informationNetwork traffic engineering
Toolbox, hybrid IP/MPLS optimisation method and fairness Research Unit in Networking EECS Department University of Liège 13 September 005 Outline 1 3 4 5 Outline MPLS principles 1 MPLS principles 3 4 5
More informationPerformance Evaluation of The Split Transmission in Multihop Wireless Networks
Performance Evaluation of The Split Transmission in Multihop Wireless Networks Wanqing Tu and Vic Grout Centre for Applied Internet Research, School of Computing and Communications Technology, Glyndwr
More informationA new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds q
Computer Networs xxx (007) xxx xxx www.elsevier.com/locate/comnet A new approach to dynamic bandwidth allocation in Quality of Service networs: Performance and bounds q J. Elias a, F. Martignon b, *, A.
More informationA QoS Network Management System for Robust and Reliable Multimedia Services
A QoS Network Management System for Robust and Reliable Multimedia Services S. Das, K. Yamada, H. Yu, S. S. Lee, and M. Gerla Computer Science Department University of California, Los Angeles Los Angeles,
More informationQuality of Service Routing for Supporting Multimedia Applications
Quality of Service Routing for Supporting Multimedia Applications Zheng Wang and Jon Crowcroft Department of Computer Science, University College London Gower Street, London WC1E 6BT, United Kingdom ABSTRACT
More informationInterconnection Networks. Interconnection Networks. Interconnection networks are used everywhere!
Interconnection Networks Interconnection Networks Interconnection networks are used everywhere! Supercomputers connecting the processors Routers connecting the ports can consider a router as a parallel
More informationMPLSTP. Future Ready. Today. Introduction. Connection Oriented Transport
MPLSTP Future Ready. Today Introduction As data traffic started dominating telecom networks, there was a need for transport data networks, as opposed to transport TDM networks. Traditional transport technologies
More informationLoad Balanced OpticalNetworkUnit (ONU) Placement Algorithm in WirelessOptical Broadband Access Networks
Load Balanced OpticalNetworkUnit (ONU Placement Algorithm in WirelessOptical Broadband Access Networks Bing Li, Yejun Liu, and Lei Guo Abstract With the broadband services increasing, such as video
More informationEINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science
EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science Examination Computer Networks (2IC15) on Monday, June 22 nd 2009, 9.00h12.00h. First read the entire examination. There
More informationA Load Balancing Scheme for Congestion Control in MPLS Networks
A Load Balancing Scheme for Congestion Control in MPLS Networks Elio Salvadori, Roberto Battiti UniversitàdiTrento Dipartimento di Informatica e Telecomunicazioni via Sommarive 14, 38050 Povo (TN), Italy
More informationInvestigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions
Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Steve Gennaoui, Jianhua Yin, Samuel Swinton, and * Vasil Hnatyshin Department of Computer Science Rowan University
More informationLoad Balancing of Telecommunication Networks based on Multiple Spanning Trees
Load Balancing of Telecommunication Networks based on Multiple Spanning Trees Dorabella Santos Amaro de Sousa Filipe Alvelos Instituto de Telecomunicações 3810193 Aveiro, Portugal dorabella@av.it.pt Instituto
More informationAn Improved ACO Algorithm for Multicast Routing
An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com
More informationSupporting Differentiated Services with PerClass Traffic Engineering in MPLS
Supporting Differentiated Services with PerClass Traffic Engineering in MPLS Melody Moh moh @IX. sjsu. edu Dept of Math. & Computer Science Belle Wei bwei@email.sjsu.edu Dept of Electrical Engineering
More information