Sciweavers

45 search results - page 2 / 9
» Scheduling Communication Requests Traversing a Switch: Compl...
Sort
View
ISCC
2008
IEEE
13 years 11 months ago
Scheduling high-rate sessions in Fractional Lambda Switching networks: Algorithm and analysis
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
Thu-Huong Truong, Mario Baldi, Yoram Ofek
INFOCOM
2002
IEEE
13 years 10 months ago
Guaranteed Scheduling for Switches with Configuration Overhead
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
Brian Towles, William J. Dally
ICDCS
2000
IEEE
13 years 9 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
NPC
2004
Springer
13 years 10 months ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park
INFOCOM
2006
IEEE
13 years 11 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer