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

Together with an explosive growth of the mobile applications and emerging of cloud computing concept, mobile cloud computing (MCC) has been introduced to be a potential technology for mobile services. MCC integrates the cloud computing into the mobile environment and overcomes obstacles related to the performance (e.g., battery life, storage, and bandwidth), environment (e.g., heterogeneity, scalability, and availability), and security (e.g., reliability and privacy) discussed in mobile computing. This paper gives a survey of MCC, which helps general readers have an overview of the MCC including the definition, architecture, and applications. The issues, existing solutions, and approaches are presented. In addition, the future research directions of MCC are discussed. Copyright © 2011 John Wiley & Sons, Ltd.

A survey of mobile cloud computing: architecture, applications, and approaches

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

The Transmission Control Protocol.

Internet of Things security

We propose an adaptive bandwidth allocation algorithm for reservation protocols to support quality-of-service networking on the future multimedia Internet. QoS design is the fundamental functionality of the next generation IP router to enable differentiated delivery and to guarantee the delivery quality for diverse service traffic. The proposed algorithm called adaptive weighted fair queue (AWFQ) scheduling employs the queue status and priority assignment to determine the bandwidth sharing of various Internet services and to ensure the defined QoS policy is obtained. We propose a smart methodology of distributing the outlink bandwidth in a flexible, fair and prioritized manner to utilize network bandwidth more effectively and efficiently. In simulation, we compare the proposed AWFQ algorithm with priority queue (PQ) and weighted fair queue (WFQ) that are two famous scheduling algorithms in practice. In comparison, we examine their performances in terms of packet loss, bandwidth utilization and queue dynamics to verify our algorithm. We find that the proposed algorithm has the following advantages: 1) improves the bandwidth starvation of low-priority traffic occurring in PQ, 2) has a high bandwidth utilization close to PQ, 3) has a low queue congestion and 4) maintains the fairness of WFQ. Overall, the proposed algorithm not only has an excellent performance close to PQ but also improve the disadvantage of PQ.

An adaptive approach to weighted fair queue with QoS enhanced on IP network

Incentive mechanism for P2P file sharing based on social network and game theory

In recent years, the issue of Vehicular Ad-Hoc Network (VANET) has received great attention, and more and more VANET-related researches have been brought up. Generally speaking, the biggest difference between VANET and traditional Ad-Hoc is the velocity of carriers because in VANET, the velocity of vehicles the carriers is much higher than that of the carriers in traditional Ad-Hoc. Furthermore, it would be a great challenge to forward data efficiently in VANETs. Thus, many researches proposed have focused on the development of Routing Protocols. The main purpose of this paper is to investigate Geographic Position-Based Routing Protocol, which needs Global Position System (GPS) to obtain the positions of vehicles and to enhance the decision-making of data delivery. Therefore, only partial topology information is needed during the decision-making of data delivery for the routing protocol to have better adaptability in high-speed network topology. This paper aims to improve Greedy Perimeter Stateless Routing (GPSR) Protocol and implement our proposed scheme into a complex scenario like urban area. For this reason, with the concept of vector, greedy forwarding mode of GPSR not only concerns the distance to enhance the accuracy of routing data while choosing the next hop, but also, in terms of the intersections in urban area, adds a predictive mode to predict the motions of vehicles at the intersections to improve the efficiency of routing protocol.

A Novel Geographic Routing Strategy over VANET

Due to extensive coverage and domains of cloud computing-based architecture, most users saves and access highly similar data because of user habits and available resources. Supposing the data stored in the storage devices is of high duplication and similarity, the system administrator cannot guarantee that every node (peer) in the cloud computing system can maintain the best status for data integration. Moreover, when the number of nodes keeps increasing, the number of files will be multiplied, which results to not only the system administrator's heavy workload, but also the waste of hardware resources. Finally, the flexibility and quickness of cloud storage system is gone, and what left is a lot of duplicate and redundant data. Therefore, in order to avoid the system burden caused by duplicate data, we propose novel data center management architecture: Index Name Server (INS), which integrates de-duplication and access point selection optimization techniques to enhance the performance of the cloud storage system. With the attempt to attain load balancing, we use several specific INS parameters to dynamically monitor the parameters, like IP information and busy level index, to avoid the network congestion or the long waiting time during data transmission.

Dynamic load balancing mechanism based on cloud storage

Different emerging IEEE 802.15.4 wireless personal area networks (WPANs) are one solution for wireless sensor networks (WSNs), where applications are restricted by low data rate, short transmission distance, and low power consumption. The frame transmission mechanism of the IEEE 802.15.4 standard, which adopts the blind random backoff mechanism, was designed to minimize power consumption. However, it cannot provide satisfactory performance in a realistic hidden-node environment, because it may incur a hidden-node collision chain situation and unexpectedly limit the overall network capacity. For each successful data transmission, any inefficient transmission mechanism will incur prolonged access delay and will consume too much power. Moreover, the current design becomes inefficient as the number of devices significantly increases. As a solution, we propose a new multiple access protocol with improved efficiency at the sublayer between the media access control layer and the physical layer, i.e., a carrier sense multiple access with collision freeze (CSMA/CF) protocol, which comprises a collision resolving scheme and a P-frozen contention strategy. The CSMA/CF protocol can quickly alleviate aggravated collision situations in a hidden-node environment. Such a particular collision phenomenon is denoted as a collision chain problem (CCP). The impact from CCP is thoroughly discussed and analyzed. As confirmed by the results of analysis and performance evaluations, the proposed CSMA/CF protocol can achieve significant performance improvement in energy conservation, access delay reduction, and transmission reliability enhancement.

Wei-Tsong Lee

Papers

An adaptive approach to weighted fair queue with QoS enhanced on IP network

Incentive mechanism for P2P file sharing based on social network and game theory

A Novel Geographic Routing Strategy over VANET

Dynamic load balancing mechanism based on cloud storage

CSMA/CF Protocol for IEEE 802.15.4 WPANs