Sciweavers

INFOCOM
1995
IEEE
15 years 4 months ago
Models of Blocking Probability in All-Optical Networks with and without Wavelength Changers
We introduce a traffic model for circuit-switched all-optical networks which we then use to calculate the blocking probability along a path for networks with and without wavelength...
Richard A. Barry, Pierre A. Humblet
130
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
123
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Address Management and Connection Control for Multicast Communication Applications
An architecture and associated protocols are presented for managing multicast addresses and performing connection control for applications that use multicast communication faciliti...
Alexandros Eleftheriadis, Sassan Pejhan, Dimitris ...
119
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Automatic Alarm Correlation for Fault Identification
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...
Isabelle Rouvellou, George W. Hart
114
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—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...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
Communications
Top of PageReset Settings