Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The 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.  propose bit & subset aving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset aving 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 aving is better (smaller) than that of FFTA.
['Tsung-Hsien Tsai', 'Kuochen Wang', 'Tzu-Yu Chao']
I am writing a research paper on a idea Dynamic flow aggregation in SDNs for application-aware routing
[{"from": "human", "value": "I am writing a research paper on a idea Dynamic flow aggregation in SDNs for application-aware routing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The 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.  propose bit & subset aving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset aving 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 aving is better (smaller) than that of FFTA."}]