In this paper we analyze the delay performance of a single user with perfect channel state information transmitting data over a wireless fading channel. We consider a dynamic resource allocation policy that maximizes average capacity by adapting transmission power, as well as a policy that adapts instantaneous bandwidth. Nakagami fading is assumed, and the impact of the fading parameter, m, as well as the channel quality in terms of signal-to-noise ratio on the mean queuing delay of transmitted data is analyzed. We show that resource allocation policies that achieve superiority over competing strategies in terms of maximizing average capacity do not necessarily result in superior delay performance.

In this paper, we explore the applicability of a well known biological modeling technique to the problem of studying dynamic resource allocation in wireless networks. We utilize a variant of Kauffman's NK model for epistatic evolution, where epistasis is taken to be a measure of the degree to which network links share a common resource, for example time or bandwidth. In our model, alleles correspond to bandwidth assignments, and a given genotype can be seen as are source allocation solution applied across the entire network. A genetic algorithm is employed to evaluate the fitness of possible resource allocation solutions. We believe that this work represents an important step in the direction of understanding network dynamics and wireless resource allocation strategies for autonomic networks.

With the increasing popularity of full-duplex, switched Ethernet-a point-to-point technology as opposed to classical CSMA/CD-efforts to standardize a vehicle for flow control at or below the MAC (media access control) sublayer have been initiated. In this paper, the end-to-end transport layer flow control and congestion avoidance mechanisms of TCP, as well as a new hop-by-hop MAC layer flow control being standardized by the IEEE, are considered. Simulation studies are performed to evaluate network performance with and without the explicit congestion indication provided by the MAC layer approach.

In this paper, the modification of a tagged traffic stream due to statistical multiplexing is studied by presenting a numerical approach for the calculation of the tagged delay jitter and interdeparture processes. Both the single- and multiple-node cases are considered. Unlike the past work, the developed approach is applicable under both the standard first come first served (FCFS) policy and a peak-rate enforcing multiplexing policy. The latter policy can be adopted to reshape the tagged traffic stream within the network. Restoring a shaped traffic profile within the network may be necessary to obtain some of the benefits for which the original shaping is carried out at the network edge. This study also provides results and insight regarding the potential gains of reregulation within the network.

Traffic streams-originally shaped to comply with desired traffic descriptors-may suffer substantial distortion within an ATM network due to statistical multiplexing. As a consequence, traffic re-shaping within the network may be necessary. In this work the modification of a tagged traffic stream due to a series of multiplexing operations is studied. The standard FCFS service policy, as well as a peak-rate enforcing multiplexing discipline, are considered. Tagged cell delay, jitter and inter-departure processes are considered for the characterization of the tagged traffic stream.

This paper considers the multiplexing of nondeterministic periodic traffic sources which deliver packets periodically according to an arbitrary i.i.d. batch arrival process. The proposed traffic sources are representative of the packet-stream periodicities commonly found in high-speed packet networks such as ATM. An exact analytical technique, which entails the solution of Markov chains whose dimensions are independent of the periods associated with the input sources, is presented for the study of a finite-capacity multiplexer fed by N of the proposed traffic models. Numerical results indicate that the source periodicities have a significant impact on the multiplexers performance. In fact, for some regions of operating conditions, even a Poisson traffic assumption is shown to provide an extremely pessimistic estimate of the queue performance measured in terms of packet-loss probabilities.>

A discrete-time priority queuing policy is presented and analyzed. The three-queue system provides distinct service strategies, namely, the consistent-gated (c-G), 1-limited (L), and head-of-line (HoL), to each of the queues. The proposed service policy is potentially applicable to the modeling of network resource allocating policies in integrated services communication networks. In particular, it is shown that this queuing system provides an accurate analytical model for a distributed-queue dual-bus (DQDB) station, as well as a means for an appropriate evaluation of the correlation associated with key traffic processes in that network.>

A discrete-time, single server, 3-queue system is presented and analyzed. A distinct service strategy, namely the consistent-gated (c-G), 1-limited (L) and head-of-line (HoL), is applied to each of the queues (c-G/L/HoL policy). It is shown that this queueing system provides for an accurate analytical model for a DQDB station, as well as a means for an approximate evaluation of the correlation associated with key traffic processes in that network. In addition, the developed queueing system could be useful for the modeling of the queueing behavior of an ATM link shared by high-priority, low priority and control traffic. Through an asymptotic analysis under heavy low-priority traffic, the worst case performance for the high priority traffic is determined. Furthermore, it is illustrated that the asymptotic analysis provides for a potentially tight delay bounding technique. Finally, the delay performance of the developed queueing system is compared to that of a similar system in which one of the queues receives 1-limited service and the other two exhaustive (HoL/sup -//L/HoL/sup +/ policy).>