To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequ...To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequent request problem is found in PBMAC, which degrades system performance significantly when the network traffic is heavily loaded. Based on the analysis on subsequent request problem, an Enhance PBMAC （EPBMAC） scheme is proposed, in which complementary probing is devised to solve the problem. Using a new metric of normalized requested equivalent link capacity, the pertbrmance of PBMAC and EPBMAC is analyzed and evaluated. Two implementations are proposed for incremental dcployment. The paper finally introduces evaluation with packet-based simulations. Both analytical and simulation results show the significant improvement in performance.展开更多
A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicas...A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.展开更多
Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandw...Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.展开更多
文摘To provide scalable and simple Quality of Service（QoS） mechanism for multicast services, Probe-Based Multicast Admission Control （PBMAC） scheme was proposed. In this paper, PBMAC is studicd and a so-called subsequent request problem is found in PBMAC, which degrades system performance significantly when the network traffic is heavily loaded. Based on the analysis on subsequent request problem, an Enhance PBMAC （EPBMAC） scheme is proposed, in which complementary probing is devised to solve the problem. Using a new metric of normalized requested equivalent link capacity, the pertbrmance of PBMAC and EPBMAC is analyzed and evaluated. Two implementations are proposed for incremental dcployment. The paper finally introduces evaluation with packet-based simulations. Both analytical and simulation results show the significant improvement in performance.
文摘A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.
基金Supported by China Postdoctoral Science Foundation (No.20030056007).
文摘Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.
