Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and ma...Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.展开更多
In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in DiffServ domains. In our scheme, the ingress touters perform admissibility test in a fully distributed and parallel fashi...In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in DiffServ domains. In our scheme, the ingress touters perform admissibility test in a fully distributed and parallel fashion for requests based on our resource per-assigning mechanism. Then, we introduce a novel two phase token passing mechanism to adaptively optimize resource per-assigning among contending edge touters in proportion to their traffic. In addition, we adopt a measurement based admission decision-making criterion to gain the benefit of high utilization of statistical multiplexing. Our simulation results indicate that even under very high request load it is possible to perform admission control and resource allocation in parallel without suffering in terms of response time, packet loss rate, or utilization.展开更多
A multiobjective quality of service (QoS) routing algorithm was proposed and used as the QoS-aware path selection approach in differentiated services and multi-protocol label switching (DiffServ-MPLS) networks. It sim...A multiobjective quality of service (QoS) routing algorithm was proposed and used as the QoS-aware path selection approach in differentiated services and multi-protocol label switching (DiffServ-MPLS) networks. It simultaneously optimizes multiple QoS objectives by a genetic algorithm in conjunction with concept of Pareto dominance. The simulation demonstrates that the proposed algorithm is capable of discovering a set of QoS-based near optimal paths within in a few iterations. In addition, the simulation results also show the scalability of the algorithm with increasing number of network nodes.展开更多
A distributed and adaptive framework (DAF) was proposed for provisioning quality of service (QoS) in IPv6 network. In DAF, per-flow admission control and resource reservation, in conjunction with a new IPv6 flow label...A distributed and adaptive framework (DAF) was proposed for provisioning quality of service (QoS) in IPv6 network. In DAF, per-flow admission control and resource reservation, in conjunction with a new IPv6 flow label mechanism, can be performed instantaneously in a fully distributed and independent fashion at the edge of network without hop-by-hop signaling. The flow label helps in resource reservation and packets forwarding for aggregated traffic on an edge-to-edge path basis. In addition, a bounded directional probing technique for DAF was designed to reconfigure resource reservation adaptively between every pair of edge router for aggregated traffic according to the fluctuation of its traffic load. The simulation results show that DAF provides QoS guarantees to individual flows with minimal overhead, as well as keeping the scalability characteristic like DiffServ.展开更多
文摘Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topology-aware overlay multicast over IP multicast networks (TOMIMN) was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topology-aware overlay tree. Through a little modification to protocol independent multicast sparse mode (PIM-SM), a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router's support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.
文摘In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in DiffServ domains. In our scheme, the ingress touters perform admissibility test in a fully distributed and parallel fashion for requests based on our resource per-assigning mechanism. Then, we introduce a novel two phase token passing mechanism to adaptively optimize resource per-assigning among contending edge touters in proportion to their traffic. In addition, we adopt a measurement based admission decision-making criterion to gain the benefit of high utilization of statistical multiplexing. Our simulation results indicate that even under very high request load it is possible to perform admission control and resource allocation in parallel without suffering in terms of response time, packet loss rate, or utilization.
文摘A multiobjective quality of service (QoS) routing algorithm was proposed and used as the QoS-aware path selection approach in differentiated services and multi-protocol label switching (DiffServ-MPLS) networks. It simultaneously optimizes multiple QoS objectives by a genetic algorithm in conjunction with concept of Pareto dominance. The simulation demonstrates that the proposed algorithm is capable of discovering a set of QoS-based near optimal paths within in a few iterations. In addition, the simulation results also show the scalability of the algorithm with increasing number of network nodes.
文摘A distributed and adaptive framework (DAF) was proposed for provisioning quality of service (QoS) in IPv6 network. In DAF, per-flow admission control and resource reservation, in conjunction with a new IPv6 flow label mechanism, can be performed instantaneously in a fully distributed and independent fashion at the edge of network without hop-by-hop signaling. The flow label helps in resource reservation and packets forwarding for aggregated traffic on an edge-to-edge path basis. In addition, a bounded directional probing technique for DAF was designed to reconfigure resource reservation adaptively between every pair of edge router for aggregated traffic according to the fluctuation of its traffic load. The simulation results show that DAF provides QoS guarantees to individual flows with minimal overhead, as well as keeping the scalability characteristic like DiffServ.
