Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The end-to-end communication problem is a protocol design problem, for sending a packet from a specified source-node s to a specified target-node t, through an unreliable asynchronous memoryless communication network. The protocol must insure reception and termination. ,  measure the complexity of the protocol in term of header size, i.e., the quantity of information that must be attached to the packets to insure their delivery.  show that headers of Ω(log log τ) bits are required in every network, where τ denotes the treewidth of the network. In planar networks, Ω(log τ) bits are required.
['Pierre Fraigniaud', 'Cyril Gavoille']
I am writing a research paper on a idea Header-size lower bounds for end-to-end communication in memoryless networks
[{"from": "human", "value": "I am writing a research paper on a idea Header-size lower bounds for end-to-end communication in memoryless networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The end-to-end communication problem is a protocol design problem, for sending a packet from a specified source-node s to a specified target-node t, through an unreliable asynchronous memoryless communication network. The protocol must insure reception and termination. ,  measure the complexity of the protocol in term of header size, i.e., the quantity of information that must be attached to the packets to insure their delivery.  show that headers of \u03a9(log log \u03c4) bits are required in every network, where \u03c4 denotes the treewidth of the network. In planar networks, \u03a9(log \u03c4) bits are required."}]