完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lin, Ying-Dar | |
dc.contributor.author | Wei, Huan-Yun | |
dc.contributor.author | Wu, Kuo-Jui | |
dc.date.accessioned | 2009-06-02T06:19:21Z | |
dc.date.accessioned | 2020-05-25T06:38:15Z | - |
dc.date.available | 2009-06-02T06:19:21Z | |
dc.date.available | 2020-05-25T06:38:15Z | - |
dc.date.issued | 2006-11-17T08:19:04Z | |
dc.date.submitted | 2000-12-08 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/3287 | - |
dc.description.abstract | In order to provide different service treatments to individual or aggregated glows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm can classify packets at a rate of well over 1 million packets per second while scaling to support more than 300K flows. Complexity analysis and experiment measurements are also presented in this study. | |
dc.description.sponsorship | 中正大學,嘉義縣 | |
dc.format.extent | 6p. | |
dc.format.extent | 762065 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2000 ICS會議 | |
dc.subject | classification | |
dc.subject | layer 4 router | |
dc.subject | packet filtering | |
dc.subject | lookup | |
dc.subject | match | |
dc.subject | scalability | |
dc.subject.other | Quality of Service | |
dc.title | Ordered Lookup with Bypass matching for Scalable Per-flow Classification in Layer 4 Routers | |
分類: | 2000年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002000000169.pdf | 744.2 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。