A CPCH access method for prioritized services in W-CDMA

Common packet channel (CPCH) access is an efficient approach to support packet data transmissions in a wideband code-division multiple-access (W-CDMA) system. This letter introduces a simple access control method for CPCH, which results in higher throughput. This method also provides prioritized services for different traffic classes. Each traffic class is assigned a distinct transmit permission probability that is determined at the new call initiation stage based on the status of CPCH channel occupancy. The differentiated service qualities, which correspond to different transmit permission probabilities, are evaluated in terms of packet blocking rates. The overall system performance is also evaluated in terms of normalized throughput.     

Access scheme for integrated voice/data transmissions over commonpacket channel in 3GPP

In this letter, we propose a flexible channel assignment scheme using preemption as an access method for integrated voice/data transmissions over common packet channel (CPCH) in 3GPP. We analyze the proposed scheme and compare the performance of the proposed scheme with the performance of the basic, channel monitoring, and channel assignment schemes in view of the voice packet dropping probability and the average delay of data packet     

Improved channel assignment scheme with access control for thecommon packet channel in WCDMA systems

We propose a channel assignment scheme with access control for obtaining better system performance within the common packet channel (CPCH) access procedure of wideband code-division multiple-access (WCDMA) systems. The proposed scheme is analyzed taking multiple access interference into consideration and is compared with other schemes in the 3rd Generation Partnership Project (3GPP): the basic scheme, the channel monitoring scheme, and the channel assignment scheme without access control. The results show that the proposed scheme provides high throughput, even under high-loading conditions, since the access control algorithm based on channel load prohibits excessive interference     

The information-theoretic capacity of discrete-time queues

The information-theoretic capacity of continuous-time queues was analyzed recently by Anantharam and Verdu (see ibid. vol.42, p.4-18, 1996). Along similar lines, we analyze the information-theoretic capacity of two models of discrete-time queues. The first model has single packet arrivals and departures in a time slot and independent packet service times, and is the discrete-time analog of the continuous-time model analyzed by Anantharam and Verdu. We show that in this model, the geometric service time distribution plays a role analogous to that of the exponential distribution in continuous-time queues, in that, among all queues in this model with a given mean service time, the queue with geometric service time distribution has the least capacity. The second model allows multiple arrivals in each slot, and the queue is modeled as serving an independent random number of packets in each slot. We obtain upper and lower bounds on the capacity of queues with an arbitrary service distribution within this model, and show that the bounds coincide in the case of the queue that serves a geometrically distributed number of packets in each slot. We also discuss the extremal nature of the geometric service distribution within this model     

Capture division packet access: a new cellular access architecturefor future PCNs

The authors describe a new cellular access architecture, known as capture-division packet access, which is a packet-oriented architecture able to support the constant bit rate traffic and variable bandwidth on demand necessary for multimedia traffic. The approach integrates the multiple access and channel reuse issues to achieve a high degree of spectral efficiency, and presents general advantages even if used for delay-constrained circuit-oriented traffic. Unlike CDMA and TDMA, wherein the effective data rate of each connection is typically a small fraction of the total radio channel allocated for PCN, the CDPA approach allows each user to access the entire channel, if necessary, for brief periods of time (packet access). Spectrum sharing is accomplished by exploiting the different path losses suffered by the various signals as they appear at the base stations (the capture effect), with co-channel interference abated through time diversity (colliding users do not successively retry in the same time interval). Results suggest that abating co-channel interference by random retransmission may be more effective than spatial isolation at cells using the same channel, as is usual in FDMA-TDMA systems     

Efficient QoS support in a slotted multihop WDM metro ring

A novel distributed access protocol for a slotted wavelength-division-multiplexing (WDM) metro ring employing all-optical packet switching and supporting quality-of-service (QoS) classes is presented and analyzed. Since we assume that there are more nodes than available wavelengths in the network, we obtain a scalable multihop WDM ring as underlying network architecture. By dividing each channel into several time slots and further applying destination release and slot reuse, data packets can be efficiently transmitted and received in a statistically multiplexed manner. In our architecture, each node is equipped with one tunable transmitter and one fixed-tuned receiver. Furthermore, as we generally consider so-called a posteriori access strategies, different packet selection schemes are proposed and compared. An analytical model based on the semi-Markov process methodology is developed to quantify the performance of one of these schemes. As a key element of the protocol, an efficient QoS support access mechanism is proposed and its performance is evaluated. The new QoS control scheme adopts a frame-based slot reservation strategy including connection setup and termination, which only slightly increases the signaling and node processing overhead. Thus, an efficient hybrid protocol combining connectionless and connection-oriented packet transmissions is proposed     

A channel reuse strategy with adaptive channel allocation for all-optical WDM networks

The fundamental problems of WDM networks are: (1) high rate of control packet loss and (2) high propagation delay for each (re)transmission. In this paper, we minimize the station randomness to access the control architecture introducing a collisions-free access scheme. We propose a synchronous protocol according which at the end of the propagation delay each station applies a distributed algorithm for packet transmission following the data channel collisions and the receiver collisions avoidance algorithms. We introduce two data transmission stages. The time difference between them is one packet transmission time. At the end of the first stage all data channels are free and can be reused by the remaining data packets during the second stage. The proposed protocol ensures a totally collisions-free performance. The main advantage is that the data channels reuse strategy applied during the second stage provides enhanced transmission probability to the rejected packets during the first stage. This allows the data packets to try retransmission in the same cycle without requiring control packets re-coordination that increases propagation delay. Thus, we achieve large number of data packets transmission, even more than the data channels number, providing throughput improvement and delay reduction, comparing with other studies.     

Design and Analysis of a Channel Access Protocol for WDM-Based Single-Hop Optical Networks*

We propose a channel access protocol for single-hop wavelength division multiplexing (WDM) optical networks. Each node is equipped with a fixed-tuned transmitter, a tunable transmitter, a fixed-tuned receiver, and a tunable receiver. The proposed protocol alleviates the drawbacks of a previous protocol [1], e.g., invalid data transmissions that follows receiver collisions and possible acknowledgment packet collisions with header/data packets, while retaining many advantages. As a result, the network performance in terms of throughput and packet delay is improved. Analytical models based on the timing diagram analysis, the continuous-time Markov chain, and the randomization technique are developed to assess the proposed protocol, and are validated through event-driven simulation. The performance is evaluated in terms of channel utilization, mean packet delay, and packet delay distribution with variations in the number of nodes, the offered traffic, the size of data packets, and the network propagation delay. Through numerical results and simulation studies, we show that the proposed protocol achieves better channel utilization and incurs lower packet delays.     

Performance of the PAC optical packet network

For multiuser packet communications with unpredictable user demands (e.g., in a local or metropolitan area network), coordination and control of access to the frequency-division multiplexing (FDM) channels are difficult. B. Glance (J. Lightwave Technol., vol.10, pp.1323-1328, Sep 1992) proposed using a simple protection-against-collision (PAC) circuit to solve this media access problem and achieve full optical connectivity. The PAC system has the potential to interconnect hundreds of ports, each transmitting at several gigabits per second. Performance aspects of the PAC optical packet network are discussed here. The delay-throughout performance of this network is analyzed for uniform traffic patterns. The results show that in geographically distributed applications the maximum achievable throughput (normalized to the transmission rate) is typically between 0.4 and 0.5 per channel. In a centralized switch the (normalized) maximum achievable throughput can approach 0.8 per channel     

On continuous-time optimal deterministic traffic regulation

We study the continuous-time deterministic traffic regulation problem. We propose a regulation form shown to be the optimal deterministic traffic regulator in the sense that it outputs the most packets while satisfying the constraint on the output process. We further investigate the subtle relation between continuous-time and discrete-time optimal deterministic regulators, and reduce our general regulation form to the known discrete-time optimal deterministic regulator when restricting arrival (departure) instants to integers and packet size to unity. Therefore, by extending traffic-regulation theory to continuous time, our work provides a fundamental framework for future research regarding quality-of-service (QoS) guaranteed network design/analysis in continuous-time.     

Packet Loss Fair Scheduling Scheme for Real‐Time Traffic in OFDMA Systems

In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real‐time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short‐term fairness as well as long‐term fairness for various real‐time traffic.     

A distributed media access protocol for packet radio networks and performance analysis. Part 1: Network capacity

A distributed time-slot assignment protocol is developed for a mobile multi-hop broadcast packet radio network, using time division multiple access channel access and virtual circuit switching. The protocol eliminates the single point failure mode of centralized network management and the delays of centralized processing. It is applicable to the user-to-user communications functions of such systems as the U. S. Army's enhanced position location and reporting system (EPLRS). The important functions of the distributed protocol, including time-slot assignment, virtual circuit set-up, and network synthesis, are identified, and implementing algorithms are presented and verified. The performance analysis of the protocol is divided into two parts. In this paper, Part 1 of the performance analysis, the capacity of a network using this protocol is studied and a tool is developed to design the network capacity by trading off among the network area, the transmission range, and the number of packet radio units. Since these results are not in closed form, numerical results provide insight into these parameters. In Part 2 the network set-up time and network data rate are analysed and a hierarchical architecture for the distributed protocol is proposed and analysed.     

Performance analysis of the IEEE 802.11 MAC protocol for wireless LANs

Wireless local area networks (WLANs) are extremely popular being almost everywhere including business, office and home deployments. The IEEE 802.11 protocol is the dominating standard for WLANs. The essential medium access control (MAC) mechanism of 802.11 is called distributed co‐ordination function (DCF). This paper provides a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay, the packet drop probability and the average time to drop a packet for both basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. We demonstrate that a Markov chain model presented in the literature, which also calculates throughput and packet delay by introducing an additional transition state to the Markov chain model, does not appear to model IEEE 802.11 correctly, leading to ambiguous conclusions for its performance. We also carry out an extensive and detailed study on the influence on performance of the initial contention window size (CW), maximum CW size and data rate. Performance results are presented to identify the dependence on the backoff procedure parameters and to give insights on the issues affecting IEEE 802.11 DCF performance. Copyright © 2005 John Wiley & Sons, Ltd.     

An information-theoretic and game-theoretic study of timing channels

This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for continuous-time or discrete-time packet waveforms. Fluid waveform approximations of each of these classes of waveforms are employed to aid in analysis. Channel capacity is defined and an information-theoretic game based on mutual information rate is studied. Min-max optimal jammers and max-min optimal input processes are sought. Bounds on the min-max and max-min mutual information rates are described, and numerical examples are given. For maximum-delay-constrained (MDC) jammers with continuous-time packet waveforms, saddle-point input and jammer strategies are identified. The capacity of the maximum-delay constrained jamming channel with continuous-time packet waveforms is shown to equal the mutual information rate of the saddle point. For MDC jammers with discrete-time packet waveforms, saddle-point strategies are shown to exist. Jammers which have quantized batch departures at regular intervals are shown to perform well. Input processes with batches at regular intervals perform well for MDC or maximum-buffer-size-constrained jammers.     

Supporting service differentiation in wireless packet networksusing distributed control

This paper investigates differentiated services in wireless packet networks using a fully distributed approach that supports service differentiation, radio monitoring, and admission control. While our proposal is generally applicable to distributed wireless access schemes, we design, implement, and evaluate our framework within the context of existing wireless technology. Service differentiation is based on the IEEE 802.11 distributed coordination function (DCF) originally designed to support best-effort data services. We analyze the delay experienced by a mobile host implementing the IEEE 802.11 DCF and derive a closed-form formula. We then extend the DCF to provide service differentiation for delay-sensitive and best-effort traffic based on the results from the analysis. Two distributed estimation algorithms are proposed. These algorithms are evaluated using simulation, analysis, and experimentation. A virtual MAC (VMAC) algorithm passively monitors the radio channel and estimates locally achievable service levels. The VMAC estimates key MAC level statistics related to service quality such as delay, delay variation, packet collision, and packet loss. We show the efficiency of the VMAC algorithm through simulation and consider significantly overlapping cells and highly bursty traffic mixes. In addition, we implement and evaluate the VMAC in an experimental differentiated services wireless testbed. A virtual source (VS) algorithm utilizes the VMAC to estimate application-level service quality. The VS allows application parameters to be tuned in response to dynamic channel conditions based on “virtual delay curves.” We demonstrate through simulation that when these distributed victual algorithms are applied to the admission control of the radio channel then a globally stable state can be maintained without the need for complex centralized radio resource management     

An expert system-based approach to capacity allocation in amultiservice application environment

The problem of bandwidth allocation for multiservice packet networks is discussed, and an expert system solution approach for solving it is described. The approach requires a minimal amount of processing, is very efficient, and has a fast response time. The implementation is based on modular capacity expansions and a priori limits on the number of connections for each service type. This approach can perform near-optimal capacity allocation in real time by using heuristic knowledge to virtually eliminate the required computations in this process. This implementation strategy ensures that each service demand meets its objectives. Concurrency control of this distributed expert system is considered. The advantages of the implementation in providing the ability to make rational decisions in an environment of uncertainty and imprecision, such as in the presence of nonsystematic overloads and network failures, are discussed     

非时隙CDMA分组网络吞吐量性能分析:统一的方法

CDMA分组网络性能主要受限于信道中同时传输的其它分组的干扰.与时隙CDMA分组网络相比,非时隙CDMA分组网络所受到的干扰情况更加复杂.本文提出了一种非时隙CDMA分组网络的干扰分析模型,并采用递归方式建立了网络吞吐量性能分析的统一方法.在此基础上,分析了网络节点突发固定长度分组和突发可变长度分组两种情况下的网络吞吐量性能,并讨论了扩频增益和分组传输方式对网络性能的影响,给出了相应的数值结果.文章最后进一步讨论了吞吐量的上下界问题.与前人提出的马尔可夫模型相比,采用本文提出的方法可以得到更为准确的吞吐量性能.     

Distributed and Energy-Aware MAC for Differentiated Services Wireless Packet Networks: A General Queuing Analytical Framework

We present a novel queuing analytical framework for the performance evaluation of a distributed and energy-aware medium access control (MAC) protocol for wireless packet data networks with service differentiation. Specifically, we consider a node (both buffer-limited and energy-limited) in the network with two different types of traffic, namely, high-priority and low-priority traffic, and model the node as a MAP (Markovian arrival process)/PH (phase-type)/1/K nonpreemptive priority queue. The MAC layer in the node is modeled as a server and a vacation queuing model is used to model the sleep and wakeup mechanism of the server. We study standard exhaustive and number-limited exhaustive vacation models both in multiple vacation case. A setup time for the head-of-line packet in the queue is considered, which abstracts the contention and the back-off mechanism of the MAC protocol in the node. A nonideal wireless channel model is also considered, which enables us to investigate the effects of packet transmission errors on the performance behavior of the system. After obtaining the stationary distribution of the system using the matrix-geometric method, we study the performance indices, such as packet dropping probability, access delay, and queue length distribution, for high-priority packets as well as the energy saving factor at the node. Taking into account the bursty traffic arrival (modeled as MAP) and, therefore, the nonsaturation case for the queuing analysis of the MAC protocol, using phase-type distribution for both the service and the vacation processes, and combining the priority queuing model with the vacation queuing model make the analysis very general and comprehensive. Typical numerical results obtained from the analytical model are presented and validated by extensive simulations. Also, we show how the optimal MAC parameters can be obtained by using numerical optimization     

A Unified Approach to Local Area Network Interconnection

An approach to local area network interconnection is presented Which combines the advances in static interconnection topologies, demand assignment multiple access protocols, and the availability of high-bandwidth fiber optic channels to create a cost-effective structure capable of interconnecting a large number of LAN's with heavy traffic. This approach is independent of the protocol implemented at each LAN. The structure is based on a hypercube topology where each vertex of the graph represents a LAN. Multiple access channels spanning all dimensional axes are used in this scheme. This approach is compared to a topology with direct point-to-point connections between all nodes sharing a common axis. Through the development of the degree, diameter, average distance, cost, and average packet delay, we show that using fewer high-capacity channels, a LAN interconnection network with excellent performance characteristics can be constructed, able to support a large number of LAN's with heavy traffic at a significant reduction in cost over the point-to-point case. The resulting structure has many of the desirable characteristics for static interconnection networks such as high fault tolerance, totally distributed packet routing in the interconnection network, low average distance for good performance, and low degree, resulting in low cost. For the total number of required LAN nodes and the expected amount of internode traffic, the structure is optimized for minimum cost.