A CONSTRAINT RESOURCE PLANNING ALGORITHM FOR DEADLINE BASED PACKET FORWARDING FOR OVERLAY NETWORKING

This paper presents a fast near linear run-time algorithm for deadline-satisfying packet forwarding and route lookup. This algorithm has been designed after a Constraint Resource Planning (CRP) methodology of approximation algorithm design. The algorithm uses scheduling and forwarding heuristics to produce nearoptimal performance. These heuristics execute within a generic shell. In this paper we present the algorithm, the shell architecture, and the simulation results.

[1]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[2]  Jonathan M. Smith.  Programmable Networks: Selected Challenges in Computer Networking , 1999, Computer.

[3]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[4]  Douglas S. Reeves,et al.  Routing and admission control algorithms for multimedia traffic , 1995, Comput. Commun..

[5]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[6]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[7]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.

[8]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[9]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

[10]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[11]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[12]  George C. Polyzos,et al.  Scheduling for quality of service guarantees via service curves , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[13]  Javed I. Khan,et al.  A framework for building complex netcentric systems on Active Network , 2002, Proceedings DARPA Active Networks Conference and Exposition.

[14]  Parameswaran Ramanathan,et al.  Delivery of time-critical messages using a multiple copy approach , 1992, TOCS.

[15]  David Y. Y. Yun,et al.  A Planning/Scheduling Methodology for the Constrained Resource Problem , 1989, IJCAI.

[16]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.