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.
These Proceedings contain papers that were presented at the Fifty-Third Annual Allerton Conference on Communication, Control, and Computing which was held at Allerton House, Monticello, Illinois, on September 30–October 2, 2015. As in past years, the Conference was sponsored by the Coordinated Science Laboratory and the Department of Electrical and Computer Engineering of the University of Illinois...
The exponential growth in demand for mobile data requires significant increases in spatial reuse, motivating an evolution towards picocellular architectures with densely deployed base stations. Providing backhaul for such a network is a key challenge, because of the high access link rates, and the cost and difficulty of running optical fiber to base stations that might be opportunistically placed...
This paper considers a problem of distributed hypothesis testing and cooperative learning. Individual nodes in a network receive noisy local (private) observations whose distribution is parameterized by a discrete parameter (hypotheses). The conditional distributions are known locally at the nodes, but the true parameter/hypothesis is not known. We consider a social (“non-Bayesian”) learning rule...
We consider deterministic anonymous distributed systems with broadcast communications where each node has some initial value, and the goal is to compute a function of all these values. We show that only a very restricted set of functions can be computed if the nodes do not know (and cannot use) the number of their out-neighbors. Our results remain valid even if nodes know the precise structure of...
We consider stochastic message passing algorithms that limit the communication required for decentralized and distributed convex optimization and provide convergence guarantees on the objective value. We first propose a centralized method that modifies the coordinate-sampling distribution for stochastic coordinate descent, which we call proportional stochastic coordinate descent. This method treats...
This paper demonstrates that the signal structure of an interconnected dynamical system, such as that represented by various dynamical graphical models, can be very different from the interconnection structure of its subsystems. These differences are revealed by considering the network semantics of each representation, characterized by the set of realizations consistent with each network structure...
Network alignment refers to the problem of matching the vertex sets of two unlabeled graphs, which can be viewed as a generalization of the classic graph isomorphism problem. Network alignment has applications in several fields, including social network analysis, privacy, pattern recognition, computer vision, and computational biology. A number of heuristic algorithms have been proposed in these fields...
Polling is an effective method to collect information from a population. However, pollsters are often concerned with unsatisfactory response rate. Incentive is sometimes used to boost response rate, but pollsters want to keep it low. In fact, when there is an underlying social network among responders, a pollster can elicit a high response rate while attempting to minimize polling costs via asking...
We study an SIS epidemic model over an arbitrary connected network topology when the agents receive personalized information about the current epidemic state. The agents utilize their available information to either reduce interactions with their neighbors (social distancing) when they believe the epidemic is currently prevalent or resume normal interactions when they believe there is low risk of...
We consider the provision of non-excludable public goods on a network of interdependent strategic users. We study three different equilibria of these games, namely the Nash equilibrium, socially optimal, and exit equilibrium profiles. We identify properties of the interdependence graph that guarantee the existence and uniqueness of these equilibria. We further establish a connection between users'...
We consider the problem of the assignment of nodes into communities from a set of hyperedges, where every hyperedge is a noisy observation of the community assignment of the adjacent nodes. We focus in particular on the sparse regime where the number of edges is of the same order as the number of vertices. We propose a spectral method based on a generalization of the non-backtracking Hashimoto matrix...
Anycast is an internet addressing protocol where multiple hosts share the same IP-address. A popular architecture for modern Content Distribution Networks (CDNs) for geo-replicated HTTP-services consists of multiple layers of proxy nodes for service and co-located DNS-servers for load-balancing on different proxies. Both the proxies and the DNS-servers use anycast addressing, which offers simplicity...
The blocking problem naturally arises in transportation systems as multiple vehicles with different itineraries share available resources. In this paper, we investigate the impact of the blocking problem to the waiting time at the intersections of transportation systems. We assume that different vehicles, depending on their Internet connection capabilities, may communicate their intentions (e.g.,...
With the advent of renewable sources and Smart-Grid deployments, it is increasingly common to control demands in order to reduce power consumption variability and thus the need for regulation, with load aggregators now exploiting the deferability of some power loads to smooth the consumption profile. In this paper, we analyze the impact of service deferrals and scheduling on power consumption variability...
Reducing latency in distributed computing and data storage systems is gaining increasing importance. Several empirical works have reported on the efficacy of scheduling redundant requests in such systems. That is, one may reduce job latency by 1) scheduling the same job at more than one server and 2) waiting only until the fastest of them responds. Inspired by the empirically observed gains of such...
In cloud computing systems, assigning a job to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers. Although adding redundant replicas always reduces service time, the total computing time spent per job may be higher, thus increasing waiting time in queue. The total time spent per job is also proportional...
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.