3,051 research outputs found
Dynamic Scaling of Virtualized, Distributed Service Chains: A Case Study of IMS
Special issue on Emerging Technologies in Software-driven Communicationpostprin
Recommended from our members
Application Layer Feedback-based SIP Server Overload Control
A SIP server may be overloaded by emergency-induced call volume, "American Idol" style flash crowd effects or denial of service attacks. The SIP server overload problem is interesting especially because the costs of serving or rejecting a SIP session can be similar. For this reason, the built-in SIP overload control mechanism based on generating rejection messages cannot prevent the server from entering congestion collapse under heavy load. The SIP overload problem calls for a pushback control solution in which the potentially overloaded receiving server may notify its upstream sending servers to have them send only the amount of load within the receiving server's processing capacity. The pushback framework can be achieved by either a rate-based feedback or a window-based feedback. The centerpiece of the feedback mechanism is the algorithm used to generate load regulation information. We propose three new window-based feedback algorithms and evaluate them together with two existing rate-based feedback algorithms. We compare the different algorithms in terms of the number of tuning parameters and performance under both steady and variable load. Furthermore, we identify two categories of fairness requirements for SIP overload control, namely, user-centric and provider-centric fairness. With the introduction of a new double-feed SIP overload control architecture, we show how the algorithms meet those fairness criteria
A Framework for Controlling Quality of Sessions in Multimedia Systems
Collaborative multimedia systems demand overall session quality control beyond the level of quality of service (QoS) pertaining to individual connections in isolation of others. At every instant in time, the quality of the session depends on the actual QoS offered by the system to each of the application streams, as well as on the relative priorities of these streams according to the application semantics. We introduce a framework for achieving QoSess control and address the architectural issues involved in designing a QoSess control laver that realizes the proposed framework. In addition, we detail our contributions for two main components of the QoSess control layer. The first component is a scalable and robust feedback protocol, which allows for determining the worst case state among a group of receivers of a stream. This mechanism is used for controlling the transmission rates of multimedia sources in both cases of layered and single-rate multicast streams. The second component is a set of inter-stream adaptation algorithms that dynamically control the bandwidth shares of the streams belonging to a session. Additionally, in order to ensure stability and responsiveness in the inter-stream adaptation process, several measures are taken, including devising a domain rate control protocol. The performance of the proposed mechanisms is analyzed and their advantages are demonstrated by simulation and experimental results
Distributed Random Access Algorithm: Scheduling and Congesion Control
This paper provides proofs of the rate stability, Harris recurrence, and
epsilon-optimality of CSMA algorithms where the backoff parameter of each node
is based on its backlog. These algorithms require only local information and
are easy to implement.
The setup is a network of wireless nodes with a fixed conflict graph that
identifies pairs of nodes whose simultaneous transmissions conflict. The paper
studies two algorithms. The first algorithm schedules transmissions to keep up
with given arrival rates of packets. The second algorithm controls the arrivals
in addition to the scheduling and attempts to maximize the sum of the utilities
of the flows of packets at the different nodes. For the first algorithm, the
paper proves rate stability for strictly feasible arrival rates and also Harris
recurrence of the queues. For the second algorithm, the paper proves the
epsilon-optimality. Both algorithms operate with strictly local information in
the case of decreasing step sizes, and operate with the additional information
of the number of nodes in the network in the case of constant step size
In the Direction of Service Guarantees for Virtualized Network Functions
The trend of consolidating network functions from specialized hardware to software running on virtualization servers brings significant advantages for reducing costs and simplifying service deployment. However, virtualization techniques have significant limitations when it comes to networking as there is no support for guaranteeing that network functions meet their service requirements. In this paper, we present a design for providing service guarantees to virtualized network functions based on rate control. The design is a combination of rate regulation through token bucket filters and the regular scheduling mechanisms in operating systems. It has the attractive property that traffic profiles are maintained throughout a series of network functions, which makes it well suited for service function chaining. We discuss implementation alternatives for the design and demonstrate how it can be implemented on two virtualization platforms: LXC containers and the KVM hypervisor. To evaluate the design, we conduct experiments where we measure throughput and latency using IP forwarders (routers) as examples of virtual network functions. Two significant factors for performance are investigated: the design of token buckets and the packet clustering effect that comes from scheduling. Finally, we demonstrate how performance guarantees are achieved for rate-controlled virtual routers under different scenarios.publishedVersio
- …