DIMACS Workshop on Competitive Algorithms for Packet Scheduling, Buffering and Routing in the Internet

July 6 - 8, 2011
DIMACS Center, CoRE Building, Rutgers University

Organizers:

Alex Kesselman, Google

Alex Lopez-Ortiz, University of Waterloo, alopez-o at uwaterloo.ca

Yishay Mansour, Tel Aviv University

Adi Rosen, CNRS, Paris

Workshop Program:

Wednesday, July 6, 2011			

 8:15 -  8:50  Breakfast and Registration

 8:50 -  9:00  Welcome and Opening Remarks
               Rebecca Wright, DIMACS Deputy Director		

 9:00 - 10:00  An Almost Tight Bound for Reordering Buffer Management
               Harald Raecke, University of Warwick

10:00 - 10:30  Online Set Packing and Competitive Scheduling of Multi-Part Tasks
               Dror Rawitz, Tel Aviv University	

10:30 - 11:00  Coffee break		

11:00 - 12:00  Competitive Analysis of Buffer Overflows
               Boaz Patt-Shamir, Tel Aviv University	

12:00 -  2:00  Lunch		

 2:00 -  3:00  Competitive Buffer Management for Shared-Memory Switches
               Alex Kesselman, Google

 3:00 -  3:30  An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
               Marcin Bienkowski, University of Wroclaw, Poland

 3:30 -  4:10  Coffee break		

 4:10 -  4:40  Competitive Strategies for Routing Flow Over Time
               Lisa K. Fleischer, Dartmouth College

 4:40 -  5:20  Online Packet-Routing in Grids with Bounded Buffers
               Guy Even, Tel Aviv University

 5:20 -  7:00  Dinner: participants on their own		

			
Thursday, July 7, 2011			

 8:15 -  9:00  Breakfast and Registration		

 9:00 -  9:30  Providing Performance Guarantees in Multipass Network Processors
               Gabriel Scalosub, Ben Gurion University

 9:30 - 10:00  Oblivious Routing in the L_p-norm
               Matthias Englert, University of Warwick

10:00 - 10:45  Coffee break		

10:45 - 11:45  Energy-aware Scheduling Protocols for Network Stability
               Lisa Zhang, Bell Laboratories	

11:45 - 12:15  The BISMark Project: Broadband Measurements from the Network Gateway
               Nick Feamster, Georgia Tech	

12:15 -  2:15  Lunch		

 2:15 -  3:15  Discussion and Open problems

 3:15 -  4:10  Coffee break		

 4:10 -  4:40  A Competitive Strategy for Routing Flow Over Time
               Umang Bhaskar, Dartmouth

 4:40 -  5:10  Space-Constrained Interval Selection
               Yuval Emek, ETH

 6:00 -  8:00  Dinner at DIMACS center		
			

Friday, July 8, 2011			

 8:15 -  9:00  Breakfast and Registration	
	
 9:00 -  9:30  Online algorithms for Generalized Caching
               Nikhil Bansal, IBM T.J. Watson	

 9:30 - 10:00  Packet scheduling in unstructured OFDM-based wireless networks
               Matthew Andrews, Bell Labs	

10:00 - 10:30  FPTAS for global packet routing and block-structured models
               Michael D. Grigoriadis, Rutgers University

10:30 - 11:00  Coffee break		

11:00 - 12:00  TBA
               Yossi Azar, Tel-Aviv University

12:00 -  1:00  Lunch

 1:00          Workshop Ends

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage