Operating and maintenance for femto network is becoming one of the main challenges for telecommunication operators as the femto base station (BS) is indoor, portable, distributed, switching on and off frequently. Acco...
详细信息
ISBN:
(纸本)9781424436927
Operating and maintenance for femto network is becoming one of the main challenges for telecommunication operators as the femto base station (BS) is indoor, portable, distributed, switching on and off frequently. According to the characteristics of femto network, a management information model (MIM) is proposed to provide information support for management of femto network, including managed objects, management information, measurements and their monitoring granularities. Since the link between femto BS and femto gateway (FB-FBGW) changes dynamically, FB-FBGW model adopts a status attribute to keep instance of the link stable, which would be helpful for operators to aggregate traffic volume over one link conveniently and quickly Based on the MIM, a femto network autonomic configuration management system (FACMS) with its architecture is given. The MIM is validated by illustrating autonomic configuration procedure of femto BS with FACMS. FACMS could fulfill autonomic configuration of femto BS considering radio environments. Comparing with traditional fixed method, FACMS moves the optimization procedure of radio environments ahead to avoid potential interference, which help to improve transmission efficiency and quality of telecommunication services.
distributed Virtual Environments (DVEs) have grown popular in various fields of application. Apart from providing great collaborational opportunities in an immersive setting, large-scale DVEs pose severe scalability c...
详细信息
ISBN:
(纸本)9783642033537
distributed Virtual Environments (DVEs) have grown popular in various fields of application. Apart from providing great collaborational opportunities in an immersive setting, large-scale DVEs pose severe scalability challenges. Although P2P approaches have proven to be effective for tackling many of these issues, still load delay problems remain in regions with high object or avatar density. In this article we present and evaluate a hoarding approach that is suitable to minimize such delays in P2P-based DVEs with a real-time distribution of dynamic data. The prediction of what data shall be hoarded is based on an epidemic aggregation algorithm working solely with local knowledge. Evaluation results that have been obtained using a DVE simulation environment will be presented.
The ever-increasing amount of available information in today's digital society necessitates inline techniques for determining the most relevant content. Collaborative filtering (CF) systems have proven to be an ad...
详细信息
ISBN:
(纸本)9789639799769
The ever-increasing amount of available information in today's digital society necessitates inline techniques for determining the most relevant content. Collaborative filtering (CF) systems have proven to be an adequate means for reducing informational overload and generating useful recommendations. Current systems are predominantly built on centralized or, more recently, structured Peer-to-Peer (P2P) approaches. However, in order to apply collaborative filtering to large-scale distributed virtual environments (DVEs) in unstructured networks with substatially higher user numbers, different approaches are necessary. Within this paper we present a collaborative filtering algorithm for DVEs utilizing epidemic data aggregation based exclusively on local information. Designed to be extremely scalable, it creates recommendations in a transparent way by distributing an accumulated view offavorite ratings to interacting users. The algorithm is intendedfor deployment in the HyperVerse - a self-organizing middleware service for large-scale DVEs - for generating and managing rating predictions ofobject favorites. Evaluation results show that, in terms ofquality, locally aggregated predictions converge well on those obtainedfrom an idealized global view.
Nowadays simulation modeling is applied for solving a wide range of problems. There are simulations which require significant performance and time resources. To decrease overall simulation time a model can be converte...
详细信息
ISBN:
(纸本)9783642032745
Nowadays simulation modeling is applied for solving a wide range of problems. There are simulations which require significant performance and time resources. To decrease overall simulation time a model can be converted to a distributed system and executed on a computer network. The goal of this project is to create a library enabling clear and rapid development parallel discrete event models in AnyLogic. The library is aimed for professionals in computer simulation and helps to reduce code amount. The project includes a research on different synchronization algorithms. In this paper we present techniques which can be used in creating distributed models. We present comparison of a single threaded model with a distributed model implementing optimistic algorithm. The comparison shows a significant improvement in wallclock time achieved by separating the model into independent submodels with minimal communications.
MIMO is a key technology in the fourth generation cellular mobile communication system. Because of channel reuse, it may bring with serious co-channel interference (CCI). In order to reduce such interference, an impro...
详细信息
Modern distributed applications that run on P2P overlays need the overlay to be resilient to failures in the underlying communications network. An example application is that of event dissemination where the P2P overl...
详细信息
ISBN:
(纸本)9783540922940
Modern distributed applications that run on P2P overlays need the overlay to be resilient to failures in the underlying communications network. An example application is that of event dissemination where the P2P overlay (the event broker network) delivers events published by a client to subscribers based on subscription filters. Achieving high availability requires that the overlay be aware of, and utilize the path redundancies in the underlying physical network. In addition, the overlay should be self organizing, as broker nodes may dynamically join or leave the network and centralized control is not an option in large scale networks. In this paper, we present Trimarg, an efficient distributed algorithm for achieving a self organizing overlay with an availability degree of three. Our algorithm is based on a graph theoretic foundation for highly available overlay networks and is designed to handle the concurrency issues of a large scale distributed system. The resulting unstructured P2P overlay ensures 3-degree of availability in the presence of node and link failures in the underlying physical network. We have proved the correctness of the algorithm and analyzed its complexity to show that the time complexity is O(diameter * degree)(2) of the network and the message complexity is O(diameter * degree). Our algorithm is the first of its kind to deal with concurrency issues and self organizing capabilities of the resultant overlay.
Clustering has become a crucial operation in Wireless Sensor Networks (WSNs). Affinity Propagation (AP) is a relatively new clustering technique that has been shown to possess several advantages over long-standing alg...
详细信息
ISBN:
(纸本)9781424453337
Clustering has become a crucial operation in Wireless Sensor Networks (WSNs). Affinity Propagation (AP) is a relatively new clustering technique that has been shown to possess several advantages over long-standing algorithms such as K-means, particularly in terms of quality of clustering and multi-criteria support. However, the original AP algorithm is computationally intensive making it unsuitable for clustering in WSNs. A hierarchical decentralized variation of AP (Hi-WAP) has been recently proposed to reduce the processing cost of AP while minimizing the potentially negative effect of distribution (due to the lack of a global view) on clustering quality. In this paper, we explore the suitability of Hi-WAP for clustering in WSNs. We employ the level of distortion and the processing time as evaluation metrics. We propose an extension to Hi-WAP, termed LAP;Location-aware Affinity Propagation, where clustering is performed while being cognizant of nodes' locations. Simulation results reveal that LAP, in general, outperforms Hi-WAP. We further study the optimization of LAP parameter values with the objective of minimizing processing time while maintaining a desirable low level of distortion.
Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationale This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter ...
详细信息
ISBN:
(纸本)9780769535012
Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationale This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter the route for some traffic. But current approaches with this idea often get such a long route that decrease the quality of service. This paper presents a new flow routing adjustment algorithm which can substantially balance the traffic of network, with delay constrained to some extent. With simulation method, it is proved that, compared with current methods, the new algorithm can improve the throughput of network greatly and at the same time provide quality of service guarantee. Moreover the theoretical analysis shows that the computational complexity of the new algorithm is O(N(2)logN), which is better than that of most current methods.
Recent studies show that introducing DAS into the cellular system can reduce the inter-cell interference and achieves a non-trivial capacity increase over the conventional cellular system. On the other hand, base stat...
详细信息
ISBN:
(纸本)9781424436927
Recent studies show that introducing DAS into the cellular system can reduce the inter-cell interference and achieves a non-trivial capacity increase over the conventional cellular system. On the other hand, base station cooperative processing is explored to address the inter-cell interference mitigation problem in the cellular system. But most of the analytical work is based on the single-user scenario. This paper provides a generalized information theoretic analysis to illuminate the downlink performance limits of DAS in the multi-user cellular system with antenna module cooperative processing. A comparison of several transmit schemes is given: scheduling the best user, scheduling multiple users simultaneously and scheduling multiple best users. It is demonstrated that with simple linear processing at the transmitters scheduling multiple users simultaneously achieves a tremendous system capacity increase over scheduling the best user. This is because antenna module cooperative processing can mitigate the inter-user interference effectively and the spatial degrees of freedom are fully exploited. Furthermore, when the number of users is much larger than the number of remote antenna modules, scheduling multiple best users can attain the multi-user diversity gain which leads to an increase of the sum capacity. These analytical results are verified by Monte Carlo simulations.
The proceedings contain 71 papers. The topics discussed: an energy-efficient broadcast control protocol for wireless sensor networks;data transmission mechanism for survivable sensor networks;preserving relay connecti...
ISBN:
(纸本)9780769537412
The proceedings contain 71 papers. The topics discussed: an energy-efficient broadcast control protocol for wireless sensor networks;data transmission mechanism for survivable sensor networks;preserving relay connectivity and coverage in heterogeneous wireless sensor networks;performance isolation algorithm for shared virtualization storage system;virtual disk image reclamation for software updates in virtual machine environments;data currency in replicated distributed storage system;dynamic grid resource scheduling model using learning agent;group-by query process in middleware of large scale data intensive systems;virtual machine scalability on multi-core processors based servers for cloud computing workloads;a comprehensive evaluation of routing protocols for ordinary and large-scale wireless MANETs;network of multi-agent traffic controllers;application of residuation theory in network calculus;and fast way-prediction instruction cache for energy efficiency and high performance.
暂无评论