Competitive buffer management for shared-memory switches

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 53-58

  Hahne, E L ^a   Kesselman, A ^a   Mansour, Y ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; DATA STORAGE EQUIPMENT; QUALITY OF SERVICE; QUEUEING THEORY; STORAGE ALLOCATION (COMPUTER);

SHARED-MEMORY SWITCHES;

PACKET SWITCHING;

EID: 0034818973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Competitive queue policies for differentiated services
2. Buffer management for shared-memory ATM switches
3. On-line load balancing with applications to machine scheduling and virtual circuit routing
4. An architecture for differentiated services
5. Dynamic queue length thresholds for shared-memory packet switches
6. Buffer management in a packet switch
7. Analysis of shared finite storage in a computer network node environment under general traffic conditions
8. Buffer overflow management in QoS switches
9. Loss-bounded analysis for differentiated services
10. Comparative performance study of space priority mechanisms for ATM networks
11. Optimal smoothing schedules for real-time streams
12. A two-bit differentiated services architecture for the Internet
13. Amortized efficiency of list update and paging rules
14. On the design of optimal policy for sharing finite buffers
15. An optimal buffer management policy for high-performance packet switching