A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
On open shortest path first related network optimisation problems
Performance Evaluation
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
IEEE/ACM Transactions on Networking (TON)
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
New architecture and algorithms for fast construction of hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
Optimal link weights for IP-based networks supporting hose-model VPNs
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Combining quality of services path first routing and admission control to support VoIP traffic
Future Generation Computer Systems
Optimal self-adaptive QoS resource management in interference-affected multicast wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
It is well known that without admission control, network congestion is bound to occur. However, to implement admission control is difficult in IP-based networks, which are constructed out of the end-to-end principle, and semantics of most major signaling protocols can only be interpreted at the edge of the network. Even if routers can perform admission control internally, the path computation and the state updating activities required for setting up and tearing down each flow will overwhelm the network. A new QoS architecture, called a nonblocking network, has been proposed recently, and it requires no internal admission control and can still offer hard QoS guarantees. In this architecture, as long as each edge node admits not more than a specified amount of traffic, the network will never experience link congestion. For multicast networks, the main problem with this approach is low throughput. Conventional tree-based multicast routing algorithms lead to a throughput so low that the nonblocking concept is rendered impractical. In this paper, we show how network coding can solve this problem. We demonstrate that a nonblocking unicast network and a multicast network share the same optimal paths, and that a nonblocking multicast network with network coding can admit the same amount of traffic as a nonblocking unicast network. The above conclusions apply to explicit-routing (MPLS-like) and shortest-path routing (IP-like) networks.