Congestion control is an important feature that directly affects network performance. Network congestion may cause loss of data or long delays. Although this problem has been studied extensively inâ€¦ (More)

When designing routing protocols for space-based networks, we must take into consideration the unique characteristics of such networks. Since space-based networks are inherently sparse withâ€¦ (More)

A time efficient distributed algorithm for computing all maximal cliques in an arbitrary network is presented that is t ime efficient for every class of networks with a polynomial number of maximalâ€¦ (More)

2007 IEEE International Conference on System ofâ€¦

2007

NASA is planning a series of short and long duration human and robotic missions to explore the Moon and then Mars. A key objective of the missions is to grow, through a series of launches, a systemâ€¦ (More)

In reliable multicast protocols, each data packet being sent must be acknowledged. Collecting the acknowledgments centrally at the sources can cause ACK-implosion and can result in poor scalability.â€¦ (More)

Given a graphG = (V,E) and a path P , let d(v, P ) be the distance from vertexv âˆˆ V to path P . A path-center is a path which minimizes the eccentricitye(P ) = maxvâˆˆV d(v, P ) such that for everyâ€¦ (More)

We present two distributed algorithms for the computation of sparse certificates for k-connectivity in asynchronous networks where a network is represented by a graph and processors have uniqueâ€¦ (More)