Real-time block transfer under a link-sharing hierarchy
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We present an admission control framework and loss management techniques in support of a guaranteed statistical service. The service is characterized by (i) the loss rate of application data units (ADUs) bounded below a specified value, and (ii) ADU losses distributed evenly among flows subscribing to the service and uniformly over the duration of each how. Specifically, a flow is modeled as a sequence of bursts, each of which is a sequence of packets that carry the bits of an ADU. The first packet of each burst carries information on the ADlJ (e.g., its bandwidth requirement). This traffic model enables admission control at the burst level as well as at the flow level. Such a two level admission control approach is very effective in bounding end-to-end ADU loss rates of flows while maintaining high channel utilization in the network. The traffic model also enables simple techniques that can be used at a network channel to distribute ADU losses evenly among flows subscribing to the same statistical service, and to protect high priority ADUs (e.g., I frames of MPEG applications).