SRLB: The Power of Choices in Load Balancing with Segment Routing

Desmouceaux, Yoann; Pfister, Pierre; Tollet, Jerome; Townsley, Mark; Clausen, Thomas

doi:10.1109/icdcs.2017.180

Cited by 12 publications

(21 citation statements)

References 11 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ref. [27] exploits the network programming feature of SR to implement a load balancer able to distribute the computation load over a set of servers, by defining a new SR function (named service hunting) to be performed at the gateway. SRV6Pipes [28] is an extension of the IPv6 implementation of Segment Routing in the Linux kernel [29] that enables chaining and operation of in-network functions operating on streams, such as transparent proxies, transparent compression or encryption, transcoding, etc (all the functions that cannot be performed on per-packet based).…”

Section: Related Workmentioning

confidence: 99%

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

et al. 2019

View full text Add to dashboard Cite

Network Function Virtualization is a new technology allowing for a elastic cloud and bandwidth resource allocation. The technology requires an orchestrator whose role is the service and resource orchestration. It receives service requests, each one characterized by a Service Function Chain, which is a set of service functions to be executed according to a given order. It implements an algorithm for deciding where both to allocate the cloud and bandwidth resources and to route the SFCs. In a traditional orchestration algorithm, the orchestrator has a detailed knowledge of the cloud and network infrastructures and that can lead to high computational complexity of the SFC Routing and Cloud and Bandwidth resource Allocation (SRCBA) algorithm. In this paper, we propose and evaluate the effectiveness of a scalable orchestration architecture inherited by the one proposed within the European Telecommunications Standards Institute (ETSI) and based on the functional separation of an NFV orchestrator in Resource Orchestrator (RO) and Network Service Orchestrator (NSO). Each cloud domain is equipped with an RO whose task is to provide a simple and abstract representation of the cloud infrastructure. These representations are notified of the NSO that can apply a simplified and less complex SRCBA algorithm. In addition, we show how the segment routing technology can help to simplify the SFC routing by means of an effective addressing of the service functions. The scalable orchestration solution has been investigated and compared to the one of a traditional orchestrator in some network scenarios and varying the number of cloud domains. We have verified that the execution time of the SRCBA algorithm can be drastically reduced without degrading the performance in terms of cloud and bandwidth resource costs.

show abstract

Section: Related Workmentioning

confidence: 99%

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

et al. 2019

View full text Add to dashboard Cite

show abstract

“…While the algorithms developed in this paper are generally applicable for any number of candidate application instances, the concept of power of two choices [5] applies: selecting two candidate application instances ensures a low network footprint while providing a significant load-balancing improvement -with diminishing returns beyond that. Building on the work of [6], the novel contributions of this paper are fivefold: (i) a consistent hashing algorithm, (ii) an in-band stickiness protocol (the union of which allows to scale the number of load-balancer instances for reliability and performance), (iii) an analytic model analyzing the performance of SRbased load-balancing, (iv) experiments with the combined 6LB load-balancing architecture conducted on a larger testbed, and finally (v) kernel-bypass implementations of 6LB and a state-of-the-art load-balancer (Maglev [2]) with performance comparison of the two implementations.…”

Section: A Statement Of Purposementioning

confidence: 99%

“…SC exhibits a very dispersed distribution of response times, whereas the different SR c policies yield lower, and less dispersed, response times. This can be explained by inspecting the evolution of the mean instantaneous load (the number of busy worker threads) over all servers, as well as the corresponding fairness index: 2 (where x i (t) is the load of server i at time t), depicted in figure 10b 6 . As SR 4 better spreads queries between all servers (the fairness 6 These values have been smoothed through an Exponential Window Moving Average filter, of parameter α = 1 − exp(−δt) where δt is the interval of time in seconds between two successive data points.…”

Section: B Poisson Traffic 1) Traffic and Workload Patternsmentioning

confidence: 99%

6LB: Scalable and Application-Aware Load Balancing with Segment Routing

Desmouceaux

Pfister

Tollet

et al. 2018

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Network load-balancers generally either do not take application state into account, or do so at the cost of a centralized monitoring system. This paper introduces a load-balancer running exclusively within the IP forwarding plane, i.e. in an application protocol agnostic fashion-yet which still provides application-awareness and makes real-time, decentralized decisions. To that end, IPv6 Segment Routing is used to direct data packets from a new flow through a chain of candidate servers, until one decides to accept the connection, based solely on its local state. This way, applications themselves naturally decide on how to fairly share incoming connections, while incurring minimal network overhead, and no out-of-band signaling. A consistent hashing algorithm, as well as an in-band stickiness protocol, allow for the proposed solution to be able to be reliably distributed across a large number of instances. Performance evaluation by means of an analytical model and actual tests on different workloads (including a Wikipedia replay as a realistic workload) show significant performance benefits in terms of shorter response times, when compared to a traditional random load-balancer. In addition, this paper introduces and compares kernel bypass high-performance implementations of both 6LB and a state-of-the-art load-balancer, showing that the significant system-level benefits of 6LB are achievable with a negligible data-path CPU overhead.

show abstract

“…Realistic services and applications demand a tremendous amount of resources in the next generation of wireless communication [1]. The advent of higher spectrum allows better resources for the users and also supports the applications that lay an enormous burden on the network [2,3].…”

Section: Introductionmentioning

confidence: 99%

Osmotic computing-based service migration and resource scheduling in Mobile Augmented Reality Networks (MARN)

Sharma

Jayakody

Qaraqe

2020

Future Generation Computer Systems

View full text Add to dashboard Cite

Resources and services between the servers in Mobile Augmented Reality Networks (MARN) are tedious to manage. These networks comprise users possessing Augmented Reality (AR)-Virtual Reality (VR) applications. Low latency, robustness, and tolerance are the key requirements of these networks, which can be attained by using near-user solutions such as edge computing. However, management of services and scheduling them to near-user servers in an integrated environment of edge and public/private infrastructure are complex tasks. These require an optimal solution, which can be obtained by using ''Osmotic Computing'', that has been recently proposed as a paradigm for the integration of edge and public/private cloud. This paper uses osmotic computing for effectively migrating and scheduling the services between the servers of the different layers. The paper also presents the details on various components that are used for applying osmotic computing to a network followed by core applications, types, service classification, migration, and scheduling through the rules of osmotic game formulated for its operations. The evaluations are conducted on 100,000 requests and the proposed approach shows significant performance with the probability of the error being 0.1 at 55.72% conservation of the energy and memory resources for the entire network despite the increasing number of users. The proposed approach also satisfies the conditions of the joint optimization functions presented in the system model and demonstrates that the system holds true even with varying users, thus, proving its robustness and tolerance against the number of users.

show abstract

SRLB: The Power of Choices in Load Balancing with Segment Routing

Cited by 12 publications

References 11 publications

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

6LB: Scalable and Application-Aware Load Balancing with Segment Routing

Osmotic computing-based service migration and resource scheduling in Mobile Augmented Reality Networks (MARN)

Contact Info

Product

Resources

About