INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
Message-based process architectures are widely regarded as an effective method for structuring parallel protocol processing on shared memory multi-processor platforms. A message-b...
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
This paper examines the asymptotic behavior of solutions of a simple network model using feedback control under the presence of delays. It shows numerically the existence of compl...
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
CommunicationsNetworks can separate as well asjoin iMormation. This ability can be used to increase personal privacy in an environment where advances in technology makes it possib...
INFOCOM
1995
IEEE
14 years 4 months ago
1995
IEEE
We continue our study of document marking to deter illicit dissemination. A n experiment we performed reveals that the distortion on the photocopy of a document is very different ...