— We consider the problem of routing messages through a network with episodic connectivity without a priori knowledge of node schedules or locations. We present Steward Assisted ...
Jay Boice, Jose Joaquin Garcia-Luna-Aceves, Katia ...
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
Some safety-critical distributed embedded systems may need to use centralized components to achieve certain dependability properties. The difficulty in combining centralized and d...
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...