Routing for multimedia traffic in wireless frequency-hopcommunication networks

A new method is described for routing multimedia traffic in a frequency-hop (FH) store-and-forward packet radio network. The method is illustrated for traffic of two types, each type having its own throughput, delay, and error-rate requirements. A typical application is the routing of voice and data packets in a distributed multiple-hop network. In such an application, voice packets cannot tolerate much delay, but they are allowed to contain a small number of frame erasures while data packets must be delivered error-free even if a moderate delay is required to do so. The fully distributed routing protocol presented in the paper takes into account the type of service required for each type of traffic, and it adapts to the interference as seen by the FH radio receivers in the network. Our approach to multimedia routing is based on least-resistance routing with different link and path resistance metrics for different message types. Each of the resistance metrics for a link reflects the ability of the link to provide the service required by the one of the message types. This includes, but is not limited to, a measure of the likelihood of successful reception by the FH radio receiver for that link. The route selection for a particular type of packet depends on the resistances of the links along the routes from that packet's source to its destination. In general, different routes may be selected for different types of packets. The primary conclusion of this paper is that the quality of service increases for each of the two types of multimedia traffic if the routing protocol accounts for the type of message that is being relayed     

Performance of sufficient conditions for distributed quality-of-service support in wireless 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 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.     

CDMA网络中多媒体业务的接入控制

从码分多址(CDMA)系统的特点出发，采用多维马尔可夫过程来分析多媒体业务共存时基于干扰水平的接入控制策略，得到在小区容量可变情况下的系统性能。文中考虑到切换用户的优先级以及不同类型用户的不同QoS要求，还在系统中设置了多级接入门限，从而实现在扩大系统容量的同时，又力求保证系统已有的链路质量，实现接入控制的目的。     

An adaptive reservation scheme for VBR voice traffic in wireless ATM networks

A reservation scheme, named dynamic hybrid partitioning, is proposed for the Medium Access Control (MAC) protocol of wireless ATM (WATM) networks operating in Time Division Duplex (TDD) mode. The goal is to improve the performance of the real-time Variable Bit Rate (VBR) voice traffic in networks with mixed voice/data traffic. In most proposed MAC protocols for WATM networks, the reservation phase treats all traffic equally, whether delay-sensitive or not. Hence, delay-sensitive VBR traffic sources have to compete for reservation each time they wake up from idle mode. This causes large and variable channel access delays, and increases the delay and delay variation (jitter) experienced by ATM cells of VBR traffic. In the proposed scheme, the reservation phase of the MAC protocol is dynamically divided into a contention-free partition for delay-sensitive idle VBR traffic, and a contention partition for other traffic. Adaptive algorithms dynamically adjust the partition sizes to minimize the channel bandwidth overhead. Simulation results show that the delay performance of delay-sensitive VBR traffic is improved while minimizing the overhead.     

Transmission policies and traffic management in multimedia wireless networks

We consider multimedia wireless networks in environments where traffic characterizations and traffic rates are generally time‐varying. For such networks we propose a CDMA transmission policy, in conjunction with a moving boundaries concept induced by a traffic monitoring high‐level protocol. The proposed transmission/traffic management technique is analyzed and numerically evaluated. This revised version was published online in July 2006 with corrections to the Cover Date.     

Performance of CAC strategies for multimedia traffic in wireless networks

Call admission control (CAC) strategies for multimedia traffic in wireless networks is studied. A wireless network cell serving two types of customers; narrowband customers, which require one channel and wideband customers, which require b/sub w//spl ges/1 channels is considered. Two CAC strategies; reserve channels strategy (RCS) and threshold strategy (TS) are applied to the wireless cell and their performances are compared. The results show that in most operating conditions, the RCS has a lower blocking probability and probability of handoff call dropping than the TS. Only in the case when the wideband traffic is higher than the narrowband traffic that the weighted probability of handoff call dropping becomes higher for the RCS. Mean server utilization is lower for the threshold CAC than for the reserve channels CAC strategy at most operating conditions.     

Prediction-based resource allocation for multimedia traffic over high-speed wireless networks

Both call admission control (CAC) and efficient scheduling are of great importance in next generation wireless networks, which are expected to handle various types of highly demanding multimedia users. In this paper, we present and evaluate a new mechanism which combines CAC with bandwidth allocation in a high-speed downlink time division multiple access (TDMA) wireless channel with errors; our mechanism incorporates predictions of the wireless channel condition in its decision making and our results show that, with the use of the feedback between the scheduler and the admission controller, system performance is significantly enhanced (in terms of voice-WAP-SMS-H.263 video QoS) compared to a scheme without prediction on the channel condition.     

Efficient channel assignment method for multimedia traffic in wireless mesh networks

In wireless mesh networks, the availability of spectrum should be utilized efficiently because the exchanging of traffic rate of multimedia applications is increasing day to day. The traffic of multimedia content may degrade the network performance in terms of high packet loss and throughput degradation because of asynchronous behavior between the sender and the receiver. The proposed Efficient Channel Reservation and Assignment (EchRA) results in successful originating and handing off of multimedia call transmissions using the four dimensional Markov chain process. The EChRA algorithm, proposed in this paper, achieves the maximum throughput performance considering the parameters of blocking probability, dropping probability, and synchronized dwell time between the source and destination. The quality of service is guaranteed by sharing the available slots and by using efficient queuing model to service the incoming and handoff calls, and henceforth, the successful completion of handoff calls rate is increased. Copyright © 2015 John Wiley & Sons, Ltd.     

Mobility modeling and analytical solution for spatial traffic distribution in wireless multimedia networks

In this paper, we propose a general mobility model suitable for wireless multimedia networks. Our model is based on splitting a region into subregions. Furthermore, we make an analogy between subregions as well as their inter-connections with a multi-class Jackson queueing network comprising of infinite-server nodes. The main attribute of such a network is due to its product-form stationary distribution. Using this model, we are able to obtain a closed analytical form for the spatial traffic distribution corresponding to a specific number of network-connected users with different classes of service and mobility in a typical region. Also, we show the flexibility obtained by the proposed mobility model in representing some general distributions such as sum-of-hyper-exponentials (SOHYP), hyper-Erlang and Cox which were previously suggested to model mobility-related statistical parameters, e.g., cell dwell time and channel holding time. Finally, we apply the proposed model to a few mobility scenarios and obtain the resultant active user's location density.     

Guaranteed quality-of-service wireless access to ATM networks

We study the problem of wireless access to asynchronous transfer modes (ATMs). We consider three classes of ATM sources: constant bit rate (CBR), variable bit rate (VBR), and available bit rate (ABR). We propose a polling scheme with nonpreemptive priority. Under such a scheme, we derive sufficient conditions such that all the CBR sources satisfy their jitter constraints and all the VBR sources satisfy their delay constraints. The remaining bandwidth is used by the ABR sources, for which we adapt a random access scheme proposed by Chen and Lee (1994). For this random access scheme, we derive the throughput-offer load characteristic, and thus the capacity. Based on this, we propose adaptive random access schemes that track the offer load to its optimal value. Our simulations show that our adaptive schemes maintain a high throughput with respect to the whole range of system load     

Realistic cell-oriented adaptive admission control for QoS support in wireless multimedia networks

An important quality-of-service (QoS) issue in wireless multimedia networks is how to control handoff drops. We propose admission-control algorithms that adaptively control the admission threshold in each cell in order to keep the handoff-dropping probability below a predefined level. The admission threshold is dynamically adjusted based on handoff-dropping events. We first present a simple admission-control scheme that brings out an important performance evaluation criterion - intercell fairness - and serves as a reference point. We then investigate the intercell unfairness problem and develop two enhanced schemes to overcome this problem. The performance of these protocols is benchmarked and compared with other competitive schemes. The results indicate that our schemes perform very well while, in addition, achieving significantly reduced complexity and signaling load.     

A cross-Layer quality-of-service mapping architecture for video delivery in wireless networks

Providing quality-of-service (QoS) to video delivery in wireless networks has attracted intensive research over the years. A fundamental problem in this area is how to map QoS criterion at different layers and optimize QoS across the layers. In this paper, we investigate this problem and present a cross-layer mapping architecture for video transmission in wireless networks. There are several important building blocks in this architecture, among others, QoS interaction between video coding and transmission modules, QoS mapping mechanism, video quality adaptation, and source rate constraint derivation. We describe the design and algorithms for each building block, which either builds upon or extend the state-of-the-art algorithms that were developed without much considerations of other layers. Finally, we use simulation results to demonstrate the performance of the proposed architecture for progressive fine granularity scalability video transmission over time-varying and nonstationary wireless channel.     

Dynamic capacity allocation for quality-of-service support in IP-based satellite networks

In broadband satellite access networks, the efficient management of the return channel transmission capacity is key in reducing the service cost while satisfying the QoS requirements of IP-based multimedia applications. In this article a dynamic capacity allocation scheme based on combined free/demand assignment multiple access is proposed, allowing the return channel capacity to be efficiently shared among many user terminals. Simulation results indicate that the proposed scheme provides adequate DiffServ IP QoS support while maintaining high satellite bandwidth utility and reduced DCA signaling overhead.     

QoS provisioning for multimedia wireless networks

As we move towards IP-based multimedia wireless networks with voice, video and data convergence, quality of service (QoS) provisioning will become an increasingly challenging task. One implication is that greater emphasis on managing the call admission and overall network resources will be needed. This paper presents a conservative and adaptive quality of service (CAQoS) framework for provisioning the QoS for both real-time and non-real-time traffic in a multimedia wireless network. Unlike most conventional schemes, which gradually scale down the bandwidth of ongoing connections to accommodate new connection/hand-off requests, CAQoS introduces an early scaling-down of bandwidth for new connections based on a designated provisioning model. The performance of a CAQoS system is evaluated through simulations of a realistic wireless environment. Simulation results show that CAQoS meets our design goals and outperforms conventional schemes.     

Multirate scheduling of VBR video traffic in ATM networks

One of the major attractions of asynchronous transfer mode (ATM) networks for transporting bursty video traffic is its ability to exploit the multiplexing gains of packet switching while providing quality of service guarantees. Unfortunately, most of the multiplexing mechanisms proposed in the literature fail to exploit the multiplexing gains of ATM. We propose a multirate service mechanism that allows a session to be served at different rates at different times. Applications generating bursty data, such as variable bit-rate (VBR) video, can take advantage of multirate service by requesting a high rate of service for brief periods of bursty arrivals and a much lower rate of service for all other times. Consequently, the applications can improve their delay performance without reserving a high bandwidth for the entire duration of the sessions. Furthermore, the scheduler can multiplex the peaks and the lulls in service rates of different sessions and improve the utilization of the system. Using MPEG video traces from a number of applications, we show that multirate servers outperform single-rate PGPS (packet-by-packet generalized processor sharing) servers and CBR (constant bit-rate) servers in terms of number of connections admitted, while providing the same level of service guarantees. We also investigate the performance of multirate service when service quality need not be guaranteed. We refer to this as predictive service. We propose a measurement-based admission control procedure for predictive service, and show that it helps increase the size of the admissible region even further     

A dynamic call admission scheme for VBR traffic in ATM networks

The role of call admission control (CAC) in high-speed networks is to maintain the network utilization at a high level, while ensuring that the quality of service (QoS) requirements of the individual calls are met. We use the term static CAC to describe schemes that always allocate the same bandwidth to a specific group of multiplexed calls, independent of the other traffic sharing the link. Dynamic CAC, on the other hand, denotes a scheme in which the bandwidth allocation to a group of calls sharing a queue is influenced by the traffic in other queues destined for the same outgoing link. We propose a generic dynamic call admission scheme for VBR and ABR traffic whose aim is to reduce the blocking rate for VBR calls at the expense of a higher blocking rate for ABR calls. Our scheme is generic because it builds up on a pre-existing static scheme, e.g., one based on a simple notion of effective bandwidth. Our simple approach results in a significant reduction of the blocking rate for VBR traffic (several orders of magnitude), if the bandwidth requirements of a single call are a reasonably small fraction of the link capacity. At the same time, the deterioration of service for ABR traffic can be contained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Scheduling in multimedia CDMA wireless networks

Wireless systems in the future will have to provide multimedia services where different users have different physical-layer quality of service (QoS) requirements (e.g., bit energy per interference power density, E/sub b//N/sub 0/, or bit error rate and power constraints) and network-layer QoS requirements (e.g., delay bound, delay-jitter, throughput, and loss). We investigate the use of power control, processing gain and/or multiple codes, and scheduling in CDMA systems to accommodate these diverse service requirements. We first show that the instantaneous capacity region, given in terms of the set of user bit rates that can be supported simultaneously subject to peak power and E/sub b//N/sub 0/ constraints, is nonconvex. This suggests that by time-sharing the channel, one may be able to get better system throughput. We define the capacity region as the convex hull of the instantaneous capacity region and we show that it may be obtained by time sharing between operating points, where each user either uses full power or is silent (bang-bang control). We then consider the problem of scheduling so as to meet prespecified delay bounds or minimum service curve requirements for traffic streams, which are specified in terms of a traffic profile such as a sigma-rho constraint (enforced by a leaky bucket) and a guarantee that the system is stable.     

Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

Next generation wireless code division multiple access (CDMA) networks are required to support packet multimedia traffic. This paper addresses the connection admission control problem for multiservice packet traffic modeled as Markov modulated Poisson process (MMPP) with the quality of service (QoS) requirements on both physical layer signal-to-interference ratio (SIR) and network layer blocking probability. Optimal linear-programming-based algorithms are presented that take into account of SIR outage probability constraints. By exploiting the MMPP traffic models and introducing a small SIR outage probability, the proposed algorithms can dramatically improve the network utilization. In addition, we propose two reduced complexity algorithms that require less computation and can have satisfactory approximation to the optimal solutions. Numerical examples illustrating the performance of the proposed schemes are presented.     

End-to-end quality-of-service coordination for mobile multimedia applications

Transmitting real-time multimedia streams over heterogeneous mobile networks is a challenging task. Variation in network and system conditions can dramatically affect application performance. When providing end-to-end quality-of-service (QoS) multiple system facets should be coordinated: orchestration of local and peer resources, reservation of network resources, adaptation of multimedia streams, etc. This paper presents an end-to-end negotiation protocol (E2ENP) for negotiating and coordinating QoS on an end-to-end basis both at application and network layer. Based on a flexible extensible markup language (XML) model and extending SDPng concepts, the protocol enables the negotiation of system capabilities and allows provider-services to effectively influence the negotiation process. The aim of the E2ENP design is to optimize the efficiency of multimedia call setup and reduce the time for QoS renegotiations, whenever vertical handovers or spontaneous network reconfigurations occur. The basic protocol is presented, together with implementation and measurement results, stemming from several studies on current and future third-generation/fourth-generation scenarios.