Browsing by Subject "QoS"

Now showing 1 - 11 of 11

Adaptive control of real-time media applications in best-effort networks
(Texas A&M University, 2004-11-15) Khariwal, Vivek
Quality of Service (QoS) in real-time media applications can be defined as the ability to guarantee the delivery of packets from source to destination over best-effort networks within some constraints. These constraints defined as the QoS metrics are end-to-end packet delay, delay jitter, throughtput, and packet losses. Transporting real-time media applications over best-effort networks, e.g. the Internet, is an area of current research. Both the Transmission Control Protocol (TCP) and the User Datagram Protocol (UDP) have failed to provide the desired QoS. This research aims at developing application-level end-to-end QoS controls to improve the user-perceived quality of real-time media applications over best-effort networks, such as, the public Internet. In this research an end-to-end packet based approach is developed. The end-to- end packet based approach consists of source buffer, network simulator ns-2, destina- tion buffer, and controller. Unconstrained model predictive control (MPC) methods are implemented by the controller at the application layer. The end-to-end packet based approach uses end-to-end network measurements and predictions as feedback signals. Effectiveness of the developed control methods are examined using Matlab and ns-2. The results demonstrate that sender-based control schemes utilizing UDP at transport layer are effective in providing QoS for real-time media applications transported over best-effort networks. Significant improvements in providing QoS are visible by the reduction of packet losses and the elimination of disruptions during the playback of real-time media. This is accompanied by either a decrease or increase in the playback start-time.
Core-characteristic-aware off-chip memory management in a multicore system-on-chip
(2012-12) Jeong, Min Kyu; Erez, Mattan; John, Lizy K.; Chiou, Derek; Lin, Calvin; Schulte, Michael J.
Future processors will integrate an increasing number of cores because the scaling of single-thread performance is limited and because smaller cores are more power efficient. Off-chip memory bandwidth that is shared between those many cores, however, scales slower than the transistor (and core) count does. As a result, in many future systems, off-chip bandwidth will become the bottleneck of heavy demand from multiple cores. Therefore, optimally managing the limited off-chip bandwidth is critical to achieving high performance and efficiency in future systems. In this dissertation, I will develop techniques to optimize the shared use of limited off-chip memory bandwidth in chip-multiprocessors. I focus on issues that arise from the sharing and exploit the differences in memory access characteristics, such as locality, bandwidth requirement, and latency sensitivity, between the applications running in parallel and competing for the bandwidth. First, I investigate how the shared use of memory by many cores can result in reduced spatial locality in memory accesses. I propose a technique that partitions the internal memory banks between cores in order to isolate their access streams and eliminate locality interference. The technique compensates for the reduced bank-level parallelism of each thread by employing memory sub-ranking to effectively increase the number of independent banks. For three different workload groups that consist of benchmarks with high spatial locality, low spatial locality, and mixes of the two, the average system efficiency improves by 10%, 7%, 9% for 2-rank systems, and 18%, 25%, 20% for 1-rank systems, respectively, over the baseline shared-bank system. Next, I improve the performance of a heterogeneous system-on-chip (SoC) in which cores have distinct memory access characteristics. I develop a deadline-aware shared memory bandwidth management scheme for SoCs that have both CPU and GPU cores. I show that statically prioritizing the CPU can severely constrict GPU performance, and propose to dynamically adapt the priority of CPU and GPU memory requests based on the progress of GPU workload. The proposed dynamic bandwidth management scheme provides the target GPU performance while prioritizing CPU performance as much as possible, for any CPU-GPU workload combination with different complexities.
Delay-sensitive communication over wireless multihop channels
(2009-05-15) Ali, Omar Ahmed
Wireless systems of today face the dual challenge of both supporting large traffic flows and providing reliable quality of service to different delay-sensitive applications. For such applications, it is essential to derive meaningful performance measures such as queue-length distribution and packet loss probability, while providing service guarantees. The concepts of effective bandwidth and effective capacity offer a powerful cross-layer approach that provides suitable performance metrics for the bandwidth and capacity of wireless channels supporting delay-sensitive traffic. Many wireless systems rely on multihop forwarding to reach destinations outside the direct range of the source. This work extends part of the methodology available for the design of wireless systems to the multihop paradigm. It describes the analysis of a communication system with two hops using this cross-layer approach. A framework is developed to study the interplay between the allocation of physical resources across the wireless hops and overall service quality as defined by a queueing criterion based on large deviations. Decoupling techniques introduce simple ways of analyzing the queues independently. Numerical analysis helps identify fundamental performance limits for Rayleigh block fading wireless channel models with independent and identically distributed blocks. Simulation studies present comparable results akin to that obtained using the analytical framework. These results suggest that it is imperative to account for queueing aspects while analyzing delay-sensitive wireless communication systems.
Empirical modeling of end-to-end delay dynamics in best-effort networks
(Texas A&M University, 2005-08-29) Doddi, Srikar
Quality of Service (QoS) is the ability to guarantee that data sent across a network will be recieved by the desination within some constraints. For many advanced applications, such as real-time multimedia QoS is determined by four parameters--end-to-end delay, delay jitter, available bandwidth or throughput, and packet drop or loss rate. It is interesting to study and be able to predict the behavior of end-to-end packet delays in a Wide area network (WAN) because it directly a??ects the QoS of real-time distributed applications. In the current work a time-series representation of end-to-end packet delay dynamics transported over standard IP networks has been considered. As it is of interest to model the open loop delay dynamics of an IP WAN, the UDP is used for transport purposes. This research aims at developing models for single-step-ahead and multi-step-ahead prediction of moving average, one-way end-to-end delays in standard IP WAN??s. The data used in this research has been obtained from simulations performed using the widely used simulator ns-2. Simulation conditions have been tuned to enable some matching of the end-to-end delay profiles with real traffic data. This has been accomplished through the use of delay autocorrelation profiles. The linear system identification models Auto-Regressive eXogenous (AR) and Auto-Regressive Moving Average with eXtra / eXternal (ARMA) and non-linear models like the Feedforwad Multi-layer Perceptron (FMLP) have been found to perform accurate single-step-ahead predictions under varying conditions of cross-traffic flow and source send rates. However as expected, as the multi-step-ahead prediction horizon is increased, the models do not perform as accurately as the single-step-ahead prediction models. Acceptable multi-step-ahead predictions for up to 500 msec horizon have been obtained.
Exploring tradeoffs in wireless networks under flow-level traffic: energy, capacity and QoS
(2009-12) Kim, Hongseok; De Veciana, Gustavo
Wireless resources are scarce, shared and time-varying making resource allocation mechanisms, e.g., scheduling, a key and challenging element of wireless system design. In designing good schedulers, we consider three types of performance metrics: system capacity, quality of service (QoS) seen by users, and the energy expenditures (battery lifetimes) incurred by mobile terminals. In this dissertation we investigate the impact of scheduling policies on these performance metrics, their interactions, and/or tradeoffs, and we specifically focus on flow-level performance under stochastic traffic loads. In the first part of the dissertation we evaluate interactions among flow-level performance metrics when integrating QoS and best effort flows in a wireless system using opportunistic scheduling. We introduce a simple flow-level model capturing the salient features of bandwidth sharing for an opportunistic scheduler which ensures a mean throughput to each QoS stream on every time slot. We show that the integration of QoS and best effort flows results in a loss of opportunism, which in turn results in a reduction of the stability region, degradation in system capacity, and increased file transfer delay. In the second part of the dissertation we study several ways in which mobile terminals can backoff on their uplink transmit power (thus slow down their transmissions) in order to extend battery lifetimes. This is particularly effective when a wireless system is underloaded, so the degradation in the users' perceived performance can be negligible. The challenge, however, is developing a mechanism that achieves a good tradeoff among transmit power, idling/circuit power, and the performance customers will see. We consider systems with flow-level dynamics supporting either real-time or best effort (e.g., file transfers) sessions. We show that significant energy savings can be achieved by leveraging dynamic spare capacity. We then extend our study to the case where mobile terminals have multiple transmit antennas. In the third part of the dissertation we develop a framework for user association in infrastructure-based wireless networks, specifically focused on adaptively balancing flow loads given spatially inhomogeneous traffic distributions. Our work encompasses several possible user association objective functions resulting in rate-optimal, throughput-optimal, delay-optimal, and load-equalizing policy, which we collectively denote [alpha]-optimal user association. We prove that the optimal load vector that minimizes this function is the fixed point of a certain mapping. Based on this mapping we propose an iterative distributed user association policy and prove that it converges to the globally optimal decision in steady state. In addition we address admission control policies for the case where the system cannot be stabilized.
Flow Control of Real Time Multimedia Applications Using Model Predictive Control with a Feed Forward Term
(2011-02-22) Duong, Thien Chi
Multimedia applications over the Internet are getting more and more popular. While non-real-time streaming services, such as YouTube and Megavideo, are attracting millions of visiting per day, real-time conferencing applications, of which some instances are Skype and Yahoo Voice Chat, provide an interesting experience of communication. Together, they make the fancy Internet world become more and more amusing. Undoubtedly, multimedia flows will eventually dominate the computer network in the future. As the population of multimedia flows increases gradually on the Internet, quality of their service (QoS) is more of a concern. At the moment, the Internet does not have any guarantee on the quality of multimedia services. To completely surpass this limitation, modifications to the network structure is a must. However, it will take years and billions of dollars in investment to achieve this goal. Meanwhile, it is essential to find alternative ways to improve the quality of multimedia services over the Internet. In the past few years, many endeavors have been carried on to solve the problem. One interesting approach focuses on the development of end-to-end congestion control strategies for UDP multimedia flows. Traditionally, packet losses and delays have been commonly used to develop many known control schemes. Each of them only characterizes some different aspects of network congestion; hence, they are not ideal as feedback signals alone. In this research, the flow accumulation is the signal used in feedback for flow control. It has the advantage of reflecting both packet losses and delays; therefore, it is a better choice. Using network simulations, the accumulations of real-time audio applications are collected to construct adaptive flow controllers. The reason for choosing these applications is that they introduce more control challenges than non-real-time services. One promising flow control strategy was proposed by Bhattacharya and it was based on Model Predictive Control (MPC). The controller was constructed from an ARX predictor. It was demonstrated that this control scheme delivers a good QoS while reducing bandwidth use in the controlled flows by 31 percent to 44 percent. However, the controller sometime shows erratic response and bandwidth usage jumps frequently between lowest and highest values. This is not desirable. For an ideal controller, the controlled bandwidth should vary near its mean. To eliminate the deficiency in the strategy proposed by Bhattacharya, it is proposed to introduce a feed forward term into the MPC formulation, in addition to the feedback terms. Simulations show that the modified MPC strategy maintains the benefits of the Bhattacharya strategy. Furthermore, it increases the probability of bandwidth savings from 58 percent for the case of Bhattacharya model to about 99 percent for this work.
Impact of wireless losses on the predictability of end-to-end flow characteristics in Mobile IP Networks
(Texas A&M University, 2005-02-17) Bhoite, Sameer Prabhakarrao
Technological advancements have led to an increase in the number of wireless and mobile devices such as PDAs, laptops and smart phones. This has resulted in an ever- increasing demand for wireless access to the Internet. Hence, wireless mobile traffic is expected to form a significant fraction of Internet traffic in the near future, over the so-called Mobile Internet Protocol (MIP) networks. For real-time applications, such as voice, video and process monitoring and control, deployed over standard IP networks, network resources must be properly allocated so that the mobile end-user is guaranteed a certain Quality of Service (QoS). As with the wired and fixed IP networks, MIP networks do not offer any QoS guarantees. Such networks have been designed for non-real-time applications. In attempts to deploy real-time applications in such networks without requiring major network infrastructure modifications, the end-points must provide some level of QoS guarantees. Such QoS guarantees or QoS control, requires ability of predictive capabilities of the end-to-end flow characteristics. In this research network flow accumulation is used as a measure of end-to-end network congestion. Careful analysis and study of the flow accumulation signal shows that it has long-term dependencies and it is very noisy, thus making it very difficult to predict. Hence, this work predicts the moving average of the flow accumulation signal. Both single-step and multi-step predictors are developed using linear system identification techniques. A multi-step prediction error of up to 17% is achieved for prediction horizon of up to 0.5sec. The main thrust of this research is on the impact of wireless losses on the ability to predict end-to-end flow accumulation. As opposed to wired, congestion related packet losses, the losses occurring in a wireless channel are to a large extent random, making the prediction of flow accumulation more challenging. Flow accumulation prediction studies in this research demonstrate that, if an accurate predictor is employed, the increase in prediction error is up to 170% when wireless loss reaches as high as 15% , as compared to the case of no wireless loss. As the predictor accuracy in the case of no wireless loss deteriorates, the impact of wireless losses on the flow accumulation prediction error decreases.
NoC Resource Allocation Based on Physical Design Techniques
(2014-05-05) Yang, Gongming
Networks-on-Chip (NoC) has been recognized as a scalable approach for on-chip communication. Quality-of-Service (QoS) is a fundamental part of application specific NoCs. This thesis focuses on resource allocation on NoC, to improve the capability of NoC for Guaranteed Service (GS). A graph model is adopted to describe physical and temporal sources of a NoC. Based on the graph model, an RRR-based algorithm is proposed for simultaneous routing and time slot allocation. In addition, a negotiation-based algorithm is suggested for achieving power-efficient QoS for application-specific NoCs. Last, a hybrid NoC architecture, which combines circuit switching and packet switching, is developed and investigated. Experimental results show that our techniques outperform previous works.
On multiple-antenna communications: signal detection, error exponent and and quality of service
(2009-05-15) Li, Qiang
Motivated by the demand of increasing data rate in wireless communication, multiple-antenna communication is becoming a key technology in the next generation wireless system. This dissertation considers three different aspects of multipleantenna communication. The first part is signal detection in the multiple-input multiple-output (MIMO) communication. Some low complexity near optimal detectors are designed based on an improved version of Bell Laboratories Layered Space-Time (BLAST) architecture detection and an iterative space alternating generalized expectation-maximization (SAGE) algorithm. The proposed algorithms can almost achieve the performance of optimal maximum likelihood detection. Signal detections without channel knowledge (noncoherent) and with co-channel interference are also investigated. Novel solutions are proposed with near optimal performance. Secondly, the error exponent of the distributed multiple-antenna communication (relay) in the windband regime is computed. Optimal power allocation between the source and relay node, and geometrical relay node placement are investigated based on the error exponent analysis. Lastly, the quality of service (QoS) of MIMO/single-input single- output(SISO) communication is studied. The tradeoff of the end-to-end distortion and transmission buffer delay is derived. Also, the SNR exponent of the distortion is computed for MIMO communication, which can provide some insights of the interplay among time diversity, space diversity and the spatial multiplex gain.
Quality of Service (QoS) security in mobile ad hoc networks
(Texas A&M University, 2006-10-30) Lu, Bin
With the rapid proliferation of wireless networks and mobile computing applications, Quality of Service (QoS) for mobile ad hoc networks (MANETs) has received increased attention. Security is a critical aspect of QoS provisioning in the MANET environment. Without protection from a security mechanism, attacks on QoS signaling system could result in QoS routing malfunction, interference of resource reservation, or even failure of QoS provision. Due to the characteristics of the MANETs, such as rapid topology change and limited communication and computation capacity, the conventional security measures cannot be applied and new security techniques are necessary. However, little research has been done on this topic. In this dissertation, the security issues will be addressed for MANET QoS systems. The major contributions of this research are: (a) design of an authentication mechanism for ad hoc networks; (b) design of a security mechanism to prevent and detect attacks on the QoS signaling system; (c) design of an intrusion detection mechanism for bandwidth reservation to detect QoS attacks and Denial of Service (DoS) attacks. These three mechanisms are evaluated through simulation.
Retrospect on contemporary Internet organization and its challenges in the future
(2011-05) Gutierrez De Lara, Felipe; Bard, William Carl, 1944-; Julien, Christine
The intent of this report is to expose the audience to the contemporary organization of the Internet and to highlight the challenges it has to deal with in the future as well as the current efforts being made to overcome such threats. This report aims to build a frame of reference for how the Internet is currently structured and how the different layers interact together to make it possible for the Internet to exist as we know it. Additionally, the report explores the challenges the current Internet architecture design is facing, the reasons why these challenges are arising, and the multiple efforts taking place to keep the Internet working. In order to reach these objectives I visited multiple sites of organizations whose only reason for existence is to support the Internet and keep it functioning. The approach used to write this report was to research the topic by accessing multiple technical papers extracted from the IEEE database and network conferences reviews and to analyze and expose their findings. This report utilizes this vii information to elaborate on how network engineers are handling the challenges of keeping the Internet functional while supporting dynamic requirements. This report exposes the challenges the Internet is facing with scalability, the existence of debugging tools, security, mobility, reliability, and quality of service. It is explained in brief how each of these challenges are affecting the Internet and the strategies in place to vanquish them. The final objectives are to inform the reader of how the Internet is working with a set of ever changing and growing requirements, give an overview of the multiple institutions dedicated to reinforcing the Internet and provide a list of current challenges and the actions being taken to overcome them.

Browsing by Subject "QoS"

Results Per Page

Sort Options