Searching for authors named "Nicholas Bambos" – sorted by Relevance.
-
Stationary Dynamics of Maximal Throughput Schedules
- Abstract. In this paper, we study the stationary dynamics of a processing system comprised of several parallel queues and a single server of constant rate. The connectivity of the server to each queue is randomly modulated, taking values 1 (connected) or 0 (severed). At any given time, only the curr
- Add To MetaCart
-
Dynamic Scheduling of Optical Data Bursts in Time-Domain Wavelength Interleaved Networks
- We consider the problem of scheduling bursts of data in an optical network with an ultra-fast tunable laser and a fixed receiver at each node. In [10] we considered the static scheduling problem of meeting demand in the minimal time. Here we substantially extend these results to the case of online,
- Add To MetaCart
-
ON PARALLEL QUEUING WITH RANDOM SERVER CONNECTIVITY AND ROUTING CONSTRAINTS
- We study systems of parallel queues with finite buffers, a single server with random connectivity to each queue, and arriving job flows with random or class-dependent accessibility to the queues+ Only currently connected queues may receive ~preemptive! service at any given time, whereas an arriving
- Add To MetaCart
-
Downlink Scheduling of Heterogeneous Traffic
- Next generation wireless cellular networks will support a variety of quality-of-service (QoS) sensitive applications like streaming multimedia and high-speed data for downlink users. Channel and QoS aware downlink packet scheduling policies are going to play a key role in efficiently utilizing syste
- Add To MetaCart
-
Power Control and QoS Trade-offs for Real-Time
- We study distributed power control for supporting real-time multimedia traffic over multiple access wireless links. The responsive nature of interference observed on wireless links coupled with the absence of a central co-ordinating entity makes distributed design a challenging problem. A trade-off
- Add To MetaCart
-
Projective Cone Schedules in Queueing Structures; Geometry of Packet Scheduling
- We consider a processing system having several queues, where Xq is the workload in queue q. At any point in time, the system can be set to one of several service configurations, which form a set S. When the system is set to service configuration/vector S ∈ S, queue q receives service at rate Sq. It
- Cited by 4 (2 self) – Add To MetaCart
-
Queueing and scheduling in random environments
- We consider a processing system comprised of several parallel queues and a processor, which operates in a time-varying environment that fluctuates between various states or modes. The service rate at each queue depends on the processor bandwidth allocated to it, as well as the environment mode. Each
- Cited by 6 (0 self) – Add To MetaCart
-
The Performance of circuit switching in the Internet
- ii
- Cited by 2 (0 self) – Add To MetaCart
-
Power-Controlled Data Prefetching/Caching in Wireless Packet Networks
- We investigate efficient schemes for data communication from a server to a mobile terminal over a wireless channel of fluctuating quality. A user requests to access various data items on the terminal. If a requested item is found in the local terminal buffer or cache, no access delay is incurred. If
- Cited by 9 (0 self) – Add To MetaCart
-
Wireless Packet Scheduling with Deadlines
- Third generation (3G) of wireless communication networks aim to provide quality-of-service (QoS) sensitive services to downlink users. Amongst these are real-time multimedia services like videoconferencing and live media streaming, where the packets to be delivered to the user have deadlines asso
- Cited by 2 (1 self) – Add To MetaCart

