We consider the tradeoffs between packet delay guarantees and per-timeslot computation complexity in an packet switch operating under the crossbar constraint. It is well known that scheduling packets every timeslot according to a Maximum Weight Matching (MWM) achieves 100% throughput. This algorithm ensures average packet delay is within O(n) timeslots (where n is the number of input ports of t...

Base station schedulers in 3G and evolving 4G cellular systems use knowledge of the time-varying channel conditions of mobile users to exploit the multiuser diversity inherent in wireless networks. Although such opportunistic schedulers significantly improve the system throughput by scheduling users when their channel conditions are most favorable, they could degrade the user experience as a re...

Routing is one of the most challenging problems in Delay-Tolerant Networks (DTNs) due to network partitioning and intermittent connectivity. Most existing protocols are based on unlimited bandwidth and buffer size. Previous protocols based on limited bandwidth or buffer size (e.g., MaxProp, RAPID, etc) only consider the scenario that each node has at most one contact opportunity during any time...

this research, for the first time presents the flexible flow shop model of scheduling method for considering runway assignment and operations planning together. one of the advantages of the developed model is considering the procedures of air routes in terminal airspace and separation between consecutive aircraft which is very similar to the real world condition. there are different objective f...

With recent developments in terrestrial wireless networks and advances in acoustic communications, multichannel technologies have been proposed to be used in underwater networks to increase data transmission rate over bandwidth-limited underwater channels. Due to high bit error rates in underwater networks, an efficient error control technique is critical in the logical link control (LLC) subla...

Cloud computing is a promising solution to provide the resource scalability dynamically. In order to support large scale workflow applications, we present Nuts-LSWAP which is implementation for Cloud workflow. Then, a novel Min-cost with delay scheduling algorithm is presented in this paper. We also focuses on the global scheduling including genetic evolution method and other scheduling methods...

A wide range of emerging real-time services (e.g. VoIP, video conferencing, video-on-demand) require different levels of Quality of Services (QoS) guarantees over wireless networks. Scheduling algorithms play a key role in meeting these QoS requirements. A distinction of QoS guarantees is made between deterministic and statistical guarantees. Most of research in this area have been focused on d...

In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a flow. We define work-conserving generalized Virtual Clock, Packet-byPacket Generalized Processor Sharing, and Self-Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow. We also define sched...

Environment monitoring is performed using the sensor devices. Wireless Sensor Network (WSN) is constructed with a set of data collection units. Base station, sinks and sensor devices are used in the WSN. Power resources, bandwidth and storages are the limitations of the sensor devices. Sink nodes are used to collect data from a group of sensor devices. Many to one traffic pattern based data col...

Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive scheduling can perform better than preemptive scheduling in the worst case in terms of task schedulability, under certain circumstances. We derive a worst-case delay bound for tasks scheduled using non-preemptive scheduling in a distributed system, where the task flow paths form a directed acyclic...