Distributed admission control for QoS and SLS management

This article proposes a distributed admission control (AC) model based on on-line monitoring to manage the quality of Internet services and Service Level Specifications (SLSs) in class-based networks. The AC strategy covers intra- and interdomain operation, without adding significant complexity to the network control plane and involving only edge nodes. While ingress nodes perform implicit or explicit AC resorting to service-oriented rules for SLS and QoS parameters control, egress nodes collect service metrics providing them as inputs for AC. The end-to-end operation is viewed as a cumulative and repetitive process of AC and available service computation.We discuss crucial key points of the model implementation and evaluate its two main components: themonitoring process and the AC criteria. The results show that, using proper AC rules and safety margins, service commitments can be efficiently satisfied, and the simplicity and flexibility of the model can be explored to manage successfully QoS requirements of multiple Internet services.(undefined

Distributed admission control in multiservice IP networks : concurrency issues

In distributed admission control (AC) schemes, handling concurrent AC decisions assumes a relevant role in avoiding over or false acceptance and, consequently, service quality degradation. This problematic is even more intricate in multiservice network environments where distinct service levels need to be fulfilled. This paper debates and points out solutions to mitigate the negative impact that distributed admission of flows might have on the service level guarantees provided to network customers. Keeping in mind that simplicity is a key factor for deployable AC solutions, we suggest and discuss the use of (i) a service-dependent concurrency index; (ii) a token-based system and (iii) a rate-based credit system, as alternative or complementary proposals to minimize or solve QoS degradation resulting from AC false acceptance.(undefined

Stabilization of an overloaded queueing network using measurement-based admission control

Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state. This paper studies how the lack of complete state information affects the system performance by considering a simple network model for distributed admission control. The stability region of the network is characterized and it is shown how feedback signaling makes the system very sensitive to its parameters.Comment: Published at http://dx.doi.org/10.1239/jap/1143936256 in the Journal of Applied Probability (http://projecteuclid.org/jap) by the Applied Probability Trust (http://www.appliedprobability.org/

A distributed admission control model for CoS networks using QoS and SLS monitoring

Achieving an admission control strategy for CoS networks covering both intra-domain and end-to-end operation is still an open issue. This paper discusses how AC can be carried out without adding significant complexity to the network control plane and proposes a distributed service-oriented AC model for these networks. The model only involves the network edge nodes leaving the network core unchanged. Ingress nodes perform implicit or explicit service-dependent AC based on both QoS and SLSs utilization metrics, obtained through on-line edge-to-edge monitoring performed at egress nodes. From an end-to-end perspective, the flow request is used both for AC and available service computation. Relevant aspects of the model interrelated areas and implementation key points are also discussed

A distributed admission control model for class-based networks using edge-toedge QoS and SLS monitoring

The advent of class-based networks has brought new needs for network traffic control in order to assure a certain QoS level. Despite the existing proposals, achieving a generic admission control (AC) strategy for traffic entering these networks is still an open issue. This paper provides new insights on how AC shall be accomplished proposing an encompassing AC model for multi-service class-based networks, which covers both intra-domain and end-to-end operation, without requiring changes in the network core and complex AC signaling. For each service type, AC is distributed and based on both on-line edge-to-edge monitoring of relevant QoS parameters and SLSs utilization. Service monitoring, performed at egress nodes, provides adequate metrics to ingress nodes which take implicit or explicit AC decisions based on service-dependent criteria. Although being oriented to flow AC, the model can easily be applied to SLS AC. SLS auditing and SLS traffic conditioning are tasks also covered

Performance of distributed mechanisms for flow admission in wireless adhoc networks

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We are especially interested in algorithms which have low communication overhead and low processing complexity. The interference in the network is modeled using a conflict graph whose vertices correspond to the communication links in the network. Two links are adjacent in this graph if and only if they interfere with each other due to being in the same vicinity and hence cannot be simultaneously active. The problem of scheduling the transmission of the various links is then essentially a fractional, weighted vertex coloring problem, for which upper bounds on the fractional chromatic number are sought using only localized information. We recall some distributed algorithms for this problem, and then assess their worst-case performance. Our results on this fundamental problem imply that for some well known classes of networks and interference models, the performance of these distributed algorithms is within a bounded factor away from that of an optimal, centralized algorithm. The performance bounds are simple expressions in terms of graph invariants. It is seen that the induced star number of a network plays an important role in the design and performance of such networks.Comment: 21 pages, submitted. Journal version of arXiv:0906.378

Differentiated QoS for overlay-based disaster response systems

Disaster response systems (DRSs) assist responders by providing a wide range of services. These services are usually implemented as distributed applications (overlays) capable of operating in an infrastructure-less underlying network such as MANETs. However, all the services in DRSs may not be equally critical. For instance, the communication between firefighters is certainly more important than the communication between news reporters. Ensuring the reliability and the quality of the required vital services is a key to successful disaster response operations. We propose a differentiated QoS architecture for overlay-based DRSs to enforce a prioritization scheme between overlays as well as between users within overlays. Our architecture provides self-organizing distributed admission control and policy enforcement services. We have run extensive simulations to evaluate the performance of our architecture. The results show that our architecture not only enables differentiated QoS, it also improves overall QoS in terms of the number of successful overlay flows. © 2014 IEEE