具有嵌入式约束资源规划外壳的覆盖网络的智能可扩展路由:基于截止日期的数据包转发案例研究

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI:10.1109/ICCCN.2004.1401597

J. Khan, Nouman Bantan

{"title":"具有嵌入式约束资源规划外壳的覆盖网络的智能可扩展路由:基于截止日期的数据包转发案例研究","authors":"J. Khan, Nouman Bantan","doi":"10.1109/ICCCN.2004.1401597","DOIUrl":null,"url":null,"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","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"15 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Intelligent extensible routing for overlay networks with embedded constraint resource planning shell: a case study with deadline based packet forwarding\",\"authors\":\"J. Khan, Nouman Bantan\",\"doi\":\"10.1109/ICCCN.2004.1401597\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":229045,\"journal\":{\"name\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"volume\":\"15 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2004.1401597\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2004.1401597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种基于自定义准则的快速近线性运行系统，用于数据包转发和路由查找。它提出了基于截止日期线的数据包转发的情况。本系统的设计采用了约束资源规划(CRP)方法进行算法设计。得到的接近最优算法在一个可扩展的CRP外壳内运行，并使用两个可插拔的调度和转发启发式方法来产生接近最优的性能。本文给出了该系统的外壳结构、算法以及基于死线的数据包转发的仿真结果

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)

自引率

0.00%

发文量