2,840 research outputs found
Practical service placement approach for microservices architecture
Community networks (CNs) have gained momentum in the last few years with the increasing number of spontaneously deployed WiFi hotspots and home networks. These networks, owned and managed by volunteers, offer various services to their members and to the public. To reduce the complexity of service deployment, community micro-clouds have recently emerged as a promising enabler for the delivery of cloud services to community users. By putting services closer to consumers, micro-clouds pursue not only a better service performance, but also a low entry barrier for the deployment of mainstream Internet services within the CN. Unfortunately, the provisioning of the services is not so simple. Due to the large and irregular topology, high software and hardware diversity of CNs, it requires of aPeer ReviewedPostprint (author's final draft
Recommended from our members
A directionally based bandwidth reservation scheme for call admission control
This paper proposes a new advanced Call Admission Control(CAC) strategy involving for the first time, a bandwidth reservation scheme that is influenced by the direction attribute of a mobile terminal (MT). Aside from the Quality-of-Service (QoS) parameters, the direction attribute plays a key role in efficiently reserving resources for MTs supporting multimedia communications for different QoS classes. The framework for a direction-based CAC system is entirely distributed and may be viewed as a message passing system, where MTs inform their neighbouring base stations (BS) not only of their QoS requirements, but also of their mobility parameters. The base stations then predict future demand and reserve resources accordingly, only admitting those terminals that can be adequately supported. The bandwidth reservation scheme proposed in this paper, integrates the direction attribute into the conventional Guard Channel (GC) scheme. Simulation results prove that this new scheme offers significant improvements in both Call Blocking Probability (CBP) and bandwidth utilization, under a variety of differing traffic conditions
Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling
We study the problem of allocating limited feedback resources across multiple
users in an orthogonal-frequency-division-multiple-access downlink system with
slow frequency-domain scheduling. Many flavors of slow frequency-domain
scheduling (e.g., persistent scheduling, semi-persistent scheduling), that
adapt user-sub-band assignments on a slower time-scale, are being considered in
standards such as 3GPP Long-Term Evolution. In this paper, we develop a
feedback allocation algorithm that operates in conjunction with any arbitrary
slow frequency-domain scheduler with the goal of improving the throughput of
the system. Given a user-sub-band assignment chosen by the scheduler, the
feedback allocation algorithm involves solving a weighted sum-rate maximization
at each (slow) scheduling instant. We first develop an optimal
dynamic-programming-based algorithm to solve the feedback allocation problem
with pseudo-polynomial complexity in the number of users and in the total
feedback bit budget. We then propose two approximation algorithms with
complexity further reduced, for scenarios where the problem exhibits additional
structure.Comment: Accepted to IEEE Transactions on Signal Processin
Class-Based Weighted Window for TCP Fairness in WLANs
The explosive growth of the Internet has extended to the wireless domain. The number of Internet users and mobile devices with wireless Internet access is continuously increasing. However, the network resource is essentially limited, and fair service is a key issue in bandwidth allocation. In this research, the focus is on the issue of fairness among wireless stations having different number and direction of flows for different required bandwidth to ensure that fair channel is fairly shared between wireless stations in the same class of bandwidth. It is shown that the current WLANs allocate bandwidth unfairly. It is also identified that the cause of this problem of unfairness is the TCP cumulative ACK mechanism combined with the packet dropping mechanism of AP queue and the irregular space for each wireless station in AP queue. The proposed method allocate converged bandwidth by introducing a Class-Based Weighted Window method which adjusts the TCP window size based on the current conditions of the network and according to the networkâs requirements. This method works in wireless stations without requiring any modification in MAC. It can guarantee fair service in terms of throughput among wireless users whether they require the same or different bandwidth.Wireless LAN, TCP, Fairness
- âŚ