Sciweavers

1243 search results - page 171 / 249
» On the locality of bounded growth
Sort
View
INFOCOM
1996
IEEE
15 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
ICCAD
1993
IEEE
81views Hardware» more  ICCAD 1993»
15 years 10 months ago
Inverter minimization in multi-level logic networks
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...
Alok Jain, Randal E. Bryant
ICMCS
1994
IEEE
116views Multimedia» more  ICMCS 1994»
15 years 10 months ago
Improving Utilization for Deterministic Service In Multimedia Communication
Network-based real-time multimedia applications require guaranteed performance communicationservices. To provide guaranteed service, resources have to be reserved within the netwo...
Hui Zhang, Domenico Ferrari
INFOCOM
1992
IEEE
15 years 10 months ago
A Study on the Inaccessibility Characteristics of ISO 8802/4 Token-Bus LANs
Local area networks have long been established as the basis for distributed systems. Continuity of service and bounded and known message delivery latency are requirements of a num...
José Rufino, Paulo Veríssimo
GLOBECOM
2007
IEEE
15 years 10 months ago
Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
Nikhil Karamchandani, Massimo Franceschetti