Most studies in complex networks assume that once a link is created between two nodes it is never deleted. However, there is a recent interest towards systems where links can be rapidly rewired. An important issue in that type of networks is to discover the topology that, given a search algorithm, optimizes the search process. In this paper, we present a system model that, depending on the curr...

The following case of arsenical poisoning is placed on record as confirming the accuracy of Dr. Bonavia's remarks, published in the September number of the Gazette. A Mahomedan, a native of this district, died suddenly under very suspicious circumstances. His body was brought in for examination on the 2oth December, 1S66. The appearances were as follows :?Deceased was apparently a healthy man, ...

The allocation of limited resources such as links, servers, and agents to support as many as emergency call responses as possible while maintaining reasonable quality of service is a principal requirement in public safety networks. It is difficult to handle the highest priority emergency call responses for a congested period with a limited number of dedicated incoming links from commercial netw...

The objective of this paper is to study the small-signal stability of congested TCP networks. The starting point for this analysis is a fluid model describing the interaction of TCP-controlled traffic with congested routers. Assuming integral action in the active queue management scheme, we compute the network’s equilibrium point about which we determine the network’s small-signal dynamics. Spe...

In this paper a recent variable anticipation cellular automata model for single-lane traffic flow is extended to analyze the situation of free and congested flow in the Highway from Mexico City to Cuernavaca. This highway presents free flow in standard days; but in the returning day of long weekends or holidays it exhibits congested flow and in rush hours jamming appears. We illustrate how our ...

We consider a partially observable Markov decision process (POMDP) model for improving a taxi agent cruising decision in a congested urban city. Using real-world data provided by a large taxi company in Singapore as a guide, we derive the state transition function of the POMDP. Specifically, we model the cruising behavior of the drivers as continuous-time Markov chains. We then apply dynamic pr...

This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected O(log log logn) rounds and using this, we obtain a constant-approximation to metric facility location, also in expected O(log log logn) rounds. In addition, assuming an input metric space of constant doubling d...

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. This paper shows that this protocol is only marginally stable: once a queue is congested, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induc...

We focus on multi-agent-based egress simulation from large sports stadiums. We present the efficient Portal Clearinghouse algorithm for locating bottlenecks that are temporarily congested by agents. The purpose of this step is to allow agents who intend to use the congested portals to re-rout and avoid adding to existing congestions. We present simple heuristic techniques for other sub-problems...