Results 1 - 10
of
39
Measurement-Based Admission Control with Aggregate Traffic Envelopes
, 2001
"... The goal of admission control is to support the quality-of-service demands of real-time applications via resource reservation. In this paper, we introduce a new approach to measurement-based admission control for multiclass networks with link sharing. We employ adaptive and measurement-based maximal ..."
Abstract
-
Cited by 88 (2 self)
- Add to MetaCart
The goal of admission control is to support the quality-of-service demands of real-time applications via resource reservation. In this paper, we introduce a new approach to measurement-based admission control for multiclass networks with link sharing. We employ adaptive and measurement-based maximal rate envelopes of the aggregate traffic flow to provide a general and accurate traffic characterization that captures its temporal correlation as well as the available statistical multiplexing gain. In estimating applications' future performance, we introduce the notion of a schedulability confidence level which describes the uncertainty of the measurement-based "prediction" and reflects temporal variations in the measured envelope. We then devise techniques to control loss probability for a buffered multiplexer servicing heterogeneous and bursty traffic flows, even in the regime of a moderate number of traffic flows, which is important in link-sharing environments. Finally, we have developed an implementation of the scheme on a prototype router and performed a testbed measurement study, which together with extensive trace-driven simulations illustrates the effectiveness of the approach in practical scenarios.
Egress Admission Control
- IN PROCEEDINGS OF IEEE INFOCOM 2000, TEL AVIV
, 2000
"... Provisioning multiple service classes with different performance characteristics (e.g., throughput and delay) is an important challenge for future packet networks. However, in large-scale networks, individually managing each traffic flow on each of its traversed routers has fundamental scalability ..."
Abstract
-
Cited by 56 (1 self)
- Add to MetaCart
Provisioning multiple service classes with different performance characteristics (e.g., throughput and delay) is an important challenge for future packet networks. However, in large-scale networks, individually managing each traffic flow on each of its traversed routers has fundamental scalability limitations, in both the control plane's requirements for signaling, state management, and admission control, and the data plane's requirements for per-flow scheduling mechanisms. In this paper, we develop a scalable technique for quality-of-service management termed egress admission control. In our approach, resource management and admission control are performed only at egress routers, without any coordination among backbone nodes or per-flow management. Our key technique is to develop a framework for admission control under a general "black box" model, which allows for cross traffic that cannot be directly measured, and scheduling policies that may be ill-described across many network nod...
Distributed Call Admission Control for Ad Hoc Networks
, 2002
"... This paper introduces a distributed call admission controller for ad hod networks. The call admission controller is based on service curve provisioning. Service curve reflects the status of network and depends on the number of active nodes, their activity index, and the back-off procedure used for c ..."
Abstract
-
Cited by 22 (5 self)
- Add to MetaCart
This paper introduces a distributed call admission controller for ad hod networks. The call admission controller is based on service curve provisioning. Service curve reflects the status of network and depends on the number of active nodes, their activity index, and the back-off procedure used for contention resolution. The service curve along with the aggregated traffic function can be used to calculate maximum delay and maximum backlog. We assume that the call requests are granted if the service curve is bounded below by some non-decreasing deterministic function which is called the universal service curve. The universal service curve is independent of the number of nodes and traffic fluctuation and acts as a worst-case reference curve. All users willing to establish a new connection should compare the performance of network to the universal service curve. A call request is accepted if the true service curve stays above the universal service curve.
Measuring Service in Multi-Class Networks
, 2001
"... Quality of Service mechanisms and differentiated service classes are increasingly available in networks and servers. While network clients can assess their service by measuring basic performance parameters such as packet loss and delay, such measurements do not expose the network 's core QoS fu ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
Quality of Service mechanisms and differentiated service classes are increasingly available in networks and servers. While network clients can assess their service by measuring basic performance parameters such as packet loss and delay, such measurements do not expose the network 's core QoS functionality. In this paper, we develop a framework and methodology for enabling network clients to assess a system's multi-class mechanisms and parameters. Using hypothesis testing, maximum likelihood estimation, and empirical arrival and service rates measured across multiple time scales, we devise techniques for clients to (1) determine the most likely service discipline among EDF, WFQ, and SP, (2) estimate the server's parameters with high confidence, and (3) detect and parameterize non-work-conserving elements such as rate limiters. We describe the important role of time scales in such a framework and identify the conditions necessary for obtaining accurate and high confidence inferences.
Optimum Resource Allocation in Multipath Ad Hoc Networks
, 2003
"... Optimum Resource Allocation in Multipath Ad Hoc Networks Petar Djukic Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2003 We devise a mechanism for reliable packet transmission in Wireless Ad Hoc Networks. The implementation is based ..."
Abstract
-
Cited by 11 (6 self)
- Add to MetaCart
Optimum Resource Allocation in Multipath Ad Hoc Networks Petar Djukic Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2003 We devise a mechanism for reliable packet transmission in Wireless Ad Hoc Networks. The implementation is based on Path Diversification, which uses multipath diversity in the network and erasure codes to provide guaranteed reliability. We show that when no information is available about the status of the network, distributing the load over all the available paths can increase network reliability significantly over single path transmissions.
Self-adaptive Distributed Management of QoS and SLSs in Multiservice Networks
- In IEEE/IFIP International Conference on Integrated Management (IM 2005
, 2005
"... Distributed service-oriented traffic control mechanisms, operating with minimum impact on network performance, assume a crucial role as regards controlling services quality and network resources transparent and efficiently. In this way, we describe and specify a lightweight distributed admission con ..."
Abstract
-
Cited by 10 (6 self)
- Add to MetaCart
(Show Context)
Distributed service-oriented traffic control mechanisms, operating with minimum impact on network performance, assume a crucial role as regards controlling services quality and network resources transparent and efficiently. In this way, we describe and specify a lightweight distributed admission control (AC) model which provides an uniform solution for managing QoS and SLSs in multiclass and multidomain environments. Taking advantage of the consensual need of on-line service monitoring and traffic control at the network edges, AC decisions are driven by feedback from systematic edge-to-edge measurements of relevant QoS parameters for each service type and SLS utilization. This allows self-adaptive service and resource management, while abstracting from network core complexity and heterogeneity. In this paper, introducing an expressive notation, we specify the high-level entities for multiservice provisioning in a domain and formalize service-dependent AC equations to assure both intra and interdomain model operation. A proof-of-concept of the AC criteria effectiveness in satisfying each service class commitments while achieving high network utilization is provided through simulation.
Admission Control in Multiservice IP Networks: Architectural Issues and Trends
- IEEE COMPUTER COMMUNICATIONS MAGAZINE
, 2007
"... The trend toward the integration of current and emerging applications and services in the Internet has launched new challenges regarding service deployment and management. Within service management, admission control (AC) has been recognized as a convenient mechanism to keep services under controll ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
The trend toward the integration of current and emerging applications and services in the Internet has launched new challenges regarding service deployment and management. Within service management, admission control (AC) has been recognized as a convenient mechanism to keep services under controlled load and assure the required QoS levels, bringing consistency to the services offered. In this context, this article discusses the role of AC in multiservice IP networks and surveys current and representative AC approaches. We address and compare the architectural principles of these AC approaches and their main features, virtues and limitations that impact on the quality control of network services. We identify important design aspects that contribute to the successful deployment of flexible and scalable AC solutions in multiservice networks.
Distributed Admission Control for QoS and SLS Management
- Journal of Network and Systems Management - Special Issue on Distributed Management
, 2004
"... This article proposes a distributed admission control (AC) model based on on-line monitoring to manage the quality of Internet multimedia services and Service Level Specifications (SLSs). The AC strategy covers intra and inter-domain operation, controls quality-of-service (QoS) without adding sign ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
(Show Context)
This article proposes a distributed admission control (AC) model based on on-line monitoring to manage the quality of Internet multimedia services and Service Level Specifications (SLSs). The AC strategy covers intra and inter-domain operation, controls quality-of-service (QoS) without adding significant complexity to the network control plane and involves 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 approach is viewed as a cumulative and repetitive process of AC and available service computation. We evaluate the AC criterion as regards its ability to ensure service commitments while achieving high network utilization. The results show that the proposed model provides a good compromise between simplicity, service guarantee levels and network usage, even for services with strict QoS requirements
A Distributed Admission Control Model for CoS Networks Using QoS and SLS Monitoring
- In IEEE International Conference on Communications - ICC’03
, 2003
"... 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 ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
(Show Context)
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 edge-to-edge online 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 Min-Plus System Interpretation of Bandwidth Estimation
"... Significant research has been dedicated to methods that estimate the available bandwidth in a network from traffic measurements. While estimation methods abound, less progress has been made on achieving a foundational understanding of the bandwidth estimation problem. In this paper, we develop a min ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
Significant research has been dedicated to methods that estimate the available bandwidth in a network from traffic measurements. While estimation methods abound, less progress has been made on achieving a foundational understanding of the bandwidth estimation problem. In this paper, we develop a min-plus system theoretic formulation of bandwidth estimation. We show that the problem as well as previously proposed solutions can be concisely described and derived using min-plus system theory, thus establishing the existence of a strong link between network calculus and network probing methods. We relate difficulties in network probing to potential non-linearities of the underlying systems, and provide a justification for the distinctive treatment of FIFO scheduling in network probing.
