Home About us Contact
|
Home About us Contact | ||
|
|
||
Scalability Problem (scalability + problem)
Selected AbstractsA peer-to-peer IPTV service architecture for the IP multimedia subsystemINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6-7 2010A. Bikfalvi Abstract During these last years the Internet Protocol Television (IPTV) service and the different peer-to-peer (P2P) technologies have generated an increasing interest for the developers and the research community that find in them the solution to deal with the scalability problem of media streaming and reducing costs at the same time. However, despite of the benefits obtained in Internet-based applications and the growing deployment of commercial IPTV systems, there has been a little effort in combining them both. With the advent of the next-generation-network platforms such as the IP Multimedia Subsystem (IMS), which advocates for an open and inter-operable service infrastructure, P2P emerges as a possible solution in situations where the traditional streaming mechanisms are not possible or not economically feasible. In this paper, we propose an IPTV service architecture for the IMS that combines a centralized control layer and a distributed, P2P-like, media layer that relies on the IMS devices or peers located in the customers' premises to act as streaming forwarding nodes. We extend the existing IMS IPTV standardization work that has already been done in 3GPP and ETSI TISPAN in order to require a minimum number of architectural changes. The objective is to obtain a system with a similar performance to the one in currently deployed systems and with the flexibility of P2P. One of the main challenges is to achieve comparable response times to user actions such as changing and tuning into channels, as well as providing a fast recovery mechanism when streaming nodes leave. To accomplish this we introduce the idea of foster peers as peers having inactive multimedia sessions and reserved resources. These peers are on stand-by until their functionality is required and at that moment, they are able to accept downstream peers at short notice for events requiring urgent treatment like channel changing and recovery. Copyright © 2009 John Wiley & Sons, Ltd. [source] Design and implementation of Anycast communication model in IPv6INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 3 2009Xiaonan Wang The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to distribute members of Anycast groups over global regions. The former brings an Anycast scalability problem and the latter causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet. Therefore, both of the above designs restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed in this paper which solves some existing problems, such as scalability and communication errors between clients and servers. In this paper, the Anycast communication model is analyzed in depth and discussed, and the experimental data of this Anycast communication model demonstrate its feasibility and validity. [source] Scalable and fault-tolerant key agreement protocol for dynamic groupsINTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 3 2006A. Abdel-Hafez With the widespread use of the Internet, the popularity of group communication-based applications has grown considerably. Since most communications over the Internet involve the traversal of insecure networks, basic security services are necessary for these collaborative applications. These security services can be facilitated if the authorized group members share a common secret. In such distributed applications, key agreement protocols are preferred to key distribution protocols. In the past two decades, there have been many proposals for key agreement protocols. Most of these protocols are not efficient and limit the size of the underlying group. In this paper, we consider the scalability problem in group key agreement protocols. We propose a novel framework based on extension of the Diffie,Hellman key exchange protocol. The efficiency of our protocol comes from the clustering of the group members, where the common session key is established collaboratively by all participants. We present the auxiliary protocols needed when the membership changes. We show that our protocol is superior in complexity in both communication and computation overheads required to generate the session key. Copyright © 2006 John Wiley & Sons, Ltd. [source] Grids of agents for computer and telecommunication network managementCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 5 2004M. D. Assunção Abstract The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the amount and diversity of managed equipment. Moreover, the increase in complexity of the services being offered through the networks also contributes to adding extra workload to the management station. The amount of data that must be handled and processed by only one administration point could lead to a situation where there is not enough processing and storage power to carry out an efficient job. In this work we present an alternative approach by creating a highly distributed computing environment through the use of Grids of autonomous agents to analyze large amounts of data, which reduce the processing costs by optimizing the load distribution and resource utilization. Copyright © 2004 John Wiley & Sons, Ltd. [source] | ||||||||||