An investigation into HFC MAC protocols: Mechanisms, implementation, and research issues

This study comprehensively reviews two HFC MAC protocols: Data-Over-Cable Service Interface Specifications (DOCSIS) and IEEE 802.14a. DOCSIS was approved by the ITU as a standard and is supported by many vendors. However, IEEE 802.14a remains a draft due to the delayed standardization process. After briefly introducing the features of HFC networks, the basic operations and mechanisms of these two MAC protocols are then examined. Both standards view an upstream channel as a stream of minislots and have similar mechanisms for upstream bandwidth management, virtual queue, downstream in MPEG-2 format, data-linklayer security, and ranging. However, the standards adopt different mechanisms for upstream access modes, QoS support, and collision resolution. Moreover, the implementation issues over hardware and software design for DOCSIS networks are investigated. This work also identifies the research issues in HFC MAC protocols, particularly allocation and scheduling issues.     

Network architecture and medium access control for deploying third generation (3G) wireless systems over CATV networks

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.     

Efficient Traffic Scheduling for Real Time VBR MPEG Video Transmission Over DOCSIS-Based HFC Networks

Data-over-cable service interface specifications (DOCSIS), the de facto standard in the cable industry, defines a scheduling service called real-time polling service (rtPS) to provision quality of service (QoS) transmission of real-time variable bit rate (VBR) videos. However, the rtPS service intrinsically has high latency, which makes it not applicable to real-time traffic transport. In this paper, we present a novel traffic scheduling algorithm for hybrid fiber coax (HFC) networks based on DOCSIS that aims to provide QoS for real-time VBR video transmissions. The novel characteristics of this algorithm, as compared to those described in published literatures, include 1) it predicts the bandwidth requirements for future traffic using a novel traffic predictor designed to provide simple yet accurate online prediction; and 2) it takes the attributes of physical (PHY) layer, media access control (MAC) layer and application layer into consideration. In addition, the proposed traffic scheduling algorithm is completely compatible with the DOCSIS specification and does not require any protocol changes. We analyze the performance of the proposed traffic predictor and traffic scheduling algorithm using real-life MPEG video traces. Simulation results indicate that 1) the proposed traffic predictor significantly outperforms previously published techniques with respect to the prediction error and 2) Compared with several existing scheduling algorithms, the proposed traffic scheduling algorithm surpasses other mechanisms in terms of channel utilization, buffer usage, packet delay, and packet loss rate.     

A priority scheme for the IEEE 802.14 MAC protocol for hybridfiber-coax networks

In order to support quality-of-service (QoS) for real-time data communications such as voice, video and interactive services, multiaccess networks must provide an effective priority mechanism. The context of this work is the IEEE 802.14 standard for hybrid fiber coaxial (HFC) networks which has a shared upstream channel for transmissions from stations to the headend. This work presents a multilevel priority collision resolution scheme, which separates and resolves collisions between stations in a priority order, thereby, achieving the capability for preemptive priorities. We present a set of simulation scenarios which show the robustness and efficiency of the scheme, such as its ability to isolate higher priority traffic from lower priorities and to provide quick access to high-priority requests. In March 1998, a framework for handling priorities in the collision resolution process, which adopts a semantics similar to the semantics of our scheme, was included in the 802.14 standard     

基于DOCSIS的CM和CMTS的设计与实现

HFC（Hybrid Fiber Coax)为多媒体和宽带业务提供了一种宽带接入方式。本文论述了HFC接入网的结构和频谱安排,并结合HFC接入网的双向改造,对媒体接入层（MAC）和物理层（PHY）进行了具体分析,同时给出DOCSIS（Data-Over-Cable Service Interface Specification)规范中MAC协议解决上行信道分配问题的实现方法以及物理层的方案;最后,给出了符合DOCSIS规范的CM（Cable Modem）和CMTS（Cable Modem Terminal System)的软件和硬件实现方案。     

一种支持HFC网中QoS业务的调度方法

为了在HFC中支持不同QoS的业务,必须仔细研究CMTS的上行业务调度算法。但是在当前最重要的标准 MCNS DOCSIS1.1中,没有规定任何针对 QoS设计的调度算法,而很多文献都是以改进的先到先服务(FCFS)为基础讨论的。该文提出了一种可支持 QoS的调度算法,通过将业务分类,按照不同类型业务的带宽占用动态分配业务的优先级,同时还考虑了回带(piggyback)对网络吞吐量的影响,给出了仿真结果,并针对典型的时延敏感业务IP Telephony提出了改善网络通道利用率的方法。     

HFC双向互动接入网用户身份验证方案研究

描述了基于光纤同轴电缆混合(HFC)系统的双向互动接入网的性能特点,讨论了MCNS开发的DOCSIS协议原理,提出了一种基于CableModem接入方式,采用二次IP地址分配技术的用户身份验证方案,分析了该方案的工作流程原理与技术优势.     

A robust broadband headend switching algorithm

Local area networks (LANs) with a branching rooted-tree topology are considered. In these systems, the metropolitan area gateway (MAG) is responsible for coordinating the flow of traffic into and out of the local subnetworks. A traffic scheduling technique is proposed for this topology. The algorithm is motivated by a finite-horizon maximization of conditional channel cycle utilization, resulting in a zero/infinite scheduling window scheme. Improved mean delay performance is achieved over a much wider range of traffic conditions than for other known algorithms. In order to obtain this robust behaviour, the local media access algorithms are modified to interact with the dynamic scheduling scheme in the MAG     

Nonpreemptive priority scheme for the S-MAC protocol in multimedia mobile sensor networks

S-MAC is a well-known medium access control (MAC) protocol designed for wireless sensor networks (WSNs). S-MAC uses a few novel techniques to reduce energy consumption and support self-configuration. Besides, S-MAC also achieves good scalability and collision avoidance by utilizing a combined scheduling and contention scheme. However, S-MAC does not have any priority scheme, making it unsuitable for multimedia applications and suffering from varying degree of starvation and fairness problems. In this paper, we propose a simple, efficient, but yet well-performing sliding contention window control mechanism to modify the S-MAC protocol such that priority can be supported along with the multimedia applications in multimedia mobile sensor networks. Furthermore, the proposed scheme could solve the starvation problem and alleviate the fairness problem. An analytic model is carried out to study the saturation throughput of proposed scheme. In addition, simulations were also conducted to analyze the proposed scheme and the results show that the proposed scheme is able to carry the prioritized traffic and mitigate the starvation and fairness problems.     

DOCSIS performance analysis under high traffic conditions in the HFC networks

Hybrid Fiber Coaxial (HFC) networks provide a wide bandwidth and represent the solution of choice for many residential networks nowadays. The Data Over Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks and is supported by the majority of current vendors. This protocol uses the Truncated Binary Exponential Back-off (TBEB) algorithm to resolve collisions within the network by means of a back-off window. However, the performance of this algorithm tends to deteriorate when the network load is high. Consequently, the present study develops a novel mathematical model for the TBEB algorithm and then uses this model to identify the window size which yields the optimal system throughput and minimum delay time under high traffic conditions. The present numerical results confirm that the performance is improved when the window settings identified from the developed model are applied.     

Performance analysis of a discrete-time queueing system with priority jumps

Supporting multiple types of traffic with different Quality of Service (QoS) requirements is not an easy task in modern communication networks. An efficient priority scheduling scheme is thus of great importance. The static, Head-Of-Line (HOL) priority scheme achieves differentiation between different types of traffic, but may have a too severe impact on the performance level of lower-priority traffic. We therefore propose a priority scheme with priority jumps in this paper: the Head-Of-Line Jump-If-Arrival (HOL-JIA) scheme. We show that the use of probability generating functions (pgfs) is suitable for analytically studying the system, and for illustrating the impact of priority jumps on the performance of the system.     

Performance analysis of the IEEE 802.11e wireless networks with TCP ACK prioritization

With the advent of multimedia over wireless local area networks, the IEEE 802.11e standard was proposed to incorporate Quality of Service (QoS). It has been found that the throughput of Transmission Control Protocol (TCP) is less than that of User Datagram Protocol (UDP) in the IEEE 802.11e. This is because the TCP acknowledgment packets are queued up at the access points. In this paper, two types of TCP acknowledgment prioritizing schemes are proposed. The proposed schemes improve the overall throughput of TCP while maintaining the QoS requirements. We also analyze the problem of starvation of lower priority traffic and its effects on the performance of lower priority TCP traffic. The proposed dynamic scheme of TCP acknowledgment prioritization aims at improving the throughput of the lower priority TCP traffic under heavy network load while maintaining the QoS requirements of the higher priority traffic. The schemes have been verified through extensive simulation.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband Wireless Access Systems

The success of emerging Broadband Wireless Access Systems (BWASs) will depend, among other factors, on their ability to manage their shared wireless resources in the most efficient way. This is a complex task due to the heterogeneous nature, and hence, diverse Quality of Service (QoS) requirements of different applications that these systems support. Therefore, QoS provisioning is crucial for the success of such wireless access systems. In this paper, we propose a novel downlink packet scheduling scheme for QoS provisioning in BWASs. The proposed scheme employs practical economic models through the use of novel utility and opportunity cost functions to simultaneously satisfy the diverse QoS requirements of mobile users and maximize the revenues of network operators. Unlike existing schemes, the proposed scheme is general and can support multiple QoS classes with users having different QoS and traffic demands. To demonstrate its generality, we show how the utility function can be used to support three different types of traffic, namely best-effort traffic, traffic with minimum data rate requirements, and traffic with maximum packet delay requirements. Extensive performance analysis is carried out to show the effectiveness and strengths of the proposed packet scheduling scheme.     

A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks

In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the location-dependent contention may cause serious unfairness and priority reversal problems. These problems can severely degrade network performance. To the best of our knowledge, so far there is no comprehensive study to fully address all these problems. In this paper, a new busy-tone based medium access control (MAC) scheme supporting voice/data traffic is proposed to address these problems. Via two separated narrow-band busy-tone channels with different carrier sense ranges, the proposed scheme completely resolves the hidden terminal and exposed terminal problems. Furthermore, with the use of transmitter busy-tones in the node backoff procedure, the proposed scheme ensures guaranteed priority access for delay-sensitive voice traffic over data traffic. The priority is also independent of the user locations, thus solving the priority reversal problem. The fairness performance for data traffic in a non-fully-connected environment is also greatly improved (as compared with the popular IEEE 802.11e MAC scheme) without the need for extra information exchanges among the nodes.     

HFC Access Network Design for Switched Broadcast TV Services

The hybrid fiber coax (HFC) is a modern broadband access network, providing advanced interactive services such as Internet access, digital interactive television and cable telephony. The edge costs dominate the cost of launching new services, at the time of deployment (CapEx) as well as for maintenance (OpEx). Therefore next-generation edge devices aim at the convergence of these services and their platforms into a single multi-service infrastructure, thus sharing resources and bandwidth. The focus of this paper is on the HFC access network design for bandwidth-intensive TV services, bringing standard as well as switched broadcast technologies into play. Standard broadcast TV service deployments, offered through the digital video broadcast (DVB) platform, require low installation costs, but the bandwidth consumption increases linearly with the number of available TV channels, even for very unpopular channels. Switched broadcast TV channels, offered on the (Euro-) DOCSIS platform together with other interactive unicast services such as video on demand, are only streamed to a node on the HFC access network if they are requested locally, thus limiting bandwidth consumption for less popular channels. We present an access network design tool, based on an analytical TV traffic model, minimizing the installation cost on the edge devices and study the influence of the most important traffic and content parameters.     

A Distributed Channel Access Scheme with Guaranteed Priority and Enhanced Fairness

Although the IEEE 802.11e enhanced distributed channel access (EDCA) can differentiate high priority traffic such as real-time voice from low priority traffic such as delay- tolerant data, it can only provide statistical priority, and is characterized by inherent short-term unfairness. In this paper, we propose a new distributed channel access scheme through minor modifications to EDCA. Guaranteed priority is provided to real time voice traffic over data traffic, while a certain service time and short-term fairness enhancement are provided to data traffic. We also present analytical models to calculate the percentage of time to serve voice traffic and the achieved data throughput. Both analysis and simulation demonstrate the effectiveness of our proposed scheme.     

Enhancement of QoS support of HCCA schedulers using EDCA function in IEEE 802.11e networks

The IEEE 802.11e standard introduces Quality of Service support for wireless local area networks through two MAC functions: Enhanced Distributed Channel Access (EDCA) and HCF Controlled Channel Access (HCCA). While the former provides prioritized contention-based access to the medium, the latter uses a parameterized contention-free polling scheme. Several studies have proposed enhancements to EDCA or improved scheduling algorithms for HCCA to properly support VBR traffic. However, the cooperation between these functions has only marginally been considered and the solutions vary depending on specific traffic requirements.In this paper we propose a novel approach to address the problem of scheduling VBR traffic streams. Our scheduler, named Overboost, uses HCCA to negotiate a minimum bandwidth and deals with traffic streams that require more bandwidth than the negotiated one by redirecting the excess bandwidth to the EDCA function. An analytical evaluation has been conducted and the results has been corroborated by an extensive set of simulations. They show that the overall scheduler improves the performance with respect to other HCCA schedulers in terms of null rate, throughput, access delay, and queue length.     

基于HFC DOCSIS网络I-VOD的一种实现方法

DOCSIS协议已经成为HFC网络上传输IP数据事实上的全球标准,以DOCSIS协议为基础并充分考虑到用户的优先级水平,提出一种交互式视频点播(I-VOD)的实现原理,为VOD业务和宽带Ca-ble Modem业务的融合提供了一种思路。     

LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks

In multi-hop ad hoc networks, besides collision-free transmissions, channel utilization should be also enhanced due to the scarce bandwidth. In this paper, we propose a learning automat-based adaptive polling scheme for medium access scheduling in clustered wireless ad-hoc networks to enhance the channel utilization. In this scheme, each cluster-head takes the responsibility of coordinating intra-cluster transmissions so that no collisions occur. Taking advantage of learning automaton, each cluster-head learns the traffic parameters of its own cluster members. Cluster members are prioritized based on these traffic parameters. Each cluster-head then takes the traffic parameters into consideration for finding an optimal channel access scheduling within its cluster. By the proposed polling scheme, each cluster member is assigned a portion of bandwidth proportional to its need (i.e., traffic load). The results show that the proposed channel assignment policy considerably improves the channel utilization. Simulation experiments also show the superiority of the proposed polling-based medium access scheme over the existing methods in terms of channel utilization, waiting time for packet transmission, and control overhead.