Integrated scheduling and buffer management for 3G wireless forward packet data channels

We propose a control method for high quality and highly effective video multicasting to satisfy various QoS requirements of clients. Our method employs an MPEG-2 hierarchical coding technique for that purpose. Further, flow aggregation is introduced to achieve application level QoS (Quality of Service) guarantees. Our method can guarantee the network level QoS only if underlying networks provide some guaranteed services as in ATM, Intserv and Diffserv. We investigate the effectiveness and applicability of our method on networks with various QoS guarantees.

In this paper, we propose an energy efficient user association scheme for uplink heterogeneous networks with machine-to-machine (M2M) and human-to-human (H2H) coexistence. A group based random access protocol is designed for massive number of machine-type-communications (MTC) user equipments' (UEs) transmissions. A user association problem for UEs' energy efficiency maximization is formulated considering the HTC UEs' quality of service (QoS) guarantees and load balance among multiple BSs, simultaneously. A distributed iterative algorithm is developed to solve the optimization problem. In addition, the convergence of the proposed algorithm is proved. Simulation results show that our proposed scheme outperforms other schemes in terms of energy efficiency and QoS guarantees.

ETXOP: A resource allocation protocol for QoS-sensitive services provisioning in 802.11 networks

In order to support mutimedia data transfers, the underlying network should support quality of service (QoS) guarantees. The QoS guarantees by the network and the associated systems (hardware/software) is a complex task. In this talk, I’ll outline the various issues related to the QoS in the Internet environment. The notion of QoS routing will be described in detail. Various options for routing and their associated overheads will be presented. Implementation issues will also be discussed.

We introduce a variety of mechanisms to enable scalable, adaptive, and reliable quality of service (QoS) guarantees across heterogeneous networking environments. The resultant scalable resource reservation scheme (SRRS) is the first resource management scheme that provides efficient fault protection based on the virtual reservation mechanism and a penalty-based adaptable reservation mechanism, so that QoS can continue to be guaranteed in the presence of faults without wasting expensive network resources unnecessarily. Based on the proposed geographical reservation mechanism and virtual IP addressing, SRRS can enable QoS guarantees in ad hoc mobile wireless networks. Also, resource reservation and allocation in SRRS are adaptive to the networking environments so that wireless QoS-guarantee issues can be resolved in the presence of mobility, making SRRS suitable for wireless mobile networks. We evaluate the performance of SRRS based on simulation and analysis, and show that SRRS can achieve considerably lower blocking rates as compared to previous reservation protocols.

Applications communicating over connectionless networks, such as IP, cannot obtain per-connection Quality of Service (QoS) guarantees. In contrast, the connection-oriented nature of the ATM layer and its per-virtual-circuit QoS guarantees are visible to a native-mode ATM application. We describe the design and implementation of operating system and signaling support for native-mode applications, independent of the semantics of the protocol layers or of the signaling protocol. The work was done in the context of a Unix-like operating system and the Xunet 2 wide-area high-speed ATM network. The IPC-based interface between an application and the signaling entity allows processes to request parameterized virtual circuits, and the signaling-kernel interface allows resources to be reclaimed from prematurely terminating processes. We also built a simple encapsulation layer over raw IP that allows any host with IP access to send AAL frames into the wide-area network with little performance degradation. Our design makes it simple to port existing TCP/IP socket applications to a native-mode ATM protocol stack and also enables interoperation of existing IP networks with our ATM network. Our experience has been positive - the design is robust, easily extendible and scales well with the number of open connections.

Using GENI for experimental evaluation of Software Defined Networking in smart grids

We propose a novel and cost-effective approach for the deployment of third generation (3G) wireless systems over hybrid fiber coaxial (HFC) CATV networks. The main goal is to facilitate 3G deployment over the existing CATV plant and reduce the large cost required for building a dedicated last mile infrastructure for 3G access networks. Our proposal reduces the last mile cost by sharing the existing CATV network and using the standard equipment and protocols of data-over-cable systems interface specifications (DOCSIS). This allows rapid deployment of 3G wireless systems, facilitates convergence of wireless and wireline networks and paves the way towards all IP wireless networks. Enhancements to the DOCSIS medium access control (MAC) protocol must be implemented in order to support Quality of Service (QoS) guarantees for 3G data and signaling traffic. This paper presents the proposed 3G over CATV network architecture and DOCSIS medium access control (MAC) enhancements for enabling the support of QoS guarantees for 3G data and signaling traffic. The proposed MAC enhancements can reduce the access delay for delay-sensitive traffic by 30 to 40% over existing DOCSIS MAC without compromising QoS guarantees for other traffic classes, or the DOCSIS channel utilization. Copyright © 2004 John Wiley & Sons, Ltd.

Due to recent advances in wireless technologies, wireless mesh networks (WMNs) are expected in the near future to fully handle content-rich multimedia services with various quality of services (QoS) guarantee. Unlike traditional data applications, multimedia applications require QoS support in order to satisfy the user's service requirements. Admission control has been advocated as a promising approach to tackle this challenging issue since it is a key management function for which a new flow is admitted based on the condition that the QoS requirements of all flows in the network can still be met after the new flow begins. In this paper, a Rate Adaptive Routing on Cliques Admission Control protocol (so-called RA-RCAC) for WMNs is proposed, which is able to provide feedbacks to the application layer whenever congestion occurs in the network. The RA-RCAC scheme merges the design features of two chosen benchmarking schemes, namely, an Interference-Aware Admission Control and QoS routing protocol in WMN (so-called IAAC) and a distributed admission control protocol for WMNs (so-called RCAC) to produce a protocol design that satisfies the QoS guarantee. Our proposed RA-RCAC protocol is evaluated using simulation analysis. The performance evaluation results demonstrate its superiority over the aforementioned benchmark schemes in terms of throughput, end-to-end delay, packet delivery ratio, and loss ratio performance evaluation metrics.

To support Quality of service (QoS)‐sensitive applications like real‐time video streaming in IEEE 802.11 networks, a MAC layer extension for QoS, IEEE 802.11e, has been recently ratified as a standard. This MAC layer solution, however, addresses only the issue of prioritized access to the wireless medium and leaves such issues as QoS guarantee and admission control to the traffic control systems at the higher layers. This paper presents an IP‐layer traffic control system for IEEE 802.11 networks based on available bandwidth estimation. We build an analytical model for estimating the available bandwidth by extending an existing throughput computation model, and implement a traffic control system that provides QoS guarantees and admission control by utilizing the estimated available bandwidth information. We have conducted extensive performance evaluation of the proposed scheme via both simulations and measurements in the real test‐bed. The experiment results show that our estimation model and traffic control system work accurately and effectively in various network load conditions without IEEE 802.11e. The presence of IEEE 802.11e will allow even more efficient QoS provision, as the proposed scheme and the MAC layer QoS support will complement each other. Copyright © 2006 John Wiley & Sons, Ltd.

In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the forward link to support data services for which delay requirements are less stringent. The IxEV-DO [P. Bender et al., 2000] standard provides a single time-shared forward link channel and no synchronous channels since it was designed primarily for data services. It has recently been suggested that certain voice services (e.g.. Voice over IP (VoIP) and push-to-talk (PTT)), can be efficiently transported over such time-shared channels since they have less stringent delay requirements compared to circuit-switched voice. In this paper we investigate the capacity of VoIP users over these time-shared channels and investigate the sensitivity to various base station (BS) and mobile station (MS) design parameters, algorithms and features. Note that detailed simulations of each standard is not provided but rather a comparative approach is used whereby we investigate specific features of each standard. Our focus is on the forward channel since code division multiplexing is performed in the reverse link and hence comparable user capacities are achieved.

Distributed Computing and Networking In this paper, we focus on applications having quantitative QoS (Quality of Service) requirements on their end-to-end response time (or jitter). We propose a solution allowing the coexistence of two types of quantitative QoS garantees, deterministic and probabilistic, while providing a high resource utilization. Our solution combines the advantages of the deterministic approach and the probabilistic one. The deterministic approach is based on a worst case analysis. The probabilistic approach uses a mathematical model to obtain the probability that the response time exceeds a given value. We assume that flows are scheduled according to non-preemptive FP/FIFO. The packet with the highest fixed priority is scheduled first. If two packets share the same priority, the packet arrived first is scheduled first. We make no particular assumption concerning the flow priority and the nature of the QoS guarantee requested by the flow. An admission control derived from these results is then proposed, allowing each flow to receive a quantitative QoS guarantee adapted to its QoS requirements. An example illustrates the merits of the coexistence of deterministic and probabilistic QoS guarantees.

In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, the authors introduce a resource allocation algorithm by exploiting layered coding combined with erasure correction coding for multicast services in the downlink of orthogonal frequency-division multiple access-based multi-antenna system. To reduce the feedback overhead of uplink, the authors design a novel transmission scheme with limited feedback. Then, the joint subcarrier and power allocation problem for the data of base layer and enhancement layers are formulated, which is shown to be non-deterministic polynomial- hard. Hence, in order to reduce the computational complexity, they propose a three-phase suboptimal algorithm. The algorithm is designed to maximise the system throughput, whereas at the same time guarantee the quality of services (QoS) requirements of all multicast groups. It is composed of precoding scheme, proportional fairness subcarrier allocation algorithm and modified water-filling power allocation algorithm with QoS guarantees (MWF-Q). To further decrease the complexity of MWF-Q, a power allocation algorithm with increased fixed power allocation algorithm with QoS guarantees is introduced. Simulation results show that the proposed algorithms based on limited feedback scheme significantly outperform CMS and any other existing algorithm with full feedback. Moreover, the proposed scheme can efficiently reduce 50% of the full feedback overhead.

This paper presents a comprehensive literature review on applications of economic and pricing theory for resource management in the evolving fifth generation (5G) wireless networks. The 5G wireless networks are envisioned to overcome existing limitations of cellular networks in terms of data rate, capacity, latency, energy efficiency, spectrum efficiency, coverage, reliability, and cost per information transfer. To achieve the goals, the 5G systems will adopt emerging technologies such as massive multiple-input multiple-output, mmWave communications, and dense heterogeneous networks. However, 5G involves multiple entities and stakeholders that may have different objectives, e.g., high data rate, low latency, utility maximization, and revenue/profit maximization. This poses a number of challenges to resource management designs of 5G. While the traditional solutions may neither efficient nor applicable, economic and pricing models have been recently developed and adopted as useful tools to achieve the objectives. In this paper, we review economic and pricing approaches proposed to address resource management issues in the 5G wireless networks including user association, spectrum allocation, and interference and power management. Furthermore, we present applications of economic and pricing models for wireless caching and mobile data offloading. Finally, we highlight important challenges, open issues and future research directions of applying economic and pricing models to the 5G wireless networks.

We present linear precoding methods for downlink transmission in multi-user multiple-input multiple-output (MIMO) systems where channel state information (CSI) can be obtained through training. In this paper, channel training overhead and estimation error are rigorously accounted for while determining the net system throughput. First, we consider the case with training on the reverse link only. We study a precoding method which is a combination of two schemes: selection of users with largest estimated gains and zero-forcing to selected users. Next, we consider the case with training on both reverse and forward links. We obtain a lower bound on the weighted-sum capacity, and propose an algorithm to determine an efficient precoding matrix. This precoding method effectively utilizes the training on the reverse and forward links in improving net throughput.