Fluid model for a network operating under a fair bandwidth-sharing policy

We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal limits under law of large numbers scalings when the average load on at least one resource is equal to its capacity. We establish convergence to equilibria for fluid models and identify the invariant manifold. The form of the invariant manifold gives insight into the phenomenon of entrainment whereby congestion at some resources may prevent other resources from working at their full capacity

Pricing and Revenue Sharing between ISPs under Content Sharing

Department of Electrical EngineeringAs sponsored data with subsidized access cost gains popularity in industry, it is essential to understand its impact on the Internet service market. We investigate the interplay among Internet Service Providers (ISPs), Content Provider (CP) and End User (EU), where each player is selfish and wants to maximize its own profit. In particular, we consider multi-ISP scenarios, in which the network connectivity between the CP and the EU is jointly provided by multiple ISPs. We first model non-cooperative interaction between the players as a four-stage Stackelberg game, and derive the optimal behaviors of each player in equilibrium. Taking into account the transit price at intermediate ISP, we provide in-depth understanding on the sponsoring strategies of CP. We then study the effect of cooperation between the ISPs to the pricing structure and the traffic demand, and analyze their implications to the players. We further build our revenue sharing model based on Shapley value mechanism, and show that the collaboration of the ISPs can improve their total payoff with a higher social welfare.ope

Secure secret sharing in the cloud

In this paper, we show how a dealer with limited resources is possible to share the secrets to players via an untrusted cloud server without compromising the privacy of the secrets. This scheme permits a batch of two secret messages to be shared to two players in such a way that the secrets are reconstructable if and only if two of them collaborate. An individual share reveals absolutely no information about the secrets to the player. The secret messages are obfuscated by encryption and thus give no information to the cloud server. Furthermore, the scheme is compatible with the Paillier cryptosystem and other cryptosystems of the same type. In light of the recent developments in privacy-preserving watermarking technology, we further model the proposed scheme as a variant of reversible watermarking in the encrypted domain

The variance of identity-by-descent sharing in the Wright-Fisher model

Widespread sharing of long, identical-by-descent (IBD) genetic segments is a hallmark of populations that have experienced recent genetic drift. Detection of these IBD segments has recently become feasible, enabling a wide range of applications from phasing and imputation to demographic inference. Here, we study the distribution of IBD sharing in the Wright-Fisher model. Specifically, using coalescent theory, we calculate the variance of the total sharing between random pairs of individuals. We then investigate the cohort-averaged sharing: the average total sharing between one individual and the rest of the cohort. We find that for large cohorts, the cohort-averaged sharing is distributed approximately normally. Surprisingly, the variance of this distribution does not vanish even for large cohorts, implying the existence of "hyper-sharing" individuals. The presence of such individuals has consequences for the design of sequencing studies, since, if they are selected for whole-genome sequencing, a larger fraction of the cohort can be subsequently imputed. We calculate the expected gain in power of imputation by IBD, and subsequently, in power to detect an association, when individuals are either randomly selected or specifically chosen to be the hyper-sharing individuals. Using our framework, we also compute the variance of an estimator of the population size that is based on the mean IBD sharing and the variance in the sharing between inbred siblings. Finally, we study IBD sharing in an admixture pulse model, and show that in the Ashkenazi Jewish population the admixture fraction is correlated with the cohort-averaged sharing.Comment: Includes Supplementary Materia

On-the job knowledge sharing: how to train employees to share job knowledge

One of the challenging issues many organizations are facing is to find the best ways to encourage employees share what they have learned on their jobs. Rewarding employees may be one of the techniques used to promote knowledge sharing but there are still psychological barriers preventing employees from sharing knowledge. In many cases, rewarding employees for sharing knowledge ends up in developing the behaviour of hoarding knowledge among employees. Based on a review of existing literature, this article explains how employers can make employees practice knowledge sharing in their daily work activities. The article introduces 12 approaches on how knowledge sharing can be cultivated in the job and train employees to accept that it is their job to share knowledge. Some of the methods discussed include; peer assist, training and mentoring, challenging projects, job description, job rotation, cross training, and sharing sessions. The article also discusses how on-the-job knowledge sharing can promote individual performance among employees. The intention of this article is to provide a framework that helps organizations to choose various methods of knowledge sharing that suit the organization’s needs in order to cultivate sharing of job knowledge and to save the knowledge as an asset

A study of set-sharing analysis via cliques

We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a top-down framework. In particular, we define the abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. Our experimental evaluation supports the conclusion that, for inferring set-sharing, as it was the case for inferring pair-sharing, precision losses are limited, while useful efficiency gains are obtained. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.Comment: 15 pages, 0 figure

Enforcement and Spectrum Sharing: Case Studies of Federal-Commercial Sharing

To promote economic growth and unleash the potential of wireless broadband, there is a need to introduce more spectrally efficient technologies and spectrum management regimes. That led to an environment where commercial wireless broadband need to share spectrum with the federal and non-federal operations. Implementing sharing regimes on a non-opportunistic basis means that sharing agreements must be implemented. To have meaning, those agreements must be enforceable.\ud \ud With the significant exception of license-free wireless systems, commercial wireless services are based on exclusive use. With the policy change facilitating spectrum sharing, it becomes necessary to consider how sharing might take place in practice. Beyond the technical aspects of sharing, that must be resolved lie questions about how usage rights are appropriately determined and enforced. This paper is reasoning about enforcement in a particular spectrum bands (1695-1710 MHz and 3.5 GHz) that are currently being proposed for sharing between commercial services and incumbent spectrum users in the US. We examine three enforcement approaches, exclusion zones, protection zones and pure ex post and consider their implications in terms of cost elements, opportunity cost, and their adaptability