Date Added: Dec 2009
Data flow in graphs is one of the most principle challenges faced by computer scientists and mathematicians. The problem of data flow in a graph has many practical applications e.g. routing in internet and wireless networks, where major purpose is to provide quality of service guarantees improved throughput, delay reduction etc. The authors will be using novel technique of network coding to device strategy to achieve theoretically maximum possible data flow in a network. Network is a new paradigm which in contrast to traditional routing allows mixing of data elements. This paper will present the developed algorithms of network coding, their performance analysis, simulation results and gains in terms of quality of service.