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

国際会議開催報告:2013 IEEE International Symposium on Information Theory

From the Publisher:
Real-Time Systems is both a valuable reference for professionals and an advanced text for Computer Science and Computer Engineering students. 

Real world real-time applications based on research and practice

State-of-the-art algorithms and methods for validation

Methods for end-to-end scheduling and resource management

More than 100 illustrations to enhance understanding

Comprehensive treatment of the technology known as RMA (rate-monotonic analysis) methods

A supplemental Companion Website www.prenhall.com/liu

http://user.it.uu.se/~yi/courses/rts/dvp-rts-08/notes/Course-INFO.pdf

Real-Time Systems

Mathematical programming

Vehicular social network (VSN) is envisioned to serve as an essential data sensing, exchanging and processing platform for the future Intelligent Transportation Systems. In this paper, we aim to address the location privacy issue in VSNs. In traditional pseudonym-based solutions, the privacy-preserving strength is mainly dependent on the number of vehicles meeting at the same occasion. We notice that an individual vehicle actually has many chances to meet several other vehicles. In most meeting occasions, there are only few vehicles appearing concurrently. Motivated by these observations, we propose a new privacy-preserving scheme, called MixGroup, which is capable of efficiently exploiting the sparse meeting opportunities for pseudonym changing. By integrating the group signature mechanism, MixGroup constructs extended pseudonym-changing regions, in which vehicles are allowed to successively exchange their pseudonyms. As a consequence, for the tracking adversary, the uncertainty of pseudonym mixture is accumulatively enlarged, and therefore location privacy preservation is considerably improved. We carry out simulations to verify the performance of MixGroup. Results indicate that MixGroup significantly outperforms the existing schemes. In addition, MixGroup is able to achieve favorable performance even in low traffic conditions.

MixGroup: Accumulative Pseudonym Exchanging for Location Privacy Enhancement in Vehicular Social Networks

We show that given $n$ and $k$, for $q$ sufficiently large, there always exists an $[n, k]_q$ MDS code that has a generator matrix $G$ satisfying the following two conditions: (C1) Sparsest: each row of $G$ has Hamming weight $n - k + 1$; (C2) Balanced: Hamming weights of the columns of $G$ differ from each other by at most one.

Balanced Sparsest Generator Matrices for MDS Codes

Due to the energy security concern, our society is witnessing a surge of EV fleet applications, eg, public EV taxi fleet systems A major issue impeding an even more widespread adoption of EVs is range anxiety, which is due to several factors including limited battery capacity, limited availability of battery charging stations, and long charging time compared to traditional gasoline vehicles By analyzing our accessible real-world EV taxi system-wide datasets, we observe that current EV taxi drivers often suffer from unpredictable, long waiting times at charging stations, due to temporally and spatially unbalanced utilization among charging stations This is mainly because current taxi fleet management system simply rely on taxi drivers to make charging decisions In this paper, In this paper, we develop REC, a Real-time Ev Charging scheduling framework for EV taxi fleets, which informs each EV taxi driver at runtime when and where to charge the battery REC is able to analytically guarantee predictable and tightly bounded waiting times for all EVs in the fleet and temporally/spatially balanced utilization among charging stations, if each driver follows the charging decision made by REC Moreover, REC can further efficiently handle real-life issues, eg, allowing a taxi driver to charge at its preferred charging station while still guaranteeing balanced charging station utilizationWe have extensively evaluated REC using our accessible real-world EV taxi system-wide datasets Experimental results show that REC is able to address the unpredictability and unbalancing issues existing in current EV taxi fleet systems, yielding predictable and tightly bounded waiting times, and equally important, temporally/spatially balanced charging station utilization

REC: Predictable Charging Scheduling for Electric Taxi Fleets

We show that given n and k, for q sufficiently large, there always exists an [n, k]q MDS code that has a generator matrix G satisfying the following two conditions: (C1) Sparsest: each row of G has Hamming weight n - k + 1; (C2) Balanced: Hamming weights of the columns of G differ from each other by at most one.

Balanced Sparsest generator matrices for MDS codes

We study the Relay-based Cooperative Data Exchange (RCDE) problem, where initially each client has access to a subset of a set of $n$ original packets, referred to as their side information, and wants to retrieve all other original packets via cooperation. Unlike traditional Cooperative Data Exchange (CDE), in our proposed relay-based model, clients can only cooperate via a relay. The data exchange is completed over two phases, namely Uploading Phase and Downloading Phase. In the Uploading Phase, the clients will encode the original packets and transmit the coded packets to the relay. In the Downloading Phase, the relay will reencode the received packets and multicast the reencoded packets, each to a subgroup of clients. The coded packets in the two phases are carefully selected so that each client can retrieve all $n$ original packets with minimum total transmission delay, based on its initial side information and on the coded packets it receives from the relay. In addition, we assume that the bandwidths between the relay and different clients are different, and that the upload/download bandwidths between the relay and the same client are also different. We establish a coding scheme that has the minimum total delay and show that it can be found in polynomial time, for sufficiently large underlying fields. We also design a heuristic algorithm that has a low complexity with binary field size. Our simulations show that the performance of the binary solution is very close to that of the optimal solution. All coding schemes considered in this work are scalar.

Delay minimization for relay-based cooperative data exchange with network coding

In this paper, we consider the problem of minimizing the delay for data exchange among a group of wireless clients, where each client initially holds a subset of the packets and needs to get all the packets held by other clients. It is assumed that clients cannot communicate with each another directly, they can only exchange packets through a wireless relay. To minimize the total transmission delay during data exchange process, we need to determine at every client, which packets to be uploaded and how to encode the packets. It is also important for the relay node to decide how to encode multiple packets from different clients and select the transmission rate in the downloading process, such that every client can decode all required packets in shortest delay. We first formulate theoretically the above problem of minimizing the total transmission delay as an integer programming, and show that its complexity is NP hard. We then propose an efficient heuristic algorithm, which consists of two processes: uploading process, i.e., how to select and encode the packets from the clients to the relay, and downloading process, i.e., how the relay encode packets and select transmission rate for broadcast to all clients. For each process, theoretical formulation has been derived to minimize their transmission delay, and efficient algorithms are proposed separately. Finally, simulation results demonstrate the effectiveness of the proposed algorithm in reducing the total data exchange delay.

Zheng Dong

Papers

Balanced Sparsest Generator Matrices for MDS Codes

REC: Predictable Charging Scheduling for Electric Taxi Fleets

Balanced Sparsest generator matrices for MDS codes

Delay minimization for relay-based cooperative data exchange with network coding

Delay Minimization for Relay-Based Cooperative Data Exchange with Network Coding