A Constraint Resource Planning Algorithm for Deadline based Packet Forwarding for Overlay Networking

J.I. Khan and N. Bantan (USA)

Keywords

Intelligent routing, temporal quality of service.

Abstract

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 near optimal performance. These heuristics execute within a generic shell. In this paper we present the algorithm, the shell architecture, and the simulation results.

Important Links:



Go Back


IASTED
Rotating Call For Paper Image