Nonneutral network and the role of bargaining power in side payments

Representatives of several Internet access providers have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers pay for use of the network, given the large amount of resources they use. This would be in clear violation of the �network neutrality� principle that had characterized the development of the wireline Internet. Our first goal in this paper is to propose and study possible ways of implementing such payments and of regulating their amount. We introduce a model that includes the internaut�s behavior, the utilities of the ISP and of the content providers, and the monetary flow that involves the internauts, the ISP and content provider, and in particular, the content provider�s revenues from advertisements. We consider various game models and study the resulting equilibrium; they are all combinations of a noncooperative game (in which the service and content providers determine how much they will charge the internauts) with a cooperative one - the content provider and the service provider bargain with each other over payments to one another. We include in our model a possible asymmetric bargaining power which is represented by a parameter (that varies between zero to one). We then extend our model to study the case of several content providers. We also provide a very brief study of the equilibria that arise when one of the content providers enters into an exclusive contract with the ISP.

Optimal Parameterized Policies for Resource Allocation in Communication Networks

The problem of finding optimal parameterized feedback policies for dynamic bandwidth allocation in communication networks is studied. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider two different classes of multilevel closed-loop feedback policies for the system and use a two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm to find optimal policies within each prescribed class. We study the performance of the proposed algorithm on a numerical setting and show performance comparisons of the two optimal multilevel closedloop policies with optimal open loop policies. We observe that closed loop policies of Class B that tune parameters for both the queues and do not have the constraint that the entire bandwidth be used at each instant exhibit the best results overall as they offer greater flexibility in parameter tuning. Index Terms — Resource allocation, dynamic bandwidth allocation in communication networks, two-timescale SPSA algorithm, optimal parameterized policies. I.

Large improvements in application throughput of long-running multi-component applications using batch grids

Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multi-component parallel applications. In this paper, we evaluate the potential improvements in throughput of long-running multi-component applications when the different components of the applications are executed on multiple batch systems of batch grids. We compare the multiple batch executions with executions of the components on a single batch system without increasing the number of processors used for executions. We perform our analysis with a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). We have built a robust simulator that models the characteristics of both the multi-component application and the batch systems. By conducting large number of simulations with different workload characteristics and queuing policies of the systems, processor allocations to components of the application, distributions of the components to the batch systems and inter-cluster bandwidths, we show that multiple batch executions lead to 55% average increase in throughput over single batch executions for long-running CCSM. We also conducted real experiments with a practical middleware infrastructure and showed that multi-site executions lead to effective utilization of batch systems for executions of CCSM and give higher simulation throughput than single-site executions. Copyright (c) 2011 John Wiley & Sons, Ltd.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Regulation of Off-Network Pricing in a Nonneutral Network

Representatives of several Internet service providers (ISPs) have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use. This would be in clear violation of the ``network neutrality'' principle that had characterized the development of the wireline Internet. Our first goal in this article is to propose and study possible ways of implementing such payments and of regulating their amount. We introduce a model that includes the users' behavior, the utilities of the ISP and of the CPs, and, the monetary flow that involves the content users, the ISP and CP, and, in pUrticular, the CP's revenues from advertisements. We consider various game models and study the resulting equilibria; they are all combinations of a noncooperative game (in which the ISPs and CPs determine how much they will charge the users) with a ``cooperative'' one on how the CP and the ISP share the payments. We include in our model a possible asymmetric weighting parameter (that varies between zero to one). We also study equilibria that arise when one of the CPs colludes with the TSP. We also study two dynamic game models as well as the convergence of prices to the equilibrium values.

Emissions from India's transport sector: Statewise synthesis

A decentralized emission inventories are prepared for road transport sector of India in order to design and implement suitable technologies and policies for appropriate mitigation measures. Globalization and liberalization policies of the government in 90's have increased the number of road vehicles nearly 92.6% from 1980-1981 to 2003-2004. These vehicles mainly consume non-renewable fossil fuels, and are a major contributor of green house gases, particularly CO2 emission. This paper focuses on the statewise road transport emissions (CO2, CH4, CO, N-x, N2O, SO2, PM and HC) using region specific mass emission factors for each type of vehicles. The country level emissions (CO2, CH4, CO, NOx, N2O, SO2 and NMVOC) are calculated for railways, shipping and airway, based on fuel types. In India, transport sector emits an estimated 258.10 Tg Of CO2, of which 94.5% was contributed by road transport (2003-2004). Among all the states and Union Territories, Maharashtra's contribution is the largest, 28.85 Tg (11.8%) Of CO2, followed by Tamil Nadu 26.41 Tg(10.8%), Gujarat 23.31 Tg(9.6%), Uttar Pradesh 17.42 Tg(7.1%), Rajasthan 15.17 Tg (6.22%) and, Karnataka 15.09 Tg (6.19%). These six states account for 51.8% of the CO2 emissions from road transport.

Emissions from India’s transport sector: Statewise synthesis

A decentralized emission inventories are prepared for road transport sector of India in order to design and implement suitable technologies and policies for appropriate mitigation measures. Globalization and liberalization policies of the government in 90's have increased the number of road vehicles nearly 92.6% from 1980–1981 to 2003–2004. These vehicles mainly consume non-renewable fossil fuels, and are a major contributor of green house gases, particularly CO2 emission. This paper focuses on the statewise road transport emissions (CO2, CH4, CO, NOx, N2O, SO2, PM and HC), using region specific mass emission factors for each type of vehicles. The country level emissions (CO2, CH4, CO, NOx, N2O, SO2 and NMVOC) are calculated for railways, shipping and airway, based on fuel types. In India, transport sector emits an estimated 258.10 Tg of CO2, of which 94.5% was contributed by road transport (2003–2004). Among all the states and Union Territories, Maharashtra's contribution is the largest, 28.85 Tg (11.8%) of CO2, followed by Tamil Nadu 26.41 Tg (10.8%), Gujarat 23.31 Tg (9.6%), Uttar Pradesh 17.42 Tg (7.1%), Rajasthan 15.17 Tg (6.22%) and, Karnataka 15.09 Tg (6.19%). These six states account for 51.8% of the CO2 emissions from road transport.