scholarly journals Class-Based Constraint-Based Routing with Implemented Fuzzy Logic in MPLS-TE Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Michal Pištek ◽  
Martin Medvecký
Keyword(s):  
Fuzzy Logic ◽  
Traffic Engineering ◽  
Service Providers ◽  
Shortest Paths ◽  
Multimedia Networks ◽  
Multiprotocol Label Switching ◽  
Core Networks ◽  
Lower Priority ◽  
Qos Parameters ◽  
Explicit Routing

The paper deals with constraint-based routing (CBR) in MPLS-TE networks and proposes a new CBR algorithm based on fuzzy logic called Fuzzy Class-Based Algorithm (FCBA). Multiprotocol label switching with traffic engineering (MPLS-TE) networks represent a popular mechanism to effectively use resources of service providers’ core networks. The paths can be either built by administrators (explicit routing) or built by using existing routing algorithms which mostly decide based on the shortest paths towards the destination which might not be sufficient in nowadays’ multimedia networks. To address this problem various CBR algorithms have emerged which take into consideration various aspects important to existing traffic like QoS parameters or administrative policies. FCBA makes routing decisions based on traffic classes and by using fuzzy logic we can assign normalized values to various constraints based on the traffic class’ preferences (e.g., low delay paths for voice traffic) and network administrator’s preferences (e.g., avoiding congested links). The paper provides comparison of FCBA with existing CBR approaches based on their ability to provide QoS parameters loss. The simulations show that FCBA provides the best results for the highest priority traffic where it uses lower priority traffic to efficiently utilize the network.

scholarly journals A Generic Model for Identifying QoS Parameters Interrelations in Cloud Services Selection Ontology during Runtime

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 563
Author(s):  
Babu Rajendiran ◽  
Jayashree Kanniappan
Keyword(s):  
Service Providers ◽  
Cloud Service ◽  
Cloud Services ◽  
Operating Costs ◽  
Generic Model ◽  
Business Organizations ◽  
Cloud Environment ◽  
Cloud Service Provider ◽  
Qos Parameters ◽  
Computer Based

Nowadays, many business organizations are operating on the cloud environment in order to diminish their operating costs and to select the best service from many cloud providers. The increasing number of Cloud Services available on the market encourages the cloud consumer to be conscious in selecting the most apt Cloud Service Provider that satisfies functionality, as well as QoS parameters. Many disciplines of computer-based applications use standardized ontology to represent information in their fields that indicate the necessity of an ontology-based representation. The proposed generic model can help service consumers to identify QoS parameters interrelations in the cloud services selection ontology during run-time, and for service providers to enhance their business by interpreting the various relations. The ontology has been developed using the intended attributes of QoS from various service providers. A generic model has been developed and it is tested with the developed ontology.

scholarly journals Traffic model for the interconnection of networks and operators using MPLS-TE

2017 ◽  
Vol 26 (44) ◽  
pp. 85 ◽  
Author(s):  
Carlos Mario Restrepo ◽  
Octavio José Salcedo-Parra ◽  
Juan Manuel Sánchez-Céspedes
Keyword(s):  
Traffic Engineering ◽  
Service Providers ◽  
Global Model ◽  
Traffic Model ◽  
Telecommunication Service ◽  
Model Output ◽  
New Model ◽  
Traffic Models ◽  
Wolfram Mathematica ◽  
Study Case

In this paper, the main features of MPLS Traffic Engineering are presented to illustrate how telecommunication service providers use them to create interconnections between each other in order to offer telecom services satisfying QoS commitments. Based on previous traffic models, a new model, which deals with traffic queue balancing for different Classes of Service, and for a provider using another provider´s network is presented. The model output shows that carrying another operator’s traffic may increase delays in an undesirable manner, forcing the carrier to increase the serving rate of LSRs until Utilization is below 60 %. In order to validate the model, a number of network scenarios are implemented in the Wolfram Mathematica 10.1 Study Version, based on study case configurations of an MPLS network. The total global model is useful for future implementation of test-beds of interconnected providers under an MPLS environment.

scholarly journals ElasticWISP: Energy-Proportional WISP Backhaul Networks

2021 ◽  
Author(s):  
◽  
Duncan Cameron
Keyword(s):  
Energy Consumption ◽  
Traffic Engineering ◽  
Service Providers ◽  
Renewable Energy Sources ◽  
Small Scale ◽  
Flow State ◽  
Wireless Internet ◽  
Internet Service ◽  
Wireless Backhaul ◽  
Backhaul Networks

<p>The provision of rural broadband infrastructure is a challenge for network operators across the globe, irrespective of their size. Wireless Internet Service Providers (WISPs) have shown that the small-scale deployment of wireless broadband infrastructure is a viable alternative to relying on cellular network providers for remote coverage. However, WISPs must often resort to using off-grid renewable energy sources such as solar energy for powering network sites, often resulting in undesirable, low-performance backhaul radios being used between sites out of concern for excessive energy consumption.  The challenges of managing performant wireless backhaul networks in respect to energy constraints at remote, off-grid sites informs the need for energy-proportional design. Backhaul radios typically used by WISPs are not energy-proportional, meaning they use a consistent amount of energy, irrespective of wireless link utilisation. Using data from a real WISP network, diurnal traffic patterns show that WISP networks could benefit from energy-proportional design, without having to sacrifice performance.  To encourage the development of high-performance, energy-proportional WISP backhaul networks, ElasticWISP, an optimisation architecture that reduces network-wide backhaul energy consumption while satisfying the user-demand for traffic, is introduced. ElasticWISP dynamically controls the configuration of backhaul radios based on bandwidth demands and the network-wide energy consumption of these radios. Through simulations driven by real WISP topology and data traffic, results show that ElasticWISP can offer energy savings of approximately 65% when WISP operators follow the proposed backhaul design methodology.  Finally, a lightweight Multiprotocol Label Switching (MPLS)-based traffic engineering scheme, based on Segment Routing, is proposed. The implementation, named Segment Routing over MPLS (SR-MPLS), keeps traffic engineering path-state within each packet, meaning per-flow state is only held at SR-MPLS ingress routers. The lightweight approach of SR-MPLS also eliminates the otherwise necessary network-wide label flooding of traditional Segment Routing, making it ideal for bandwidth-sensitive wireless backhaul networks. Evaluation of SR-MPLS shows that it can perform as well as – and sometimes better than – competitor schemes.</p>

Grid Workflows with Encompassed Business Relationships

2012 ◽  
pp. 1332-1348
Author(s):  
Dimosthenis Kyriazis ◽  
Andreas Menychtas ◽  
Theodora Varvarigou
Keyword(s):  
Quality Of Service ◽  
Service Providers ◽  
Added Value ◽  
Business Relationships ◽  
Qos Provisioning ◽  
Grid Services ◽  
Qos Parameters ◽  
Mapping Process ◽  
Selection Of

This chapter focuses on presenting and describing an approach that allows the mapping of workflow processes to Grid provided services by not only taking into account the quality of service (QoS) parameters of the Grid services but also the potential business relationships of the service providers that may affect the aforementioned QoS parameters. This approach is an integral part of the QoS provisioning, since this is the only way to estimate, calculate, and conclude to the mapping of workflows and the selection of the available service types and instances in order to deliver an overall quality of service across a federation of providers. The added value of this approach lays on the fact that business relationships of the service providers are also taken into account during the mapping process.

Grid Workflows with Encompassed Business Relationship

2011 ◽  
pp. 128-145 ◽  
Author(s):  
Dimosthenis Kyriazis ◽  
Andreas Menychtas ◽  
Theodora Varvarigou
Keyword(s):  
Quality Of Service ◽  
Service Providers ◽  
Added Value ◽  
Business Relationships ◽  
Qos Provisioning ◽  
Grid Services ◽  
Qos Parameters ◽  
Mapping Process ◽  
Selection Of

This chapter focuses on presenting and describing an approach that allows the mapping of workflow processes to Grid provided services by not only taking into account the quality of service (QoS) parameters of the Grid services but also the potential business relationships of the service providers that may affect the aforementioned QoS parameters. This approach is an integral part of the QoS provisioning, since this is the only way to estimate, calculate, and conclude to the mapping of workflows and the selection of the available service types and instances in order to deliver an overall quality of service across a federation of providers. The added value of this approach lays on the fact that business relationships of the service providers are also taken into account during the mapping process.

RSVP-TE Bilateral-Recursive Region Re-Routing Crankback Mechanism for Large-Scale Optical Networks

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Panke Qin ◽  
Jiawei Wang ◽  
Jingru Wu
Keyword(s):  
Real Time ◽  
Optical Networks ◽  
Traffic Engineering ◽  
Large Scale ◽  
Setup Time ◽  
Multiprotocol Label Switching ◽  
Transmission Scheme ◽  
Internet Applications ◽  
Time Dynamic ◽  
Reservation Protocol

AbstractCloud computing services and real-time Internet applications have spawned a large variety of potential requirements for quality of service (QoS), especially the latency and connection setup time. However, with the optical networks develop toward to larger scale, wider coverage and more users access, conventional resource reservation protocol traffic engineering (RSVP-TE) signal hop by hop transmission scheme cannot meet the requirements of these new applications for real-time dynamic services and fast restoration with long propagation delays. This paper proposes a novel RSVP-TE bilateral-recursive region re-routing crankback mechanism (BRCB) base on distributed path computation element (PCE) for generalized multiprotocol label switching (GMPLS) optical networks. In this mechanism, the backtracking nodes re-route and update the region routing paths which bypass the crankback and re-routing failure nodes when crankback occurs. It not only reduces the influencing factors of the scale of network, signaling crankback position and frequency to path connection setup time, but also avoids the backtracking of teardown messages.

Expectation Value Calculation of Grid QoS Parameters Based on Algorithm Prim

2010 ◽  
Vol 34-35 ◽  
pp. 2016-2020
Author(s):  
Kai Jian Liang ◽  
Lin Feng Bai ◽  
Xi Long Qu
Keyword(s):  
Service Providers ◽  
Computation Method ◽  
Expectation Values ◽  
Expectation Value ◽  
Qos Parameters ◽  
System Resources ◽  
Selection Of

From the perspective of selecting service by QoS attributes, a computation method of QoS expectation value, which is based on Algorithm Prim, was presented to provide support for selection of service. On the basis of the ability of service providers, by Algorithm Prim, this method succeded in calculating a set of balanced expectation values of QoS. Selection of service based on these QoS values would be beneficial to optimization of system resources and protection of the users of those services. An example with analysis has been provided to demonstrate the feasibility and effectiveness of the method.

An Efficient K-Shortest Paths Based Routing Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li
Keyword(s):  
Computer Networks ◽  
Shortest Path ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Link State

We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.

scholarly journals Comparison of Evolutionary Algorithm and Heuristics for Flow Optimization in P2P Systems

2010 ◽  
Vol 56 (2) ◽  
pp. 145-152 ◽  
Author(s):  
Michal Kucharzak ◽  
Adam Siwek ◽  
Krzysztof Walkowiak
Keyword(s):  
Evolutionary Algorithm ◽  
Traffic Engineering ◽  
Service Providers ◽  
Random Search ◽  
File Sharing ◽  
Superior Performance ◽  
Web Traffic ◽  
Flow Optimization ◽  
Internet Service ◽  
P2p Systems

Comparison of Evolutionary Algorithm and Heuristics for Flow Optimization in P2P SystemsNowadays, many Internet users make use of Peer-to-Peer (P2P) systems to download electronic content including music, movies, software, etc. Growing popularity in P2P based protocol implementations for file sharing purposes caused that the P2P traffic exceeds Web traffic and in accordance with to many statistics, P2P systems produce a more than 50% of the whole Internet traffic. Therefore, P2P systems provide remarkable income for Internet Service Providers (ISP). However, at the same time P2P systems generates many problems related to traffic engineering, optimization, network congestion. In this paper we focus on the problem of flow optimization in P2P file sharing systems. Corresponding to BitTorrent-based systems behaviour, the optimization of P2P flows is very complex and in this work we consider different heuristic strategies for content distribution and moreover we propose a new evolutionary algorithm (EA) for this problem. We compare results of the algorithms against optimal results yielded by CPLEX solver for networks including 10 peers and relation to random algorithm for 100-node systems. According to numerical experiments, the EA provides solutions close to optimal for small instances and all of the heuristics exhibit a superior performance over random search.

Sign in / Sign up

Export Citation Format

Share Document