Deterministic service guarantees in IEEE 802.12 networks .I. The single-hub case

Author

Kim, Peter

Author_Institution

Hewlett-Packard Res. Lab., Bristol, UK

Volume

6

Issue

5

fYear

1998

fDate

10/1/1998 12:00:00 AM

Firstpage

645

Lastpage

658

Abstract

We study the problem of allocating resources in single-hub and cascaded 802.12 networks. We show that the use of the 802.12 high-priority access mechanism, when combined with admission control, allows the network to provide small deterministic delay bounds in large cascaded network topologies with potentially many hundreds of hosts. The first part of this work is to analyze relevant 802.12 network performance parameters. In the second part, we describe the scheduling model and define the admission control conditions. Experimental results received with a UNIX kernel-based implementation in a standard 802.12 test network confirm our theoretical results for network parameters, throughput, and delay bounds. In this paper, the single-hub topology is analyzed

Keywords

IEEE standards; Unix; delays; local area networks; network topology; packet switching; performance evaluation; scheduling; telecommunication congestion control; telecommunication services; telecommunication standards; IEEE 802.12 networks; LAN; UNIX kernel-based implementation; admission control; cascaded network topologies; data packets; delay bounds; deterministic service guarantees; experimental results; high-priority access mechanism; network parameters; network performance parameters; scheduling model; single-hub network; single-hub topology; standard 802.12 test network; throughput; Admission control; Computer aided software engineering; IP networks; Intelligent networks; Intserv networks; Local area networks; Network topology; Performance analysis; Scheduling algorithm; Testing;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.731202

Filename

731202