Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link

We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an enforcer of what the community of rational users sharing the resource decides is a fair allocation of that resource. Our T&C mechanism proceeds in two phases. In the first, software agents acting on behalf of users engage in a strategic trading game in which each user agent selfishly chooses bandwidth slots to reserve in support of primary, interactive network usage activities. In the second phase, each user is allowed to acquire additional bandwidth slots in support of presumed open-ended need for fluid bandwidth, catering to secondary applications. The acquisition of this fluid bandwidth is subject to the remaining "buying power" of each user and by prevalent "market prices" – both of which are determined by the results of the trading phase and a desirable aggregate cap on link utilization. We present analytical results that establish the underpinnings of our T&C mechanism, including game-theoretic results pertaining to the trading phase, and pricing of fluid bandwidth allocation pertaining to the capping phase. Using real network traces, we present extensive experimental results that demonstrate the benefits of our scheme, which we also show to be practical by highlighting the salient features of an efficient implementation architecture.National Science Foundation (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, and CNS-0520166); Universidad Pontificia Bolivariana and COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología “Francisco Jose ́ de Caldas”

Network QoS games: stability vs optimality tradeoff

AbstractWe study noncooperative games whose players are selfish, distributed users of a network and the game's broad objective is to optimize Quality of Service (QoS) provision. Our classes of games are based on realistic microeconomic market models of QoS provision (Proceedings of the First International Conference on Information and Computation Economics ICE’98, 1998) and have two competing characteristics—stability and optimality. Stability refers to whether the game reaches a Nash equilibrium. Optimality is a measure of how close a Nash equilibrium is to optimizing a given objective function defined on game configuration. The overall goal is to determine a minimal set of static game rules based on pricing that result in stable and efficient QoS provision. We give a new and general technique to establish stability and demonstrate a close trade-off between stability and optimality for our game classes. We also state several open problems and directions together with initial observations and conjectures

Channel assignment and routing in cooperative and competitive wireless mesh networks

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.In this thesis, the channel assignment and routing problems have been investigated for both cooperative and competitive Wireless Mesh networks (WMNs). A dynamic and distributed channel assignment scheme has been proposed which generates the network topologies ensuring less interference and better connectivity. The proposed channel assignment scheme is capable of detecting the node failures and mobility in an efficient manner. The channel monitoring module precisely records the quality of bi-directional links in terms of link delays. In addition, a Quality of Service based Multi-Radio Ad-hoc On Demand Distance Vector (QMR-AODV) routing protocol has been devised. QMR-AODV is multi-radio compatible and provides delay guarantees on end-to-end paths. The inherited problem of AODV’s network wide flooding has been solved by selectively forwarding the routing queries on specified interfaces. The QoS based delay routing metric, combined with the selective route request forwarding, reduces the routing overhead from 24% up to 36% and produces 40.4% to 55.89% less network delays for traffic profiles of 10 to 60 flows, respectively. A distributed channel assignment scheme has been proposed for competitive WMNs, where the problem has been investigated by applying the concepts from non-cooperative bargaining Game Theory in two stages. In the first stage of the game, individual nodes of the non-cooperative setup is considered as the unit of analysis, where sufficient and necessary conditions for the existence of Nash Equilibrium (NE) and Negotiation-Proof Nash Equilibrium (N-PNE) have been derived. A distributed algorithm has been presented with perfect information available to the nodes of the network. In the presence of perfect information, each node has the knowledge of interference experience by the channels in its collision domain. The game converges to N-PNE in finite time and the average fairness achieved by all the nodes is greater than 0.79 (79%) as measured through Jain Fairness Index. Since N-PNE and NE are not always a system optimal solutions when considered from the end-nodes prospective, the model is further extended to incorporate non-cooperative end-users bargaining between two end user’s Mesh Access Points (MAPs), where an increase of 10% to 27% in end-to-end throughput is achieved. Furthermore, a non-cooperative game theoretical model is proposed for end-users flow routing in a multi-radio multi-channel WMNs. The end user nodes are selfish and compete for the channel resources across the WMNs backbone, aiming to maximize their own benefit without taking care for the overall system optimization. The end-to-end throughputs achieved by the flows of an end node and interference experienced across the WMNs backbone are considered as the performance parameters in the utility function. Theoretical foundation has been drawn based on the concepts from the Game Theory and necessary conditions for the existence of NE have been extensively derived. A distributed algorithm running on each end node with imperfect information has been implemented to assess the usefulness of the proposed mechanism. The analytical results have proven that a pure strategy Nash Equilibrium exists with the proposed necessary conditions in a game of imperfect information. Based on a distributed algorithm, the game converges to a stable state in finite time. The proposed game theoretical model provides a more reasonable solution with a standard deviation of 2.19Mbps as compared to 3.74Mbps of the random flow routing. Finally, the Price of Anarchy (PoA) of the system is close to one which shows the efficiency of the proposed scheme.The Higher Education Commission of Pakistan and the University of Engineering and Technology, Peshawar

A Business Evaluation Of The Next Generation Ipv6 Protocol In Fixed And Mobile Communication Services

This paper gives an analytical business model of the Internet IPv4 and IPv6 protocols ,focussing on the business implications of intrinsic technical properties of these protocols .The technical properties modeled in business terms are : address space, payload, autoconfiguration, IP mobility , security, and flow label. Three operational cash flow focussed performance indexes are defined for respectively an Internet operator or ISP, for the address domain owner, and for the end user. Special considerations are made and modeling changes for mobile Internet traffic. The effects of technical innovation in the Internet services and protocols is taken into account , as are special considerations for N.A.T. and content owners. A numerical case is provided which mimics the current state of the Internet network and services ,and around which sensitivity analysis can be carried out, or such that additional service models can be added. It establishes in the Case the relative advantages or disadvantages of IPv4 and IPv6 for each of the three main parties ,i.e. the ISP operator, the address domain owner, and the end use

Primary Outage-Based Resource Allocation Strategies

Cognition & cognitive psycholog

Scalable base station switching framework for green cellular networks

With the recent unprecedented growth in the wireless market, network operators are obliged not only to find new techniques including dense deployment of base stations (BSs) in order to support high data rate services and high user density, but also to reduce the operating costs and energy consumption of various network elements. To solve these challenges, powering down certain BSs during low-traffic periods, so-called BS sleeping, has emerged as an effective green communications paradigm. While BS sleeping offers the potential to significantly lower energy consumption, it also raises many challenges, since when a BS is switched off, this can lead to, for example, coverage holes, sudden degradation in quality of service (QoS), higher transmit power dissipation in off-cell mobile stations (MSs), an inability to rapidly power up/down equipment and finally, a failure to uphold regulatory requirements. In order to realise greener network designs which both maximise energy savings whilst guaranteeing QoS, innovative BS switching mechanisms need to be developed. This thesis presents a novel BS switching framework which improves energy efficiency (EE) in comparison with existing approaches, while guaranteeing the minimum QoS and seamless services. The major technical contributions in this framework are: i) a new BS to relay station (RS) switching model where certain BSs are switched to RS mode rather than being turned off, firstly using a fixed threshold based switching algorithm utilizing temporal traffic diversity, and ii) then subsequently by means of an adaptive threshold by exploiting the inherently asymmetric traffic profile between cells, i.e., by exploiting both the temporal and spatial traffic diversity; iii) a traffic-and-interference-aware BS switching strategy that considers the impact of inter-cell interference in the decision making process to dynamically determine the best BS set to be kept active for improved EE; and finally iv) a novel scalable multimode BS switching model which enables each BS to operate in different power modes i.e., macro/micro/sleep to explore energy savings potential even at higher traffic conditions. The thesis findings conclusively confirm this new BS switching framework provides significant EE improvements from both BS and MS perspectives, under diverse network conditions and represents a notable step towards greener communications

Chapter Primary Outage-Based Resource Allocation Strategies

Cognition & cognitive psycholog

D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version