Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, Tsung-Hsienen_US
dc.contributor.authorWang, Kuochenen_US
dc.contributor.authorChao, Tzu-Yuen_US
dc.date.accessioned2017-04-21T06:48:20Z-
dc.date.available2017-04-21T06:48:20Z-
dc.date.issued2016en_US
dc.identifier.isbn978-1-5090-2526-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/136452-
dc.description.abstractThe software defined network (SDN) presents a good opportunity to realize application-aware routing by offering programmability for the network. Due to limited sizes of ternary content addressable memories (TCAMs) in SDN switches, flow aggregation is needed to resolve the flow table overflow problem. We propose bit & subset weaving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset weaving to merge flow entries in each subset of a partition. Comparing with the Fast Flow Table Aggregation (FFTA) scheme [7], the average compression ratio (the average flow aggregation time) of the proposed bit & subset weaving is better (smaller) than that of FFTA.en_US
dc.language.isoen_USen_US
dc.subjectApplication-aware routingen_US
dc.subjectflow aggregationen_US
dc.subjectSDNen_US
dc.titleDynamic Flow Aggregation in SDNs for Application-aware Routingen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2016 10TH INTERNATIONAL SYMPOSIUM ON COMMUNICATION SYSTEMS, NETWORKS AND DIGITAL SIGNAL PROCESSING (CSNDSP)en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.department網路工程研究所zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.contributor.departmentInstitute of Network Engineeringen_US
dc.identifier.wosnumberWOS:000386781300050en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper