Search results for "Balancing"
showing 10 items of 105 documents
Distributing Storage in Cloud Environments
2013
Cloud computing has a major impact on today's IT strategies. Outsourcing applications from IT departments to the cloud relieves users from building big infrastructures as well as from building the corresponding expertise, and allows them to focus on their main competences and businesses. One of the main hurdles of cloud computing is that not only the application, but also the data has to be moved to the cloud. Networking speed severely limits the amount of data that can travel between the cloud and the user, between different sites of the same cloud provider, or indeed between different cloud providers. It is therefore important to keep applications near the data itself. This paper investig…
Performance analysis of user-centric SBS deployment with load balancing in heterogeneous cellular networks: A Thomas cluster process approach
2020
Abstract In conventional heterogeneous cellular networks (HCNets), the locations of user equipments (UEs) and base stations (BSs) are modeled randomly using two different homogeneous Poisson point processes (PPPs). However, this might not be a suitable assumption in case of UE distribution because UE density is not uniform everywhere in HCNets. Keeping in view the existence of nonuniform UEs, the small base stations (SBSs) are assumed to be deployed in the areas with high UE density, which results in correlation between UEs and BS locations. In this paper, we analyse the performance of HCNets with nonuniform UE deployment containing a union of clustered and uniform UE sets. The clustered UE…
Performance comparison of container orchestration platforms with low cost devices in the fog, assisting Internet of Things applications
2020
Abstract In the last decade there has been an increasing interest and demand on the Internet of Things (IoT) and its applications. But, when a high level of computing and/or real time processing is required for these applications, different problems arise due to their requirements. In this context, low cost autonomous and distributed Small Board Computers (SBC) devices, with processing, storage capabilities and wireless communications can assist these IoT networks. Usually, these SBC devices run an operating system based on Linux. In this scenario, container-based technologies and fog computing are an interesting approach and both have led to a new paradigm in how devices cooperate, improvi…
Cell Association With Load Balancing in Nonuniform Heterogeneous Cellular Networks: Coverage Probability and Rate Analysis
2017
To meet the ever-growing traffic demand and address the cell capacity shortage problem, associating end users to various tiers of cells in a multitier cellular network appears to be a promising approach. In this paper, we consider a nonuniform heterogeneous cellular network (NuHCN) and propose a cell association scheme that selectively mutes certain small-cell base stations (BSs) and covers end users by cell range extension (via cell biasing) for achieving load balancing. The envisaged NuHCN is comprised of two tiers of BSs, i.e., macro- and small-cell BSs, deployed according to three independent homogeneous Poisson point processes for BSs and end users, respectively. Accordingly, the avail…
Channel-dependent load balancing in wireless packet networks
2004
This paper refers to a wireless cellular packet network scenario where fast retransmission of corrupted packets is used to improve the packet error ratio. Since the ‘gross’ packet transmission rate (including retransmission) depends on the channel quality perceived, admitted calls weight unevenly in terms of effective resource consumption. In this paper, we suggest using channel quality information to drive load balancing mechanisms. We propose two novel metrics to determine the best cell to attach to, during handover or new call origination. Extensive simulation results prove the superiority of our proposed schemes with respect to traditional load balancing, which base their operation on t…
Analysis of interference avoidance with load balancing in heterogeneous cellular networks
2016
In heterogeneous cellular networks (HCNets) smallcells are overlaid with macro-cells to handle heavy cellular data traffic in an efficient way. To achieve fast and reliable access to data with a better coverage it is necessary to offload users to the underutilized small-cells from the congested macro-cells. Sharing of the same licensed frequency spectrum by smallcells and macro-cells results in heavy cross-tier interference which significantly affects the downlink SINR. In this paper, we investigate and analyze a joint frequency-division duplex based cross-tier complementary spectrum sharing technique which is also regarded as reverse frequency allocation (RFA) scheme with load balancing. T…
DSMAV: An improved solution for multi-attribute search based on load capacities
2016
DHT (Distributed Hash Table) such as CHORD or PARTRY facilitates information searching in scalable systems. Two popular DHT-based approaches for range or multi-attribute search are to rely on attribute-value tree and a combination of attributes and values. However, tradeoff between a load balancing mechanism and query efficiency is a challenging task for such information searching systems. In this paper, we propose improved algorithms for a system called DSMAV in which information resources are distributed fairly among nodes and found based on multi-attribute queries in a small number of hop counts. Our system creates identifiers from resource names, each of which is a combination of attrib…
Maximum Lifetime of the Wireless Sensor Network and the Gossip Problem
2018
In the gossip problem each node of the graph G possesses a unique piece of information - the gossip message. A sequence of one-way or two-way communications between pair of nodes is made to spread the messages so that any node of the graph knows all the gossips. The question is, what is the minimum number of calls between pairs of nodes needed to exchange all gossip messages? The solution to the two-way communication gossip problem is that \(2N-4\) calls (\(N\ge 4\)) suffice if and only if the graph contains a four cycle subgraph. For one-way communication problem the classical results states that in a strongly connected graph \(2N-2\) calls (\(N\ge 4\)) suffice. In this paper we consider t…
Assessment of Deep Learning Methodology for Self-Organizing 5G Networks
2019
In this paper, we present an auto-encoder-based machine learning framework for self organizing networks (SON). Traditional machine learning approaches, for example, K Nearest Neighbor, lack the ability to be precisely predictive. Therefore, they can not be extended for sequential data in the true sense because they require a batch of data to be trained on. In this work, we explore artificial neural network-based approaches like the autoencoders (AE) and propose a framework. The proposed framework provides an advantage over traditional machine learning approaches in terms of accuracy and the capability to be extended with other methods. The paper provides an assessment of the application of …
RECENSIONE A DILETTA TEGA, LA CORTE NEL CONTESTO. PERCORSI DI RI-ACCENTRAMENTO DELLA GIUSTIZIA COSTITUZIONALE IN ITALIA, BOLOGNA, 2020
2020
After a short outline of the content of the book, the Autor focus on the issue of procedural rules concerning the excercise of functions constitutionally given to the Italian Constiutional Court defending the position of a natural flexibility of those rules due to the peculiar position of the Constitutional Court in the system of constitutional powers and the need of constantly re-legitimate its role.