166 search results - page 25 / 34 » networking 1993 |
STOC
1993
ACM
14 years 1 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
BROADBAND
1998
13 years 11 months ago
1998
One approach to facilitate statistical multiplexing of bursty sources in ATM networks is dispersion of the traffic over independent paths. It has been shown within the literature ...
PODC
1993
ACM
14 years 1 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
INFOCOM
1993
IEEE
14 years 1 months ago
1993
IEEE
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
ATMN
1993
13 years 11 months ago
1993
Quality-of-service (QOS) requirements for applications in high-speed networks are typically specied on an end-to-end basis. Mapping this end-to-end requirement to nodal requiremen...