Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Reducing packet latency is an important require- ment in embedded networks. Source routing can be used to reduce processing delay at intermediate nodes and thereby reduce the overall packet latency. Hover source routing is not scalable which makes it unsuitable for larger networks. The addition of the source route to every packet reduces the system goodput (application level throughput). Further, source routes ignore dynamic network conditions which might lead to routing failures. ,  propose strategies to counter these problems.  propose a topology encoding scheme that reduces the overhead and makes source routing scalable.  propose a lazy correction scheme that makes it take cognizance of dynamic network conditions. Through simulations on reasonably large sized network with realistic models for traffic and failure,  show that source routing is indeed usable in practical scenarios. I. INTRODUCTION Wired embedded network systems (EmNets), including sen- sor networks, distributed control applications, and ubiquitous computing environments, often have strict latency require- ments.  define network latency as the one-way delay incurred by a packet from the time when it is transmitted by the source to the time when it is received by the destination. A major component of the network latency using dynamic routing protocol is the packet processing at each intermediate node. Traversing the different layers of the network stack as ll as the routing table lookup at each hop takes up a non- trivial amount of time.  simulated a 4000 node random graph with 100,000 packets routed beten 600,000 randomly chosen pairs of nodes.  injected 500 failed links in a manner that 50% of the chosen routes have at least one failed link along them. An incredible 93% of the route lookups turned out to be redundant. To understand the reason behind this, let us consider the case where a single link fails. Let there be a source node A and a destination node B. Let the link beten nodes C and D fail. Let Pold and Pnew be the paths beten A and B before and after the link fails. If CD / ∈ Pold, then Pold = Pnew and all intermediate lookups will be redundant. Let us now consider the case where CD is in Pold. Then obviously, Pold �= Pnew. As the link state information propagates from C and D to the rest of the network, all nodes (at any given time) can essentially be divided into two regions: nodes that have received the update and have the nest routes belong to the fresh region; all others belong to the stale region. If
['Arijit Ghosh', 'Tony Givargis']
I am writing a research paper on a idea Source Routing Made Practical in Embedded Networks
[{"from": "human", "value": "I am writing a research paper on a idea Source Routing Made Practical in Embedded Networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Reducing packet latency is an important require- ment in embedded networks. Source routing can be used to reduce processing delay at intermediate nodes and thereby reduce the overall packet latency. Hover source routing is not scalable which makes it unsuitable for larger networks. The addition of the source route to every packet reduces the system goodput (application level throughput). Further, source routes ignore dynamic network conditions which might lead to routing failures. ,  propose strategies to counter these problems.  propose a topology encoding scheme that reduces the overhead and makes source routing scalable.  propose a lazy correction scheme that makes it take cognizance of dynamic network conditions. Through simulations on reasonably large sized network with realistic models for traffic and failure,  show that source routing is indeed usable in practical scenarios. I. INTRODUCTION Wired embedded network systems (EmNets), including sen- sor networks, distributed control applications, and ubiquitous computing environments, often have strict latency require- ments.  define network latency as the one-way delay incurred by a packet from the time when it is transmitted by the source to the time when it is received by the destination. A major component of the network latency using dynamic routing protocol is the packet processing at each intermediate node. Traversing the different layers of the network stack as ll as the routing table lookup at each hop takes up a non- trivial amount of time.  simulated a 4000 node random graph with 100,000 packets routed beten 600,000 randomly chosen pairs of nodes.  injected 500 failed links in a manner that 50% of the chosen routes have at least one failed link along them. An incredible 93% of the route lookups turned out to be redundant. To understand the reason behind this, let us consider the case where a single link fails. Let there be a source node A and a destination node B. Let the link beten nodes C and D fail. Let Pold and Pnew be the paths beten A and B before and after the link fails. If CD / \u2208 Pold, then Pold = Pnew and all intermediate lookups will be redundant. Let us now consider the case where CD is in Pold. Then obviously, Pold \ufffd= Pnew. As the link state information propagates from C and D to the rest of the network, all nodes (at any given time) can essentially be divided into two regions: nodes that have received the update and have the nest routes belong to the fresh region; all others belong to the stale region. If"}]