In this paper, we consider the problem of fast and efficient dynamic scheduling of bursts that belong to different classes of priority in wavelength-division multiplexing (WDM)based optical burst switching (OBS) networks with limited optical buffers. In OBS networks, control and data components of a burst are sent separately with a time gap to ensure that resources such as wavelengths and fiber...

Designing scheduling algorithms at the medium access control (MAC) layer relies on a variety of parameters including quality of service (QoS) requirements, resource allocation mechanisms, and link qualities from the corresponding layers. In this paper, we present an efficient cross-layer scheduling scheme, namely, Adaptive Token Bank Fair Queuing (ATBFQ) algorithm, which is designed for packet ...

Organizing large scale projects (e.g., Conferences, IT Shows, F1 race) requires precise scheduling of multiple dependent tasks on common resources where multiple selfish entities are competing to execute the individual tasks. In this paper, we consider a well studied and rich scheduling model referred to as RCPSP (Resource Constrained Project Scheduling Problem). The key change to this model th...

Internet performance is tightly related to the properties of TCP and UDP protocols, jointly responsible for the delivery of the great majority of Internet traffic. It is well understood how these protocols behave under FIFO queuing and what the network congestion effects. However, no comprehensive analysis is available when flow-aware mechanisms such as per-flow scheduling and dropping policies...

A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system e ciently. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics a ...

Efficient scheduling is of great significance to rationally make use of scarce satellite resources. Task clustering has been demonstrated to realize an effective strategy to improve the efficiency of satellite scheduling. However, the previous task clustering strategy is static. That is, it is integrated into the scheduling in a two-phase manner rather than in a dynamic fashion, without express...

Link utilization has received extensive attention since data centers become the most pervasive platform for data-parallel applications. A specific job of such applications involves communication among multiple machines. The recently proposed coflow abstraction depicts such communication through a group of parallel flows, and captures application performance through corresponding communication r...

ÐTraditional multiprocessor scheduling schemes have been one of either space-sharing or time-sharing. Space-sharing schemes perform better than time-sharing at low to moderate system loads. However, they have a disadvantage of wasting processing power within partitions at medium to high system loads. Time sharing schemes tend to perform better at medium to high system loads. Almost all the sche...

We introduce and study strongly truthful mechanisms and their applications. We usestrongly truthful mechanisms as a tool for implementation in undominated strategies for sev-eral problems, including the design of externality resistant auctions and a variant of multi-dimensional scheduling.

This paper proposes a distributed manufacturing scheduling framework at the shop floor level. The shop floor is modeled as a collection of multiple workcells, each of which is modeled as a flexible manufacturing system. The framework consists of a distributed shop floor control structure, dynamic distributed scheduling algorithms, multi-agent system modeling of workcell, and service oriented in...