Intelligent extensible routing for overlay networks with embedded constraint resource planning shell: a case study with deadline based packet forwarding

This paper presents a fast near linear run-time system for customizable criteria based packet forwarding and route lookup. It presents the case for deadline line based packet forwarding. This system has been designed after the constraint resource planning (CRP) methodology for algorithm designs. The resulting near-optimum algorithm operates within an extensible CRP shell and uses two pluggable scheduling and forwarding heuristics to produce near-optimal performance. In this paper, we present the shell architecture, the algorithm, and the simulation results of this system for dead-line based packet forwarding

[1]  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.

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

[3]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

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

[5]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 1998, SPAA.

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

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

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

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

[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]  David Y. Y. Yun,et al.  A Planning/Scheduling Methodology for the Constrained Resource Problem , 1989, IJCAI.

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

[14]  Javed I. Khan,et al.  A CONSTRAINT RESOURCE PLANNING ALGORITHM FOR DEADLINE BASED PACKET FORWARDING FOR OVERLAY NETWORKING , 2002 .

[15]  Deborah Estrin,et al.  RSVP: a new resource ReSerVation Protocol , 1993 .

[16]  T. V. Lakshman,et al.  High-speed policy-based packet forwarding using efficient multi-dimensional range matching , 1998, SIGCOMM '98.

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

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