Sciweavers

5 search results - page 1 / 1
» Stability in Queueing Networks via the Finite Decomposition ...
Sort
View
APJOR
2008
91views more  APJOR 2008»
13 years 5 months ago
Stability in Queueing Networks via the Finite Decomposition Property
Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has t...
Utku Yildirim, John J. Hasenbein
GLOBECOM
2006
IEEE
13 years 11 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Kevin Ross, Nicholas Bambos
ICPR
2000
IEEE
14 years 5 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
INFOCOM
2006
IEEE
13 years 11 months ago
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
12 years 12 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie