Bounds on average delays and queue size averages and variances in input-queued cell-based switches

Leonardi, E.; Mellia, Marco; Neri, F.; Marsan, Marco Ajmone

doi:10.1109/infcom.2001.916303

Cited by 110 publications

(112 citation statements)

References 18 publications

Supporting

Mentioning

112

Contrasting

Order By: Relevance

“…Stability in this case is identical to the usual notion of stability defined in terms of a vanishing complementary occupancy distribution (see [21,20,14,16,17]). A network of queues is said to be stable if all individual queues are stable.…”

Section: Definitionmentioning

confidence: 94%

“…Our work is inspired by the approach of Tassiulas in [14], where a Lyapunov drift technique is used to develop a throughput optimal link scheduling policy for a multi-hop packet radio network. Further work on Lyapunov analysis is found in the switching and scheduling literature [16][17][18][19].…”

Section: µ(P S)mentioning

confidence: 99%

“…We then use this analysis to construct a more practical and robust strategy which offers similar performance without requiring knowledge of the input and channel statistics. We start by presenting a preliminary lemma which makes use of a well developed theory of Lyapunov drift (see [21,17,18,16,14]). …”

Section: A Stabilizing Policymentioning

confidence: 99%

“…Below we present a simple condition which guarantees network stability and provides a performance bound. The lemma combines the steady state analysis for Lyapunov drift presented in [21] and the delay analysis in [17] into a simple statement useful for stability and performance analysis in our wireless network.…”

Section: A Lyapunov Driftmentioning

confidence: 99%

“…If there is a non-zero probability the system empties 5 , standard Lyapunov drift techniques [21,18,17,14] and renewal theory [24] can be used together with (9) to establish the existence of a steady state unfinished work matrix satisfying the given inequality.…”

Section: Lemma 2 (Lyapunov Drift) If the Lyapunov Function Of Unfinimentioning

confidence: 99%

See 4 more Smart Citations

Dynamic power allocation and routing for time varying wireless networks

Neely¹,

Modiano²,

Rohrs³

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

483

1,000

View full text Add to dashboard Cite

Abstract-We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (λ ij ) that the system can stably support-where (λij) represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed which stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad-hoc wireless network where channel variations are due to user mobility, and compare its performance with the Grossglauser-Tse relay model developed in [13]. I. INTRODUCTIONWireless systems have emerged as a ubiquitous part of modern data communication networks. Demand for these systems continues to grow as applications involving both voice and data expand beyond their traditional wireline service requirements. In order to meet the increasing demand in data rates that are currently being supported by high speed wired networks composed of electrical cables and optical links, it is important to fully utilize the capacity available in wireless systems, as well as to develop robust strategies for integrating these systems into a large scale, heterogeneous data network. Emerging microprocessor technologies are enabling wireless units to be equipped with the processing power needed to implement adaptive coding techniques and to make intelligent decisions about packet routing and resource management. It is expedient to take full advantage of these capabilities by designing efficient network control algorithms.In this paper, we develop algorithms for dynamic routing and power allocation in a wireless network consisting of N power constrained nodes. Time is slotted, and every timeslot the channel conditions of each link randomly change (due to external effects such as fading, user mobility, and/or time varying weather conditions). Multiple data streams X ij (t) randomly enter the system, where X ij (t) represents an exogenous process of packets arriving to node i destined for node j. Packets are dynamically routed from node to node over multi-hop paths using wireless data links.Nodes can transmit data over multiple links simultaneously by assigning power to the link for each node pair (a, b) according to a power matrix P (t) = (P ab (t)), subject to a total power constraint at each node. Transmission rates over all link pairs are determined by the power allocation matrix P (t) and the current channel state S(t) according to a rate-power curve

show abstract

Section: Definitionmentioning

confidence: 94%

Section: µ(P S)mentioning

confidence: 99%

Section: A Stabilizing Policymentioning

confidence: 99%

Section: A Lyapunov Driftmentioning

confidence: 99%

Section: Lemma 2 (Lyapunov Drift) If the Lyapunov Function Of Unfinimentioning

confidence: 99%

See 3 more Smart Citations

Dynamic power allocation and routing for time varying wireless networks

Neely¹,

Modiano²,

Rohrs³

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

483

1,000

View full text Add to dashboard Cite

show abstract

Delay Performance Analysis for an Agile All-Photonic Star Network

Cheng

Bochmann

et al. 2006

NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

In this paper, we study the delay performance of a centrallycontrolled agile all-photonic star WDM network that provides multiplexing in the time domain over each wavelength. We consider two timeslot allocation strategies, First-Fit (FF) and First-Fit+Random (FFR), as well as network scenarios with different propagation delays. Both theoretical analyses and simulation experiments are conducted to evaluate the delay performance of the network. Through analytical and simulation results, we show that allocating residual free bandwidth can significantly improve queuing delay performance under light traffic load while maintaining good delay performance under heavy traffic load, especially for a network scenario with large propagation delays. The results obtained can be used to guide the design of scheduling algorithms especially for large-scale networks.

show abstract

A Multicast FCFS Output Queued Switch without Speedup

Bonuccelli

Urpi

2002

NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. In this paper we propose an architecture for an output queued switch based on the mesh of trees topology. After establishing the equivalence of our proposal with the output queued model, we analyze its features, showing that it merges positive features of the input queued switches (specially their implementability) with all the characteristics typical of output queued ones. Moreover, such an architecture is able to easily and efficiently manage multicast traffic, which is becoming extremely important in networks with traditional communication services integrated in.

show abstract

Bounds on average delays and queue size averages and variances in input-queued cell-based switches

Cited by 110 publications

References 18 publications

Dynamic power allocation and routing for time varying wireless networks

Dynamic power allocation and routing for time varying wireless networks

Delay Performance Analysis for an Agile All-Photonic Star Network

A Multicast FCFS Output Queued Switch without Speedup

Contact Info

Product

Resources

About