完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, YDen_US
dc.contributor.authorWei, HYen_US
dc.contributor.authorWu, KJen_US
dc.date.accessioned2014-12-08T15:44:01Z-
dc.date.available2014-12-08T15:44:01Z-
dc.date.issued2001-04-01en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0140-3664(00)00305-4en_US
dc.identifier.urihttp://hdl.handle.net/11536/29751-
dc.description.abstractIn order to provide different service treatments to individual or aggregated hows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers 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 also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study. (C) 2001 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectclassificationen_US
dc.subjectlayer 4 routeren_US
dc.subjectpacket filteringen_US
dc.subjectlookupen_US
dc.subjectmatchen_US
dc.subjectscalabilityen_US
dc.titleOrdered lookup with bypass matching for scalable per-flow classification in layer 4 routersen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0140-3664(00)00305-4en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume24en_US
dc.citation.issue7-8en_US
dc.citation.spage667en_US
dc.citation.epage676en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000168055200007-
dc.citation.woscount3-
顯示於類別:期刊論文


文件中的檔案:

  1. 000168055200007.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。