The Distribution of Path Losses for Uniformly Distributed Nodes in a Circle

When simulating a wireless network, users/nodes are usually assumed to be distributed uniformly in space. Path losses between nodes in a simulated network are generally calculated by determining the distance between every pair of nodes and applying a suitable path loss model as a function of this distance (power of distance with an environment-specific path loss exponent) and adding a random component to represent the log-normal shadowing. A network with nodes consists of (−1)/2 path loss values. In order to generate statistically significant results for system-level simulations, Monte Carlo simulations must be performed where the nodes are randomly distributed at the start of every run. This is a time-consuming operation which need not be carried out if the distribution of path losses between the nodes is known. The probability density function (pdf) of the path loss between the centre of a circle and a node distributed uniformly within a the circle is derived in this work

Perceptions of gender balance of IS journal editorial positions

An analysis of 18,854 editorial positions on IS journals was undertaken to examine the perceived gender balance of those positions as an indication of their contribution towards a positive role model for females considering an IS academic career. The nature and extent of perceived gender balance is examined in terms of overall composition of editorial positions, journal prestige and the specific area within IS covered by a journal. The results indicate that perceived gender balance of editorial positions reflects that of ICT academia generally, and that female representation appears to be concentrated in journals covering areas that are traditionally seen as female occupations, e.g., health, education, librarianship. As such, little or no encouragement is given to females considering an IS academic career.<br /

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial