"Discrete-time analysis of a finite capacity queue with an "all or nothing ..."

Johan M. Karlsson, Hideaki Yamashita (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2002-01-03

- no documents available
- export record
  dblp key:
  - conf/dcsp/KarlssonY95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcsp/KarlssonY95
Johan M. Karlsson, Hideaki Yamashita:
Discrete-time analysis of a finite capacity queue with an "all or nothing policy" to reduce burst loss. Data Communications and their Performance 1995: 179-193

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.