Label Switched Paths Re-configuration under Time-Varying Traffic Conditions
|
|
- Melissa Davidson
- 6 years ago
- Views:
Transcription
1 Label Switched Paths Re-configuration under Time-Varying Traffic Conditions Sandford Bessler Telecommunications Research Center Vienna(ftw) Donau-City Str. 1, A-1220 Vienna, Austria phone: (+43) , fax: (+43) bessler@ftw.at Abstract Multiprotocol label switching (MPLS) has several advantages over destination-based IP routing protocols: it allows to setup end to end paths explicitly (also called label switched paths, LSP), to better monitor the traffic on these LSPs, to perform admission control, etc. While routing along a LSP is considered faster than IP routing, the operation of changing a LSP pipe requires processing and bandwidth resources in the network. This paper investigates cost optimized ways for re-dimensioning existing LSP pipes, to accommodate changing traffic demands. In the presented model the goal is to maximize the amount of carried traffic, while keeping the number of LSP modifications at a minimimum. The presented off-line procedure can be made part of a periodical traffic engineering process. We present a mixed integer LP formulation of this problem, a more efficient heuristic, as well as results on test networks. Keywords: traffic engineering, multi-commodity flows, MPLS, QoS routing, LSP re-optimization, signaling costs, multihour traffic 1 Introduction This paper presents techniques for traffic engineering in QoS- supported IP networks. The approach followed in this paper is based on a centralized optimal routing scheme that, if used in conjunction with the multiprotocol label switching (MPLS) technology, opens the possibility for online admission control and dynamic route assignment. MPLS is an enabling technology for IP networks, with application in traffic engineering. It basically consists of an IP packet forwarding mechanism, a label distribution protocol, control procedures to set-up and tear down Label Switched Paths, and a constraint based routing scheme, especially when path selection methods use other criteria than a metric.[1, 7,, 11, 17] A lot of research work has been done in adapting and reformulating different routing problems in ATM and IP networks in the context of the new MPLS technology. Some approaches used flow optimization algorithms to minimize the maximum link utilization and to reduce in this way congestion [18]. Kodialam and Lakshman [4] solves a series of max-flow problems to find out the critical links in which interference to other paths is likely to occur. The approach followed in this paper is mostly related to the works of Mitra and Ramakrishnan [6] and Suri et al.[2]. The routing problem is equivalent to a linear multicommodity flow problem, for which efficient algorithms exist [19]. Some authors refer to it as the optimal routing, because the obtained solution is a bifurcated multicommodity flow (MCF) that can be reached only by having the knowledge of the whole traffic demands in the network (centralized routing). As observed in [2], splitting an aggregated demand (commodity) on several paths does not imply splitting any individual flow resulted form an online bandwidth request. Moreover, the load sharing capability of MPLS routing is one of the main advantages over OSPF routing (and have lead to a new protocol, OSPF-OMP) [12], so that the requirement for single path routing in some works [20, 18] is imposed only for administrative and simplicity reasons. There are basically two possibilities to achieve a feasible flow-path allocation for any aggregated traffic matrix (we denote also demand matrix): one is to allow variable link capacities leading to a network dimensioning problem. In the studied model, the part of demand exceeding the network capacity is allowed to be lost, without producing earnings. The resulting flows become the bandwidth of the created or modified LSP tunnels and are the basis for admission control of QoS traffic. 1.1 The need for re-optimization A major contribution in this paper is the optimization with the additional goal of minimizing changes to the existing Label Switched Paths (LSP) created in a previous planning step. These changes are associated with signaling costs that reduce the revenues obtained by routing additional traffic into the network. In [9], the authors analyze the traffic streams in a large
2 point of presence (POP). Because of large (15 to 30% ) time of day traffic variations in the studied network, the authors see the need to have a load balancing policy over the time scale of a few hours and reroute mainly large streams (called elephants ). An even larger benefit of the procedure presented here isn t in the time of day traffic variations, that are well understood and for which alternate paths are available, but for the new business models requiring flexible, unanticipated bandwidth provisioning. To our knowledge there are very few works that describe the whole life cycle of traffic engineering activities using MPLS, in the time range of hours to days. Scoglio et al. [3] adapt the MPLS network topology based on the current traffic load. The decision to set-up or tear down LSP is taken dynamically at the arrival of a bandwidth request, and is based on thresholds that depend on IP routing versus LSP signaling costs. Carpenter et al. [18] address the robustness of the flow allocation to the LSP at forecast uncertainty. They describe a procedure for creating new paths and allocating the new traffic again. There are basically two possibility to cope with the bandwidth reserves in the network: either to offer only a part of the link capacity and reserve the rest for non- MPLS traffic, or to scale up the traffic matrix, until it is constrained by the link capacities [20]. It seems that the deployment of MPLS technology to engineer data streams with QoS requirements such as bandwidth, delay, loss probability is still in a beginning stage. One reason for that is the missing of an agreed service management architecture to provide the information for traffic engineering decisions. The Service Level Specification (SLS), studied for example in the Tequila project [15] is the key for the ability to manage bandwidth requests such as the customer wants a 2 MBit/s video connection between 8pm and 11 pm to a certain video server or the customer requests to push daily 2 MBit/s into the network between 8am and 4pm (hose model). In the general case, the customer that subscribes to a service which requires QoS provisioning, delegates to the service provider the negotiation of a service level agreement (SLA) with the network provider. At the network provider, the SLS subscription should trigger the traffic forecasting and network dimensioning update processes. If we refer specifically to the MPLS technology, an offline LSP dimensioning procedure is triggered by the new traffic matrix, and calculates the LSP changes, as shown in Figure 1. In order to enforce these changes, the extended resource reservation protocol RSVP-TE [16] can be used. All the functions needed for the enforcement of the LSP changes resulted from the optimization are supported by RSVP-TE: create a new LSP, destroy a LSP, increase the bandwidth of a LSP, decrease the bandwidth of a LSP. The last two operations are done internally by creating a new path, maintaining the old reservation without double counting, and rerouting smoothly the traffic on the new path. The scheduling functional block shown in Figure 1 is needed to smoothen the signaling load, as the number of changes can be quite large. At service invocation time, a process of traffic aggregation takes place in the ingress routers: packet classification is used to map the packets in forwarding equivalence classes (FEC) The packets related to a SLA are marked accordingly and are forwarded to the appropriate LSP tunnel. If RSVP is used in the access network, the micro-flow requests can be associated to existing aggregated pipes. Planning period Event CB route generation All LSP candidates SLAs Traffic matrix Forecasting Topology LSP Redimensioning Changed scheduler LSP LSPs RSVP_TE LSP Statistics 1.2 Architectural aspects Figure 1: LSP re-configuration architecture 2 Problem Formulation In this section we formulate the multi-commodity flow problem (MCF) in a MPLS-enabled IP network and add constrains related to existing LSP pipes. Consider a network with N nodes and U links with available capacity c u. c u represents in practice the part of the link capacity allocated to MPLS pipes. Another part of the link capacity could carry best effort traffic or IP routed traffic that can be allocated optimally in a subsequent step like it is done in [6]. The commodities are defined by the triple source, destination node and the traffic class (e.g video, VoIP, etc.). It has to be noted that only the edge nodes (called ingress and egress nodes) of the network are traffic sources or sinks, the other core nodes process only transit traffic. The MPLS technology allows to setup explicit routes (ERO) that carry QoS traffic. In the followed approach, a preprocessing step performs the constraint based routing, i.e. selects for each commodity k a number of path alternatives p(k) satisfying QoS requirements, link and node preferences, node disjunction or resilience requirements. p(k) represents the maximal set of paths per commodity, including therefore the existing paths. In case of persist-
3 ing traffic bottlenecks for example, it should be possible to augment the set of paths. A large number of paths will however increase the signaling and scheduling overhead, as well as the bandwidth fragmentation, that is the part of the LSP bandwidth that remains unused because individual bandwidth requests are larger. For the reason of explicit routing, we use the path formulation of the MCF problem [19]. For each j from j = 1, 2..., p(k) let Pj k be the j-th path with P j k(u) = 1 if u Pj k and 0 otherwise. The variables of the problem are the flows x k j that are carried on some of the p(k) paths and sum up to the demand d k. At the end of the procedure, the flows and the corresponding paths lead to the setup of MPLS tunnels of bandwidth x k j. Assuming that each flow unit brings a revenue of e k j, we define the objective to be maximized as the revenues earned by carrying as much as possible of the demands d k [6]. The novel aspect in the formulation of the MCF problem is the additional constraint to express that each new solution has to take into consideration an existing set of tunnels x0 k j calculated in the previous planning step. One cannot simply tear-down the existing tunnels, first because they carry traffic all the time, and second, because of the large amount of signaling traffic created with these changes. Therefore, we introduce into the objective function the penalty c k j of changing the bandwidth of the existing tunnel x0 k j. y k j = { 0 if x k j = x0 k j 1 otherwise The binary variable yj k are set to one, only if the corresponding tunnels xo k j have to be re-dimensioned, or a new tunnel corresponding to another path j has to be created. (1) is a non-linear constraint as encountered in problems with fixed costs [13]. Standard solvers like CPLEX [14] have difficulties with such nonlinear constraints. With some tricks we obtain the following inequalities equivalent of (1), which require two binary variables yj k and zj k: (1) x0 k j (1 z k j ) + y k j x k j (y k j z k j )M + x0 k j, j = 1,..., p(k), k K (2) where M is a large constant. We can easily check that if x k j = x0k j then yk j = 0, otherwise yk j is one. The problem REOPT can now be formulated as follows: max p(k) K e k j x k j c k j yj k (3) k=1 j=1 subject to : p(k) K Pj k (u)x k j c u, u U (4) k=1 j=1 p(k) x k j d k, k = 1,...K (5) j=1 x k j 0, j = 1,..., p(k), k = 1,..., K (6) x0 k j (1 z k j ) + y k j x k j (y k j z k j )M + x0 k j, j = 1,..., p(k), k K (7) The unity costs c k j may depend on the individual path, being proportional for example to the number of router nodes on the path. For simplicity reasons, we assume that the costs for both creation and re-dimensioning of an LSP are equal. The inequalities (4) state that the flow on each link should not exceed the reserved link capacity c u. There are U capacity constraints. The inequalities (5) express the admission constraints: the calculated flows sum up in the best case to the traffic demand d k. The slack represents the lost traffic, i.e. the part of the demand traffic that is rejected. 2.1 Numerical results We started the experiments with the small network topology showed in the figure and used in [3] Figure 2: Example network topology Two explicit paths for each of the eight commodities 1-7, 1-8, 1-, 2-7, 2-9, 2-, 1-9 and 2-8 have been (manually) preselected, however this process can be done automatically in practice. The selected routes are intended to be a constant superset, as long as the topology remains
4 Commodity d k x k 1, x k , , , , , , , , 25 Total Table 1: Demands, initial flow distribution c k j Net earnings Changes Lost Mbs Table 2: 25% demand variation, impact of unit change costs unchanged. We consider a single QoS traffic class, although several QoS traffic classes do not have any impact on the model, they affect only the assignment of path candidates to commodities. The link capacities have been set to 0 in order to create a moderately loaded network. A first run creates a flow distribution x, that is set to x0. In a first experiment with the test network, we simulated a traffic shift situation by increasing the traffic form node 1 to the other commodities by about 25% and decreasing the traffic from node 2 also by 25%. This is in conformance with the observation in [9] that large streams display large variations during the day and that a load balancing strategy has to be achieved to reroute mainly the few large traffic flows ( elephants ). In Table 2 we show the impact of changing the relationship between revenue and change costs on the solution. With e k j constant end equal to 1.9, the amount of lost traffic increases when changes become expensive. As expected, the net earnings decrease, the amount of changes decreases with making them expensive. The initial flow allocated on the link 1-4 has contributions from demands on the commodities 1-7, 1-8, 2-7, 2-8 so that the residual capacity on the link 1-4 is zero. Some of the demands (on commodities 1-7, 1-8) increased, the other (2-7, 2-8) decreased. After the optimization run with c k j = 20 and 25% demand variation, the residual capacity of link 1-4 changes to 20.5, because of rerouting of some commodities on other LSPs. In Table 3 the calculated flows for c k j = 20 are shown. The behavior of the procedure is as expected, it redistributes the traffic on other paths, but does it with minimal changes. We can even improve the solution by reducing the number of changes indicated in the variable y, if we Commodity d k x k 1, x k , 32.5* , , , 27.5* , 17* 2-20 *, , , 17* Total Table 3: Solution for c k j = 20. Changed LSPs are marked with * make the following observation: the current model always requires to change the LSP bandwidth if the new demand is lower than the old demand! During the search this is needed to allow the eventual size increase of another LSP. However, once the final solution is found, for those decreasing demands d k we could set the total flow to the old value x0, in case the link capacity constraints on that path are fulfilled. With other words, when a traffic demand decreases, we reduce the size of the corresponding tunnels, only in case that bandwidth is needed elsewhere. This lazy assignment, shown in the pseudo-code below, will keep LSP sizes according to a peak traffic value if the residual path capacity res is large enough. However as soon as some higher traffic demands have to be accommodated, the oversized tunnels are changed to the actual needs. In order to illustrate the behavior above, we have run the optimization procedure repeatedly, changing the demands randomly between 50% and 150%. After each iteration, we apply the lazy assignment procedure : do for all 1 j p(k), 1 k K such that x k j < x0k j res min u/p k j (u)=1(c u K p(i) i=1 l=1 P l i(u)xi l ) if res x0 k j xk j then x k j x0k j & y k j 0 end The results for the commodity 1-7 during reoptimization periods are shown in Figure 3. We can observe that the total flow follows the demand until the fourth planning period. After that, the decrease in demand and the existing residual capacity allow to maintain a higher reserved bandwidth (denoted here with the total flow) according to out lazy changes. Comparing the demand and total flow for the commodity 1-8 for example, we can see in Figure 4 both the case of high demand that is too costly to carry (lost traffic) and the case of an over-dimensioned tunnel that is too costly to change when the demand decreases.
5 demand total flow LSP LSP lost (y) Lost (y Table 4: Comparison between linear relaxation (left) and integer solution (right) (Core NSF network [6]). Figure 3: Demand and flow variation of commodity demand total flow L/O (y) Lost (y Table 5: Impact of the lazy dimensioning (left) on the number of LSP, admitted and lost traffic. (Core NSF network [6]) Figure 4: Demand and flow variation of commodity A LP relaxation heuristic In the link-path flow formulation used above, the number of variables and constraints depends on the number of links U, commodities K and preselected path alternatives p(k). As an example, for a network with ingress and egress nodes, and 3 QoS traffic classes, we obtain K=300 commodities (full traffic matrix). If 3 paths are preselected for each commodity we have: 900 x k j variables, 1800 binary variables and more than 2000 constraints. The binary constraints make the problem intractable for large instances. Therefore, we compared the problem REOPT with the following heuristic based on a linear relaxation. We remove the integrability constraints and solve the LP problem. In a subsequent step, we analyze the obtained LP solution for each commodity. Let us define the net profit for an increasing flow by (x k j x0k j )ek j ck j. If this expression is negative, the change is not worth to be done, therefore we set yj k = 0 and x k j = x0k j Otherwise, we perform the change setting yj k = 1. For decreasing flows, we apply the lazy assignment procedure. We compared the integer and the relaxed solutions on the network example Core NSF used in [6]. The network has 8 nodes, 20 links, 64 commodities and one traffic class. For most commodities we can choose between 2 routes. To create test instances, we started with one demand matrix and one initial solution x0, then changed the demand matrix randomly to values between 50% to 150% and the initial solution between 75% to 125% and repeated the experiment times with both algorithms, using the CPLEX solver. Table 4 shows the number of changes, the total flow admitted and the lost bandwidth for both algorithms. The exact (integer) procedure produces on the average 7,9% less LSPs changes and 2,8% less lost traffic than the heuristic. Also for this network example, if we apply the lazy dimensioning scheme during periods to LSP reconfiguration, the number of changed tunnels is drastically reduced from an average of 24 to an average of (Table 5). Note that, when the difference between total demand and admitted traffic becomes negative, we have instead of a lost traffic - a number of over-dimensioned tunnels.
6 3 Conclusions and future work We have presented a multi-commodity flow formulation for the problem of periodical re-optimization of QoS flows taking into consideration existing LSP tunnels. The model uses explicit routes resulting in a link-path formulation. This approach allows to build an off-line traffic engineering system that creates optimized transitions from one LSP configuration to the next one. The resulting number of LSP changes is dependent on signaling costs parameters. A lazy tunnel dimensioning scheme allows the LSP tunnels to adapt gradually to real traffic increases, but keep the bandwidth unchanged in case of periodical traffic oscillations. Future research will focus on the scheduling of LSP changes into the network in order to limit the signaling traffic load. Finally, the algorithms discussed above will be integrated into a closed loop traffic engineering system, that considers service level agreements, novel methods for traffic forecasting. Acknowledgments This work has been done at ftw, the Telecommunications Research Center Vienna, within the project Performance Management over wired Networks: End to End Architecture and Realization, a project funded by the Austrian government. References [1] X.Xiao, A. Hannan, B. Bailey, LM Ni, Traffic Engineering with MPLS in Internet, IEEE Network, March April 2000 [2] S. Suri, M. Waldvogel, PR Warkhede, Profile based routing: A new framework for MPLS traffic engineering,proceedings of QofIS 2001 [3] C. Scoglio, JC de Oliveira, IF Akyldiz, G. Uhl, A new Threshold-based policy for label switching path (LSP) setup in MPLS networks,, in Proceedings ITC17, 2001 Brazil [4] M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to MPLS Traffic Engineering,INFOCOM [5] Quality of Service Based routing: Apostopoloulos G, R.Guerin, S.Kamat, S.K.Triphati, A Performance Perspective,In Proceedings of SIGCOMM, pages 1728, Vancouver, Ontario, CANADA, September [6] D. Mitra, KG Ramakrishnan, Techniques for Traffic Engineering of Multiservice, Multipriority Networks, BLTJ Vol. 6 No.1, 2001 [7] IETF Draft, jrex/jerry/annex6- tewg-qos-routing-03.txt.pdf [8] Grenville Armitage, MPLS: The magic behind the myths IEEE Comm. Mag. Jan 2000 [9] S. Bhattacharyya, C. Diot J. Jetcheva, N. Taft, Pop-Level and Access-Link-Level Traffic Dynamics in a Tier-1 POP, Technical Report TR01-ATL , Sprint Labs, February Available at [] A Framework for Internet Traffic Engineering, draft-ietf-tewg-framework-05.txt [11] G.Ash, Traffic Engineering and QoS Methods for IP-, ATM-, and TDM-Based Multiservice Networks, draft-ietf-tewg-qos-routing-01.txt [12] C. Villamizar, MPLS Optimized Multipath, [13] C.H: Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, [14] CPLEX Solver, [15] Tequila Project, Deliverable D1.1 - Functional architecture definition and top level design [16] D. Awduche et al., RFC RSVP-TE: Extensions to RSVP for LSP Tunnels [17] Bruce Davie, Yakov Rekhter, MPLS - technolgy and Applications, Academic Press 2000 [18] T. Carpenter, K.R Krishnan, D. Shallcross, Enhancements to Traffic Engineering for Multiprotocol Switching, ITC17, Brazil [19] Gondran, M. Minoux, Graphs and Algorithms, 1984 [20] G. Hasslinger, S. Schnitter, Algorithms for traffic engineering, INFORMS 2002
Network Protection Design for MPLS Networks
Network Protection Design for MPLS Networks Gaurav Agrawal, Dijiang Huang, Deep Medhi Computer Science and Electrical Engineering Department University of Missouri-Kansas City, MO 64110, USA Computer Science
More informationEvaluation of Performance for Optimized Routing in MPLS Network
Evaluation of Performance for Optimized Routing in MPLS Network Neethu T U Student,Dept. of Electronics and Communication The Oxford College of Engineering Bangalore, India Reema Sharma Assistant Professor,Dept.of
More informationComputer Network Architectures and Multimedia. Guy Leduc. Chapter 2 MPLS networks. Chapter 2: MPLS
Computer Network Architectures and Multimedia Guy Leduc Chapter 2 MPLS networks Chapter based on Section 5.5 of Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross Addison-Wesley,
More informationMinimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications
2566 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 18, NO. 12, DECEMBER 2000 Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications Koushik Kar,
More informationInvestigating Bandwidth Broker s inter-domain operation for dynamic and automatic end to end provisioning
Investigating Bandwidth Broker s inter-domain operation for dynamic and automatic end to end provisioning Christos Bouras and Dimitris Primpas Research Academic Computer Technology Institute, N.Kazantzaki
More informationA QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism
A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada and Akira Chugo Fujitsu Laboratories Ltd. 4-1-1, Kamikodanaka, Nakahara, Kawasaki,
More informationAn Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation
Telecommunication Systems 19:3,4, 481 495, 2002 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation GAEIL
More informationMPLS/RSVP-TE-BASED FUTURE UMTS RADIO ACCESS NETWORK
12th GI/ITG CONFERENCE ON MEASURING, MODELLING AND EVALUATION OF COMPUTER AND COMMUNICATION SYSTEMS 3rd POLISH-GERMAN TELETRAFFIC SYMPOSIUM MPLS/RSVP-TE-BASED FUTURE UMTS RADIO ACCESS NETWORK René Böringer*,
More informationClassification and Evaluation of Constraint-Based Routing Algorithms for MPLS Traffic Engineering
Classification and Evaluation of Constraint-Based Routing Algorithms for MPLS Traffic Engineering GET/ENST Bretagne - Département Réseaux et Services Multimédia 2 rue de la Châtaigneraie - CS 1767-35576
More informationAnalysis of Dynamic QoS Routing Algorithms for MPLS Networks
Analysis of Dynamic QoS Routing Algorithms for MPLS Networks Antonio Capone, Luigi Fratta, Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano Pzza L Da Vinci 32, 2133 Milano
More informationOptimal Network Flow Allocation. EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004
Optimal Network Flow Allocation EE 384Y Almir Mutapcic and Primoz Skraba 27/05/2004 Problem Statement Optimal network flow allocation Find flow allocation which minimizes certain performance criterion
More informationBW Protection. 2002, Cisco Systems, Inc. All rights reserved.
BW Protection 2002, Cisco Systems, Inc. All rights reserved. 1 Cisco MPLS - Traffic Engineering for VPNs Amrit Hanspal Sr. Product Manager MPLS & QoS Internet Technologies Division 2 Agenda MPLS Fundamentals
More informationReprinted with kind permission of Springer Science+Business Media.
Riikka Susitaival, Jorma Virtamo, and Samuli Aalto. Load balancing by MPLS in differentiated services networks. In Proceedings of the International Workshop on Architectures for Quality of Service in the
More informationMPLS-TE Configuration Application
CHAPTER 6 The contains the following tabs and subtabs: Global Tab, page 6-53 Labels Tab, page 6-54 Links Tab, page 6-55 General Subtab, page 6-56 Backup Tunnels Subtab, page 6-57 Tunnel Head Tab, page
More informationTechniques and Protocols for Improving Network Availability
Techniques and Protocols for Improving Network Availability Don Troshynski dtroshynski@avici.com February 26th, 2004 Outline of Talk The Problem Common Convergence Solutions An Advanced Solution: RAPID
More informationModelling direct application to network bandwidth provisioning for high demanding research applications
Modelling direct application to network bandwidth provisioning for high demanding research applications H. Wessing, Y. Yan and M. Berger Research Center COM Technical University of Denmark Bldg. 345V,
More informationImproved MPLS-TE LSP Path Computation using Preemption
Improved MPLS-TE LSP Path Computation using Preemption Imène Chaieb and Jean-Louis Le Roux France Telecom R&D, 2 Avenue Pierre Marzin Lannion 22307, France Email: {imene.chaieb, jeanlouis.leroux}@orange-ftgroup.com
More informationAn Efficient Dynamic Bandwidth Allocation Algorithm for Quality of Service Networks
An Efficient Dynamic Bandwidth Allocation Algorithm for Quality of Service Networks J. Elias 1, F. Martignon 2, and A. Capone 3 1 University of Paris 6, LIP6 Laboratory, 8 rue du Capitaine Scott, 75015,
More informationHST-3000 Class of Service (CoS) Test Suite
Application Note HST-3000 Class of Service (CoS) Test Suite By John Williams The development of new Internet Protocol (IP)-packet based, so called Triple-Play, services (voice, video, data) delivered over
More informationRouting and Traffic Engineering in Hybrid RF/FSO Networks*
Routing and Traffic Engineering in Hybrid RF/FSO Networks* Abhishek Kashyap and Mark Shayman Department of Electrical and Computer Engineering, University of Maryland, College Park MD 20742 Email: {kashyap,
More informationDynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration Murali Kodialam T. V. Lakshman Bell Laboratories Lucent Technologies 101 Crawfords Corner Road Holmdel, NJ 033, USA muralik, lakshman @bell-labs.com
More informationMulticast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM
Multicast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM Jeong-Mi Kim 1, Oh-Han Kang 2, Jae-Il Jung 3, and Sung-Un Kim 1,4 1 Pukyong National University, 599-1 Daeyeon 3-Dong Nam-Gu, Busan,
More informationCall Admission Control in IP networks with QoS support
Call Admission Control in IP networks with QoS support Susana Sargento, Rui Valadas and Edward Knightly Instituto de Telecomunicações, Universidade de Aveiro, P-3810 Aveiro, Portugal ECE Department, Rice
More informationTowards an Adaptive and Intelligent MPLS Network
Towards an Adaptive and Intelligent MPLS Network Rana Rahim-Amoud, Leila Merghem-Boulahia, and Dominique Gaiti ISTIT, University of Technology of Troyes 12, rue Marie Curie, BP 2060, 10 010 TROYES CEDEX,
More informationEmbedded MPLS Architecture
Embedded MPLS Architecture Raymond Peterkin, Dan Ionescu School of Technology and Engineering (SITE) University of Ottawa 161 Louis Pasteur, P.O. Box 450, Station A, Ottawa, Ontario, K1N 6N5 CANADA peterkin@site.uottawa.ca
More informationMaximize Bandwidth Utilization with Juniper Networks TE++
Maximize Bandwidth Utilization with Juniper Networks TE++ Lower Operations Overhead while Simplifying Network Planning 1 Table of Contents Executive Summary... 3 Introduction: The Bandwidth Challenge...
More informationA host selection model for a distributed bandwidth broker
A host selection model for a distributed bandwidth broker Christos Bouras Dimitris Primpas Research Academic Computer Technology Institute, Ν.Κazantzaki Str., Patras University 26500 Rion, Patras, Greece
More informationMPLS Networks: Design and Routing Functions
MPLS Networks: Design and Routing Functions Course Description This course provides an understanding of how MPLS works its advantages and limitations and how it can be deployed to provide effective services
More informationTHE Differentiated Services (DiffServ) architecture [1] has been
Efficient Resource Management for End-to-End QoS Guarantees in DiffServ Networks Spiridon Bakiras and Victor O.K. Li Department of Electrical & Electronic Engineering The University of Hong Kong Pokfulam
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2017 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński MPLS Multiprotocol Label Switching MPLS introduction
More informationTraffic(Mbps)/Capacity(Mbps) /10 6/ / /10 7/ (a) G: Resource allocation graph. (b) Hop-count constrained graph
Dynamic Constrained Multipath Routing for MPLS Networks Yongho Seok, Youngseok Lee, Yanghee Choi Seoul National University Seoul, Korea fyhseok, yslee, yhchoig@mmlab.snu.ac.kr Changhoon Kim Electronic
More informationMaster s Thesis. Title. Supervisor Professor Masayuki Murata. Author Yuki Koizumi. February 15th, 2006
Master s Thesis Title Cross-Layer Traffic Engineering in IP over WDM Networks Supervisor Professor Masayuki Murata Author Yuki Koizumi February 15th, 2006 Graduate School of Information Science and Technology
More informationThreshold-Based Policy for LSP and Lightpath Setup in GMPLS Networks
Threshold-Based Policy for LSP and Lightpath Setup in GMPLS Networks Tricha Anjali and Caterina Scoglio Broadband and Wireless Networking Laboratory School of Electrical and Computer Engineering Georgia
More informationProfile-Based Routing and Traffic Engineering
Profile-Based Routing and Traffic Engineering Subhash Suri, Marcel Waldvogel, Daniel Bauer, and Priyank Ramesh Warkhede Abstract We present a new algorithm and framework for dynamic routing of bandwidth-guaranteed
More informationIn the world of networks, control techniques
NEM470 12/23/02 7:09 PM Page 1 INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT Int. J. Network Mgmt 2003; 13: 000 000 (DOI: 10.1002/nem.470) Resource allocation in the new fixed and mobile Internet generation
More informationLSP Setup Arrival Reordering Approach for MPLS-TE Routing
LSP Setup Arrival Reordering Approach for MPLS-TE Routing Imène Chaieb and Jean-Louis Le Roux France Telecom R&D, Lannion 37, France Email: {imene.chaieb, jeanlouis.leroux}@orange-ftgroup.com Bernard Cousin
More informationDynamic Routing of Restorable Bandwidth-Guaranteed Tunnels Using Aggregated Network Resource Usage Information
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 3, JUNE 2003 399 Dynamic Routing of Restorable Bwidth-Guaranteed Tunnels Using Aggregated Network Resource Usage Information Murali Kodialam, Associate
More informationDiffserv over MPLS QoS Policy Management
Diffserv over MPLS QoS Policy Management Yin Ling Liong 1, Roberto Barnes 2, Man Li 1 1 Nokia Research Center, 5 Wayside Rd Burlington, MA 01803, USA {Yin-ling.Liong, Man.M.Li}@nokia.com 2 Nokia Research
More informationIntroduction to Segment Routing
Segment Routing (SR) is a flexible, scalable way of doing source routing. Overview of Segment Routing, page 1 How Segment Routing Works, page 2 Examples for Segment Routing, page 3 Benefits of Segment
More informationInternetworking with Different QoS Mechanism Environments
Internetworking with Different QoS Mechanism Environments ERICA BUSSIKI FIGUEIREDO, PAULO ROBERTO GUARDIEIRO Laboratory of Computer Networks, Faculty of Electrical Engineering Federal University of Uberlândia
More informationConverged Communication Networks
Converged Communication Networks Dr. Associate Professor Department of Electrical Engineering Indian Institute of Technology Bombay Powai, Mumbai - 400076 girishs@ee.iitb.ac.in Outline Convergence in core
More informationQuality of Service II
Quality of Service II Patrick J. Stockreisser p.j.stockreisser@cs.cardiff.ac.uk Lecture Outline Common QoS Approaches Best Effort Integrated Services Differentiated Services Integrated Services Integrated
More informationNetwork Configuration Example
Network Configuration Example RSVP LSP Tunnels Modified: 2016-12-14 Juniper Networks, Inc. 1133 Innovation Way Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net All rights reserved. Juniper
More informationMultiprotocol Label Switching (MPLS) Traffic Engineering
Multiprotocol Label Switching (MPLS) Traffic Engineering Feature Overview Multiprotocol Label Switching (MPLS) traffic engineering software enables an MPLS backbone to replicate and expand upon the traffic
More information6 MPLS Model User Guide
6 MPLS Model User Guide Multi-Protocol Label Switching (MPLS) is a multi-layer switching technology that uses labels to determine how packets are forwarded through a network. The first part of this document
More informationOverview of the RSVP-TE Network Simulator: Design and Implementation
Overview of the RSVP-TE Network Simulator: Design and Implementation D. Adami, C. Callegari, S. Giordano, F. Mustacchio, M. Pagano, F. Vitucci Dept. of Information Engineering, University of Pisa, ITALY
More informationAhmed Benallegue RMDCN workshop on the migration to IP/VPN 1/54
MPLS Technology Overview Ahmed Benallegue A.Benallegue@ecmwf.int RMDCN workshop on the migration to IP/VPN 1/54 Plan 1. MPLS basics 2. The MPLS approach 3. Label distribution RSVP-TE 4. Traffic Engineering
More informationVFMAs, Virtual-flow Multipath Algorithms for MPLS
VFMAs, Virtual-flow Multipath Algorithms for MPLS Dario Pompili, Caterina Scoglio, Vehbi C. Gungor School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, GA 3332 Department
More informationJanuary 8, 2013 MPLS WG, IETF 85 MULTI-PATH RSVP-TE KIREETI KOMPELLA CONTRAIL SYSTEMS
MULTI-PATH RSVP-TE KIREETI KOMPELLA CONTRAIL SYSTEMS The Choice Today S 14 ECMP paths from S to D 1. ECMP across all equal-cost paths using LDP 2. OR individual constrained TE paths using RSVP-TE D Why
More informationCURRENT routing schemes typically focus on discovering
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 2, APRIL 2007 413 Multipath Routing Algorithms for Congestion Minimization Ron Banner, Senior Member, IEEE, and Ariel Orda, Fellow, IEEE Abstract Unlike
More informationOn the Scalability-Performance Tradeoffs in MPLS and IP Routing
Boston University OpenBU Computer Science http://open.bu.edu CAS: Computer Science: Technical Reports 22 On the Scalability-Performance Tradeoffs in MPLS and IP Routing Yilmaz, Selma Boston University
More informationResilient Networks. 3.1 Resilient Network Design - Intro. Mathias Fischer
Mathias Fischer Resilient Networks. Resilient Network Design - Intro Prepared along: Michal Pioro and Deepankar Medhi - Routing, Flow, and Capacity Design in Communication and Computer Networks, The Morgan
More informationDomain Based Approach for QoS Provisioning in Mobile IP
Domain Based Approach for QoS Provisioning in Mobile IP Ki-Il Kim and Sang-Ha Kim Department of Computer Science 220 Gung-dong,Yuseong-gu, Chungnam National University, Deajeon 305-764, Korea {kikim, shkim}@cclab.cnu.ac.kr
More informationLecture 13. Quality of Service II CM0256
Lecture 13 Quality of Service II CM0256 Types of QoS Best Effort Services Integrated Services -- resource reservation network resources are assigned according to the application QoS request and subject
More informationDesigning A New Routing Simulator for DiffServ MPLS Networks *
Designing A New Routing Simulator for DiffServ MPLS Networks * Peng Zhang, Zhansong Ma, Raimo Kantola Networking Laboratory Helsinki University of Technology Otakaari 5A, Espoo, FIN-02015, Finland Tel:
More informationTelecommunication Services Engineering Lab. Roch H. Glitho
1 Quality of Services 1. Terminology 2. Technologies 2 Terminology Quality of service Ability to control network performance in order to meet application and/or end-user requirements Examples of parameters
More informationLink Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Classes
Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE Classes Kehang Wu Douglas S. Reeves Capacity Planning for QoS DiffServ + MPLS QoS in core networks DiffServ provides
More informationExtending MPLS Traffic Engineering to deal with QoS
Extending Traffic Engineering to deal with QoS Alessio Botta (3), Paola Iovanna (1), Roberto Mameli (1), Giovanna Piantanida (1), Stefano Salsano (2) (1) Ericsson Lab Italy S.p.A. - (2) DIE Università
More informationJunos OS. RSVP LSP Tunnels Feature Guide. Release Published: Copyright 2011, Juniper Networks, Inc.
Junos OS RSVP LSP Tunnels Feature Guide Release 11.4 Published: 2011-11-08 Juniper Networks, Inc. 1194 North Mathilda Avenue Sunnyvale, California 94089 USA 408-745-2000 www.juniper.net This product includes
More informationNetwork Topology Control and Routing under Interface Constraints by Link Evaluation
Network Topology Control and Routing under Interface Constraints by Link Evaluation Mehdi Kalantari Phone: 301 405 8841, Email: mehkalan@eng.umd.edu Abhishek Kashyap Phone: 301 405 8843, Email: kashyap@eng.umd.edu
More informationTEQUILA Engineering Approach
TEQUILA Approach David Griffin University College London, UK Premium IP Cluster Joint Review, 3-4 April 2001 Overview Service Subscription GUI Forecast Service Subscription LDAP Service Subscriptions Repository
More informationCopyright (C) The Internet Society (2002). All Rights Reserved.
Network Working Group Request for Comments: 3214 Category: Standards Track J. Ash AT&T Y. Lee Ceterus Networks P. Ashwood-Smith B. Jamoussi D. Fedyk D. Skalecki Nortel Networks L. Li SS8 Networks January
More informationQoS Online Routing and MPLS Multilevel Protection: A Survey
ACCEPTED FROM OPEN CALL QoS Online Routing and MPLS Multilevel Protection: A Survey Jose L. Marzo and Eusebi Calle, Universitat de Girona Caterina Scoglio and Tricha Anjali, Georgia Institute of Technology
More informationOutline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
More informationInternet Engineering Task Force. G. Karagiannis University of Twente. February 2004
Internet Engineering Task Force INTERNET-DRAFT Expires July 2004 A. Bader L. Westberg Ericsson G. Karagiannis University of Twente RMD (Resource Management in Diffserv) QoS-NSLP model draft-bader-rmd-qos-model-00.txt
More informationQuality of Service Monitoring and Delivery Part 01. ICT Technical Update Module
Quality of Service Monitoring and Delivery Part 01 ICT Technical Update Module Presentation Outline Introduction to IP-QoS IntServ Architecture DiffServ Architecture Post Graduate Certificate in Professional
More informationSupporting Quality of Service for Internet Applications A thesis presented for the degree of Master of Science Research
Supporting Quality of Service for Internet Applications A thesis presented for the degree of Master of Science Research Department of Computer Systems Faculty of Information Technology University of Technology,
More informationProgress Report No. 3. A Case Study on Simulation Scenario
NEXT GENERATION NETWORK (NGN) AVAILABILITY & RESILIENCE RESEARCH Progress Report No. 3 A Case Study on Simulation Scenario The University of Canterbury Team 21 December 2005 Progress Report This report
More informationPresentation Outline. Evolution of QoS Architectures. Quality of Service Monitoring and Delivery Part 01. ICT Technical Update Module
Quality of Service Monitoring and Delivery Part 01 ICT Technical Update Module Presentation Outline Introduction to IP-QoS IntServ Architecture DiffServ Architecture Post Graduate Certificate in Professional
More informationDesigning Multiprotocol Label Switching Networks
TOPICS IN INTERNET TECHNOLOGY Designing Multiprotocol Label Switching Networks Jeremy Lawrence, Cisco Systems 1 s are also known as label edge routers. Most commercially available LSRs have at least limited
More informationBASIC MPLS - MPLS Traffic Engineering Network
BASIC MPLS - MPLS Traffic Engineering Network Traffic engineering is essential for service provider and Internet service provider (ISP) backbones. Such backbones must support a high use of transmission
More informationNext Generation Networks MultiService Network Design. Dr. Ben Tang
Next Generation Networks MultiService Network Design Dr. Ben Tang April 23, 2008 Operators face difficult network planning and design questions Can your current planning methods handle the complexity of
More informationA Congestion Contribution-based Traffic Engineering Scheme using Software-Defined Networking
A Congestion Contribution-based Traffic Engineering Scheme using Software-Defined Networking Dongjin Hong, Jinyong Kim, and Jaehoon (Paul) Jeong Department of Electrical and Computer Engineering, Sungkyunkwan
More informationDeploying MPLS & DiffServ
Deploying MPLS & DiffServ Thomas Telkamp Director, Data Architecture & Technology Global Crossing Telecommunications, Inc. telkamp@gblx.net MPLS and DiffServ technologies are getting a lot of attention
More informationEffect of Context Transfer during Handoff on Flow Marking in a DiffServ Edge Router
Effect of Context Transfer during Handoff on Flow Marking in a DiffServ Edge outer Muhammad Jaseemuddin 1, Omer Mahmoud 2 and Junaid Ahmed Zubairi 3 1 Nortel Networks, Ottawa, Canada, 2 International Islamic
More informationSERIES Y: GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS AND NEXT-GENERATION NETWORKS Internet protocol aspects Transport
International Telecommunication Union ITU-T Y.1315 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU (09/2006) SERIES Y: GLOBAL INFORMATION INFRASTRUCTURE, INTERNET PROTOCOL ASPECTS AND NEXT-GENERATION NETWORKS
More informationfor Metropolitan Area Networks MPLS No. 106 Technology White Paper Abstract
No. 106 Technology White Paper Page: 1 of 7 MPLS for Metropolitan Area Networks Abstract The demand for bandwidth in Metropolitan Area Networks (MANs) and the increased availability of fiber has created
More informationQuality of Service in the Internet
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 informationA Bandwidth-Broker Based Inter-Domain SLA Negotiation
A Bandwidth-Broker Based Inter-Domain SLA Negotiation Haci A. Mantar θ, Ibrahim T. Okumus, Junseok Hwang +, Steve Chapin β θ Department of Computer Engineering, Gebze Institute of Technology, Turkey β
More information2D1490 p MPLS, RSVP, etc. Olof Hagsand KTHNOC/NADA
2D1490 p4 2007 MPLS, RSVP, etc Olof Hagsand KTHNOC/NADA Literature Handouts: MPLS-Enabled applications (Minei, Lucek). Parts of Section 1. JunOS Cookbook: Chapter 14 Background MPLS - Multiprotocol Label
More informationEfficient QoS Partition and Routing in Multiservice IP Networks
Efficient QoS Partition and Routing in Multiservice IP Networks I. Atov H. T. Tran R. J. Harris RMIT University Melbourne Box 2476V Vic. 3001, Australia Abstract This paper considers the combined problem
More informationImproving the usage of Network Resources using MPLS Traffic Engineering (TE)
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Improving
More informationTrafffic Engineering 2015/16 1
Traffic Engineering 2015/2016 Traffic Engineering: from ATM to MPLS fernando.silva@tecnico.ulisboa.pt Instituto Superior Técnico Trafffic Engineering 2015/16 1 Outline Traffic Engineering revisited Traffic
More informationLoop Free Alternate and Remote Loop Free Alternate IP Fast Reroute
Loop Free Alternate and Remote Loop Free Alternate IP Fast Reroute Contents Introduction Prerequisites Requirements Components Used Background Information Understand MPLS Configure Network Diagram Configurations
More informationDIFFSERV-AWARE FLOW ADMISSION CONTROL AND RESOURCE ALLOCATION MODELING
EuroFGI Workshop on IP QoS and Traffic Control P. Pereira (Ed.) Lisbon, Portugal, December 6-7, 7 DIFFSERV-AWARE FLOW ADMISSION CONTROL AND RESOURCE ALLOCATION MODELING Gilles Bertrand, Géraldine Texier
More informationOn The Impact of Aggregation on The Performance of Traffic Aware Routing Λ
On The Impact of Aggregation on The Performance of Traffic Aware Routing Λ A. Sridharan y S. Bhattacharyya, C. Diot R. Guérin y J. Jetcheva z, N. Taft U. Pennsylvania Sprint Labs U. Pennsylvania Sprint
More informationInternet QoS : A Big Picture
Internet QoS : A Big Picture Xipeng Xiao and Lionel M. Ni, M, Michigan State University IEEE Network, March/April 1999 Oct 25, 2006 Jaekyu Cho Outline Introduction IntServ/RSVP DiffServ MPLS Traffic Engineering/CBR
More informationMohammad Hossein Manshaei 1393
Mohammad Hossein Manshaei manshaei@gmail.com 1393 Voice and Video over IP Slides derived from those available on the Web site of the book Computer Networking, by Kurose and Ross, PEARSON 2 Multimedia networking:
More informationMPLS/Tag Switching. Background. Chapter Goals CHAPTER
28 CHAPTER Chapter Goals Understand the advantages of MPLS. Learn the components of an MPLS system. Compare and contrast MPLS and hop-by-hop routing. Describe the two methods of label distribution. Explain
More informationProtection Switching and Rerouting in MPLS
Protection Switching and Rerouting in MPLS S. Veni Dr.G.M.Kadhar Nawaz Research Scholar, Director, Dept. of MCA Bharathiar University Sona College of Technology Coimbatore, India Salem, India venii_k@yahoo.com
More informationAdvanced Computer Networks
Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr
More informationOptimal network flow allocation
Optimal network flow allocation EE384Y Project intermediate report Almir Mutapcic and Primoz Skraba Stanford University, Spring 2003-04 May 10, 2004 Contents 1 Introduction 2 2 Background 2 3 Problem statement
More informationDig into MPLS: Transit Tunnel Diversity
January 2015 Dig into MPLS: Transit Tunnel Diversity Yves VANAUBEL Pascal MÉRINDOL Jean-Jacques PANSIOT Benoit DONNET Summary Motivations MPLS Background Measurement Campaign Label Pattern Recognition
More informationSimulation of Energy Efficiency in Virtual Topology
Simulation of Energy Efficiency in Virtual Topology 1 Nanda Kumar. S, 2 Selva Ra. P Department. of Information Technology, SRM University, Chennai, India 1 nanda6488@gmail.com, 2 selvara.p@ktr.srmuniv.ac.in
More informationMulticast routing Draft
Multicast routing Draft Lucia Tudose Nokia Research Center E-mail: tudose@research.nokia.com Abstract Multicast routing is establishing a tree which is routed from the source node and contains all the
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. 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 informationService Level Specifications, Cornerstone to E2E QoS across the Internet?
Service Level Specifications, Cornerstone to E2E QoS across the Internet? Yves T Joens Project Manager Network Strategy Group Yves T Joens, Washington 25-26 October page n 1» Outline IP Research in Europe
More informationCall Admission Control: QoS Issue for VoIP
Call Admission Control: QoS Issue for VoIP Mohammad Asadul Hoque Database Administrator, IT Division TM International Bangladesh Limited (AKTEL) Dhaka, Bangladesh asad1752@ieee.org Farhana Afroz Department
More informationMultiProtocol Label Switching - MPLS ( RFC 3031 )
Outline MultiProtocol Label Switching - MPLS ( RFC 3031 ) 1. What is MPLS and how does it work? 2. What MPLS is used for? 3. Label Distribution Protocols 1 1. What is MPLS and how does it work? MPLS is
More informationEngineering the Multi-Service Internet: MPLS and IP-based Techniques
Engineering the Multi-Service Internet: MPLS and IP-based Techniques P. Trimintzios, L. Georgiadis, G. Pavlou, D. Griffin, C.F. Cavalcanti, P. Georgatsos C.C.S.R./University of Surrey, UK Aristotle University
More information