The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we consider the problem of channel allocation for users who access a common channel using OFDMA. The spectrum is divided into subchannels and we assume that the bandwidth of each subchannel is smaller than the coherence bandwidth. This leads to correlations between the channel coefficients for each user. We model these correlated channels as an m-dependent sequence and generate an interference...
The Limited channel allocation, especially the variable width channel allocation is a significant challenge in Wireless Mesh Networks. There are always some problems for fixed bandwidth channel allocation, such as low resource utilization, load imbalance, low efficiency and so on. To cope with the problems, in this paper, we formulate the variable-width channel allocation for the rational and selfish...
We consider a wireless network in which multiple Service Providers (SPs) compete to provide both macrocell and femtocell services in different bands. There are two types of users: mobile users that can only connect to macrocells, and fixed users that can be served by both macrocells and femtocells. For a given allocation of bandwidths across SPs, we characterize for each SP the optimal bandwidth split...
Current data centers in cloud computing have flexible mechanisms to lease compute resources, but provide little control mechanism to share network resource. Traffic flows from different tenants' VMs will competing network resource on the substrate network, thus can resulting in unpredictable performance degradation. This paper proposes an economic model for fair leasing the network resource between...
Flexible channelization can enhance spectrum efficiency by adapting channel bandwidth and center frequency compared with traditional fixed width channel. The key challenge of this new mechanism lies in how to determine proper channel width for each link in a distributed manner without coordination. In this work, we investigate the spectrum sharing problem with flexible channelization from game-theoretic...
Channel allocation has become a significant challenge in multi-channel Ad-Hoc networks due to the fast growing of wireless applications and the limitation of spectrum resource. In this paper, we assume that the demand of each user is different and alterable, which has been known by all the others. We study the problem of demand-aware channel allocation (DaChA) from a non-cooperative strategic game...
We propose algorithms to address the channel allocation and fairness issues of multi band multiuser cognitive ad-hoc networks. Nodes in the network have unequal channel access probability and have no prior information about the offered bandwidth or number of users in the multiple access system. In that nodes use reinforcement learning algorithm to predict future channel selection probability from...
The amplify-and-forward (AF) cooperative communication scheme is modeled using the Stackelberg market framework, where a relay is willing to sell its resources, power, and bandwidth to multiple users to maximize its revenue. The relay determines the prices for relaying the users' information, depending on its available resources and the users' demands. Subsequently, each user maximizes its own utility...
Network virtualization is a new technology that aims to allow multiple virtual networks to coexist in the same equipment and hide the heterogeneity of network infrastructure. This technology leads the list of top strategies employed by ISPs to boost their green IT initiatives. A critical issue is how to provide customized and on demand resources for different service providers. Each infrastructure...
There is an increasing demand for P2P streaming in particular for layered video. In this category of applications, the stream is composed of hierarchically encoded sub-streams layers namely the base layer and enhancements layers. We consider a scenario where the receiver peer uses the pull-based approach to adjust the video quality level to their capability by subscribing to different number of layers...
Running multiple virtual networks over a real physical substrate is a promising way to provide agility in current data centers. However, such virtual networks may experience severely degraded performance due to the competing of network traffic on shared physical links. Based on the idea of the Stackelberg solution from non-cooperative game theory, this paper presents a hierarchical game theoretic...
One of the most important features of the evolving Fourth Generation (4G) wireless communication system is heterogeneous wireless access in which users could connect to several wireless access networks simultaneously. The new feature brings new challenges for the bandwidth allocation (BA) among heterogeneous networks. A non-cooperative bandwidth allocation game (NCBAG) algorithm for heterogeneous...
Bandwidth allocation for different service classes in heterogeneous wireless networks is an important issue for service provider in terms of balancing service quality and profit. It is especially challenging when considering the dynamic competition both among service providers and among users. To address this problem, a two-level game framework is developed in this paper. The underlying dynamic service...
Running multiple virtual networks over a shared physical network is a promising way to support diverse applications, consequently network virtualization is viewed as the keystone of the next-generation architecture. However, decoupling the role of traditional ISPs into Infrastructure Providers (InPs) and Service Providers (SPs), also brings some new challenges to us. For example, how to fairly and...
In this paper, we study the problem of routing in networks with max-min fair congestion control at the link level. The goal of each user is to maximize its own bandwidth by selecting its path. The problem is formulated as a non-cooperative game. We first prove the existence of Nash Equilibria. This is important, because at a Nash Equilibrium (NE), no user has the incentive to change its routing strategy...
In this paper, we model the problem of bandwidth allocation for a broadband satellite communication system using a two level market-based game. Specifically, we consider that a number of satellite operators sell bandwidth to a certain number of users in order to maximize their profit. Simultaneously, the users choose from which satellite to buy the requested bandwidth trying to maximize their efficiency...
Running multiple virtual networks is a promising way to support diverse applications over a shared substrate. Despite being simple, a static division of bandwidth between virtual networks can be highly inefficient, while dynamic bandwidth allocation performs much better, but that is difficult to guarantee the stability. Based on the idea of the Stackelberg solution from noncooperative game theory,...
In the present paper we study the problem of bandwidth allocation in DVB-RCS networks. DVB-RCS networks operate at Ku band and above. At these frequencies, rain attenuation is the dominant fading mechanism and exhibits significant spatial-temporal variation among the users. Firstly, the resource allocation is modeled as a non cooperative game and we find the Nash equilibrium employing the Nikaido-Isoda...
This paper considers a public transportation system, which offers Internet access services to the commuting passengers. Suppose the Internet connection is available at few roadside base stations (RSBs) in a city. Our objective is to solve the bandwidth allocation problem when there are several vehicles connected to an RSB at the same time and the bandwidth of the link to the RSB has to be shared among...
Congestion is a natural phenomenon in core network, and is unavoidable if the queuing system is operated near capacity. Providing fairness among users with different levels of aggressiveness, and different levels of responsiveness is necessary for efficient network flow control. The scalability of current solutions depends on the number of active flows and the number of flows whose rate is greater...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.