摘要 :
Multicast communications has been expected as an effective way to disseminate the same information to potentially large number of receivers. IP multicast is a well-known multicast protocol in TCP/IP protocol suits. However, IP mul...
展开
Multicast communications has been expected as an effective way to disseminate the same information to potentially large number of receivers. IP multicast is a well-known multicast protocol in TCP/IP protocol suits. However, IP multicast has several technical problems to be resolved until it is widely deployed in the Internet. This paper first explains current status of IP multicast and discusses its technical issues. And the paper surveys impor-tant approaches to these technical issues, especially with focusing on service model, reliable multicast, congestion control and application-layer multicast.
收起
摘要 :
A novel multicast mode, which is called serial multicast mode (SMM), is proposed in this letter. It can realize the storage, duplication, and serial export of the input optical multicast packet in all-optical networks. Moreover, p...
展开
A novel multicast mode, which is called serial multicast mode (SMM), is proposed in this letter. It can realize the storage, duplication, and serial export of the input optical multicast packet in all-optical networks. Moreover, performance analyses of SMM compared with parallel multicast mode are also provided in this letter
收起
摘要 :
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust interdomain multicast routing protocol. Application-level multicast becomes a p...
展开
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust interdomain multicast routing protocol. Application-level multicast becomes a promising alternative. Many overlay multicast systems have been proposed in recent years. However, they are insufficient in supporting applications that require any-source multicast with varied host capacities and dynamic membership. In this paper, we propose two capacity-aware multicast systems that focus on host heterogeneity, any source multicast, dynamic membership, and scalability. We extend Chord and Koorde to be capacity-aware. We then embed implicit degree-varying multicast trees on top of the overlay network and develop multicast routines that automatically follow the trees to disseminate multicast messages. The implicit trees are well balanced with the workload evenly spread across the network. We rigorously analyze the expected performance of multisource capacity-aware multicasting, which was not thoroughly addressed in any previous work. We also perform extensive simulations to evaluate the proposed multicast systems.
收起
摘要 :
We present a destination-driven algorithm that optimizes for applications, such as group video or teleconferencing, that require multicast trees with low total cost. The destination-driven algorithm uses a greedy strategy based on...
展开
We present a destination-driven algorithm that optimizes for applications, such as group video or teleconferencing, that require multicast trees with low total cost. The destination-driven algorithm uses a greedy strategy based on shortest-path trees and minimal spanning trees but biases routes through destinations. The performance of the algorithm is analyzed through extensive simulation and compared with several Steiner tree heuristics and the popular shortest-path tree (SPT) method. The algorithm is found to produce trees with significantly lower overall cost than the SPT while maintaining reasonable per-destination performance. Its performance also compares well with other known Steiner heuristics. Moreover, the algorithm does not suffer from high complexity common to most Steiner tree heuristics and builds a route by querying only incident links for cost information.
收起
摘要 :
Secure group communication is important for applications such as pay-per-view. Other authors have proposed the key tree approach to distribute a shared group key in a way such that the rekeying cost scales linearly with the logari...
展开
Secure group communication is important for applications such as pay-per-view. Other authors have proposed the key tree approach to distribute a shared group key in a way such that the rekeying cost scales linearly with the logarithm of the group size for a join or depart request. The efficiency of the key tree approach depends critically on whether the key tree remains balanced. Periodic rebalancing can be used to balance the key tree whenever it becomes unbalanced but this adds extra costs to the network. In this paper, we present two Merging Algorithms suitable for batch join events. As the multicast session consists of other events as well, we then show how we can extend our algorithms into existing work to minimise the maximum difference in height without adding extra network costs. Simulation results show our Merging Algorithms not only balance the key tree but their rekeying costs are lower compared to existing algorithms. (C) 2006 Elsevier Ltd. All rights reserved.
收起
摘要 :
Due to increased demand for video data by heterogeneous Internet users, the demand of multicasting is increasing day by day. Multicasting is an efficient group communication technique, which is widely used in various applications ...
展开
Due to increased demand for video data by heterogeneous Internet users, the demand of multicasting is increasing day by day. Multicasting is an efficient group communication technique, which is widely used in various applications such as bloggers, Internet group, forums, conferences, YouTube and online TV. Because of the heterogeneous nature of receivers, the network become congested that results in high packet loss, less throughput and reduced QoS. The multicast congestion control seems to be an effective solution to tackle the congestion issue in which the reception rate is adjusted according to the feedback of receivers. This paper provides a new congestion control scheme for multicast communication called Extended Logarithmic Increase and Multiplicative Decrease (ELIMD) to reduce packet loss, increase throughput, QoS and fairness during group communication. The entire research work is classified and elaborated in the key components namely architecture, newly designed equations, and flow charts. Experimental validation in NS-2.35 has affirmed the efficiency of the proposed scheme ELIMD against the existing schemes.
收起
摘要 :
Jia (1995) proposed a multicast scheme, using propagation trees, to ensure the total ordering (including causal ordering) delivery of messages for group communication. Our study indicates that causal relation between some messages...
展开
Jia (1995) proposed a multicast scheme, using propagation trees, to ensure the total ordering (including causal ordering) delivery of messages for group communication. Our study indicates that causal relation between some messages may not actually be presented in this protocol. We then present a revised approach for closed group communication.
收起
摘要 :
Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate ‘dynamic...
展开
Existing content caching mechanisms are predominantly geared towards easy-access to content that is static once created. However, numerous applications, such as news and dynamic sources with time-varying states, generate ‘dynamic’ content where new updates replace previous versions. This motivates us in this work to study the freshness-driven caching algorithm for dynamic content, which accounts for the changing nature of data content. In particular, we provide new models and analyses of the average operational cost both for the single and distributed edge caching scenarios. In both scenarios, we characterize the performance of the optimal solution and develop algorithms to select the content and the update rate that the user(s) must employ to have low-cost access to fresh content. Moreover, our work reveals new and easy-to-calculate key metrics for quantifying the caching value of dynamic content in terms of their refresh rates, popularity, number of users in the distribute edge caching group, and the fetching and update costs associated with the optimal decisions. We compare the proposed freshness-driven caching strategies with benchmark caching strategies like cache the most popular content. Results demonstrate that freshness-driven caching strategies considerably enhance the utilization of the edge caches with possibly orders-of-magnitude cost reduction. Furthermore, our investigations reveal that the distributed edge caching scenario, benefiting from the multicasting property of wireless service to update the cached content, can be cost-effective compared to the single edge caching, as the number of edge caches increases.
收起
原文获取