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

Abstract

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