Full metadata record
DC FieldValueLanguage
dc.contributor.authorLee, Chun-Liangen_US
dc.contributor.authorLin, Guan-Yuen_US
dc.contributor.authorChen, Yaw-Chungen_US
dc.date.accessioned2017-04-21T06:49:53Z-
dc.date.available2017-04-21T06:49:53Z-
dc.date.issued2010en_US
dc.identifier.isbn978-1-4244-8069-2en_US
dc.identifier.urihttp://hdl.handle.net/11536/134866-
dc.description.abstractPacket classification is essential for supporting advanced network services such as firewall, quality-of-service (QoS), and policy-based routing. The rules used by routers to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. In this paper, we propose an algorithm which can efficiently detect and resolve filter conflicts by using tuple based search. The time complexity of the proposed algorithm is O(nW+S), and the space complexity is O(nW), where n is the number of filters, W is the number of bits in a header field, and S is the number of conflicts. We use the synthetic filter databases generated by ClassBench to evaluate the proposed algorithm. Simulation results show that the proposed algorithm can achieve better performance than the plane-sweep algorithm both in time and space, particularly for databases with larger numbers of conflicts.en_US
dc.language.isoen_USen_US
dc.subjectpacket classificationen_US
dc.subjectconflict detectionen_US
dc.subjecttuple space searchen_US
dc.titleAn Efficient Conflict Detection Algorithm for Packet Classificationen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2ND INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2010), VOLS 1 AND 2en_US
dc.citation.spage56en_US
dc.citation.epage59en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000295921100014en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper