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

Author

Khan, Javed I. ; Bantan, Nouman

Author_Institution

Dept. of Comput. Sci., Kent State Univ., OH

fYear

2004

fDate

11-13 Oct. 2004

Firstpage

93

Lastpage

100

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

Keywords

intelligent networks; linear systems; optimisation; quality of service; scheduling; telecommunication network planning; telecommunication network routing; admission control; deadline based packet forwarding; embedded constraint resource planning shell; forwarding heuristic; intelligent extensible routing; linear run-time system; near-optimum algorithm; optimization criteria; overlay network; quality of service; scheduling heuristic; temporal QoS; Admission control; Algorithm design and analysis; Artificial intelligence; Communication system traffic control; Computer aided software engineering; Intelligent networks; Quality of service; Routing; Scheduling algorithm; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2004. ICCCN 2004. Proceedings. 13th International Conference on

Conference_Location

Chicago, IL

ISSN

1095-2055

Print_ISBN

0-7803-8814-3

Type

conf

DOI

10.1109/ICCCN.2004.1401597

Filename

1401597