In wireless cellular networks, normally synchronous dedicated channels are used for real time services due to their delay sensitivity. However the increasing demand for high data-rate multimedia real time services has led to the use of asynchronous time shared channels in the forward link for realtime services in 3G wireless networks, such as HSDPA, EV-DO and EV-DV. Strict and different QoS req...

Vehicular Delay-Tolerant Networking (VDTN) was proposed as a new variant of a delay/disruptive-tolerant network, designed for vehicular networks. These networks are subject to several limitations including short contact durations, connectivity disruptions, network partitions, intermittent connectivity, and long delays. To address these connectivity issues, an asynchronous, store-carry-and-forwa...

A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bound...

The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the EarliestDeadline -First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a single scheduler....

We analyze the delay performance of small cell networks operating under random scheduling (RS) and round robin (RR) protocols. Based on stochastic geometry and queuing theory, we derive accurate and tractable expressions for the distribution of mean delay, which accounts for the impact of random traffic arrivals, queuing interactions, and failed packet retransmissions. Our analysis asserts that...

Aggregate scheduling has been proposed as a solution for achieving scalability in largesize networks. However, in order to enable the provisioning of real-time services, such as video delivery or voice conversations, in aggregate scheduling networks, end-to-end delay bounds for single flows are required. In this paper, we derive per-flow end-to-end delay bounds in aggregate scheduling networks ...

The management of Grid resources requires scheduling of both computation and communication tasks at various levels. In this study, we consider the two constituent sub-problems of Grid scheduling, namely: (i) the scheduling of computation tasks to processing resources and (ii) the routing and scheduling of the data movement in a Grid network. Regarding computation tasks, we examine two typical o...

This paper considers the problem of online job scheduling on M identical machines with hard deadlines. The processing time and delay time of a job are known only on its arrival. Jobs are discarded if they do not meet delay time requirement. The objective of the present work is to minimize the number of tardy jobs. A lower bound of competitive ratio when the processing time and delay time are bo...

This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buf...

In this thesis, we present an analytical framework to provide statistical end-ta-end delay guarantees to network traffic with a novel packet scheduling scheme, namely the Global multi-hop Scheduling (GMS). We first introduce background literature, then present the framework and performance analysis of this proposed scheduling mechanism, which considers bandwidth resources at both upstream and d...