Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

Matrix Factorization Techniques for Recommender Systems

This document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions

Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas

A number of algorithmic and protocol assumptions taken for granted in the design of existing wireless communication technologies need to be revisited in extending their scope to the new cognitive radio (CR) paradigm. The fact that channel availability can rapidly change over time and the need for coordinated quiet periods in order to quickly and robustly detect the presence of incumbents, are just some of the examples of the unique challenges in protocol and algorithm design for CR networks and, in particular, in the medium access control (MAC) layer. With this in mind, in this paper we introduce a novel cognitive MAC (C-MAC) protocol for distributed multi-channel wireless networks. C-MAC operates over multiple channels, and hence is able to effectively deal with, among other things, the dynamics of resource availability due to primary users and mitigate the effects of distributed quiet periods utilized for primary user signal detection. In C-MAC, each channel is logically divided into recurring superframes which, in turn, include a slotted beaconing period (BP) where nodes exchange information and negotiate channel usage. Each node transmits a beacon in a designated beacon slot during the BP, which helps in dealing with hidden nodes, medium reservations, and mobility. For coordination amongst nodes in different channels, a rendezvous channel (RC) is employed that is decided dynamically and in a totally distributed fashion. Among other things, the RC is used to support network-wide multicast and broadcast which are often neglected in existing multi-channel MAC protocols. We present promising performance results of C- MAC. We also describe our efforts to implement features of C- MAC in a real CR prototype with Atheros chipset, which currently includes the spectrum sensing module and preliminary features of C-MAC.

C-MAC: A Cognitive MAC Protocol for Multi-Channel Wireless Networks

The network simulator 2 (ns-2) is a popular and powerful simulation tool for the simulation of packet-switched networks, which provides substantial support for simulation of TCP, routing, and MAC protocols over wired and wireless networks, such as wireless LANs, mobile ad hoc networks (MANETs), and satellite communications, etc, and is widely used in both academia and industry. Although many protocol modules have been implemented in the ns-2, the IEEE 802.16 broadband wireless access networks (BWANs) or WiMAX module has not been contributed yet. Thus, in this paper, we present our detailed design and implementation of the WiMAX module based on the IEEE 802.16 standard with the point-to-multipoint (PMP) mode for the ns-2. The implemented module comprises fundamental functions of the service-specific convergence sublayer (CS), the MAC common part sublayer (CPS), and the PHY layer. A simple call admission control (CAC) mechanism and the scheduler are also included in this module.

/pdf/the-design-and-implementation-of-wimax-module-for-ns-2-57yrri3uum.pdf

The design and implementation of WiMAX module for ns-2 simulator

The IEEE 802.11 wireless local area networks (WLANs) standard supports several equal-capacity communication channels which can be simultaneously shared and accessed by mobile stations. In such multichannel communication system, a mobile station basically can transmit on any of these channels based on a suitable access control protocol. However, with the feature of one transceiver per mobile station, the standard restricts mobile stations to operate in one selected channel and the other channel capacities are wasted inevitably. In this paper, we propose a new carrier sense multiple access (CSMA) based protocol, called multichannel access protocol (MAP), to support parallel transmissions in IEEE 802.11 ad hoc WLANs. To realize the proposed MAP protocol over contemporary ad hoc WLANs, the MAP protocol is not only compliant with the IEEE 802.11 standard but also taking one transceiver constrain into consideration. All mobile stations with MAP will contend for channel access right in a dedicated channel during a periodical contention reservation interval (CRI) and then transmit data frames over different channels by a channel scheduling algorithm (CSA). Given a number of requests, the problem of finding a proper schedule for these requests to be served on a multichannel system so that the longest channel busy period is minimal is known to be NP-hard (Hou, et al. 1994). The time complexity of proposed heuristic CSA is O(|X| log |X| + |X|M/sup 2/) where |X| and M denote the number of successful requests in the CRI and the number of available channels respectively. Simulation results show that the proposed MAP protocol with CSA achieves an obviously higher throughput than conventional IEEE 802.11 WLAN with single channel.

/pdf/a-new-multichannel-access-protocol-for-ieee-802-11-ad-hoc-3dl84u0izd.pdf

A new multichannel access protocol for IEEE 802.11 ad hoc wireless LANs

Simultaneous channel accesses from mass machine-type communications (MTC) devices may congest the random-access channels (RACHs) of LTE-A networks. Currently, 3GPP selects extended access barring (EAB) mechanism as the baseline solution to relieve the congestion of RACHs by barring low-priority devices. Different settings of EAB parameters may re-shape the arrival process of MTC traffic and thus, lead to unpredictable performance. This paper presents an analytical model to investigate the performance of the EAB algorithm on the RACHs in LTE-A networks. Computer simulations were conducted to verify the accuracy of the analysis. The optimal values of paging cycle and repetition period of system information block type 14 (SIB14) can then be obtained from the analytical model subject to a target quality-of-service (QoS) constraint.

Modeling and Analysis of an Extended Access Barring Algorithm for Machine-Type Communications in LTE-A Networks

In wired networks, the broadcast data packets can be easily and safely delivered to destinations. Nevertheless, it is a big challenge to transfer the broadcast frames over the IEEE 802.11 based multi-hop ad hoc wireless networks due to the high bit error rate, the high collision probability, and the lake of acknowledgement (ACK). Unfortunately, most of routing protocols need the broadcast function to exchange important information between nodes. From our observations, the efficiency of the routing protocol, such as dynamic source routing (DSR) and ad-hoc on-demand distance vector (AODV), finding the path from source to destination is strongly depending on the supported broadcast scheme in the underlying media access control (MAC) protocol. In this paper, we first investigate the uncertain broadcast problem in the IEEE 802.11 MAC protocol while delivering the necessary broadcast frames. Since no acknowledgement will be sent by any recipient of the broadcast frame in IEEE 802.11 MAC protocol, we propose a highly reliable broadcast scheme to solve such uncertain problem. The proposed scheme, which is still compatible with standard, can efficiently minimize bandwidth consumption as well as propagation delay.

/pdf/a-highly-reliable-broadcast-scheme-for-ieee-802-11-multi-hop-4r4059xxst.pdf

A highly reliable broadcast scheme for IEEE 802.11 multi-hop ad hoc networks

In wireless ad hoc mobile network, a host which desires to communicate with another host may need some intermediate nodes to relay data packets. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with minimum hops approach is often adapted. However, by considering employing the medium access control (MAC) protocol, the minimum transfer delay from source to destination may be achieved by choosing a longer path but with less contention delay. We propose an efficient delay-oriented routing protocol for mobile ad hoc wireless networks. The expected access contention delay of the IEEE 802.11 protocol is analyzed to support the routing decision. Simulation results show that the derived path length in the proposed delay-oriented routing protocol is slightly higher than that of the conventional shortest path with minimum hops approach but it can significantly reduce both the average transfer delay and packet loss rate.

/pdf/a-novel-delay-oriented-shortest-path-routing-protocol-for-fqsrout3qw.pdf

Jenhui Chen

Papers

The design and implementation of WiMAX module for ns-2 simulator

A new multichannel access protocol for IEEE 802.11 ad hoc wireless LANs

Modeling and Analysis of an Extended Access Barring Algorithm for Machine-Type Communications in LTE-A Networks

A highly reliable broadcast scheme for IEEE 802.11 multi-hop ad hoc networks

A novel delay-oriented shortest path routing protocol for mobile ad hoc networks