Optimal attack and reinforcement of a network
Journal of the ACM (JACM)
Mathematics of Operations Research
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding
On achieving optimal throughput in data networks
On achieving optimal throughput in data networks
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
An information-theoretic view of network management
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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. we 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. Our results will particularly focus on improving throughput and reducing number of retransmissions, better network management by using network coding approach, we also show our experimental setup and experimental results which naturally graph up the network coding in this overloaded era.