Abstract | ||
---|---|---|
In this paper and its sequel, 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 mecha- nism, 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 im- plementation 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. In the sequel, the network parameters are derived for cascaded 802.12 networks. This allows the admission control conditions derived in this paper to be also applied to those topologies. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1109/90.731202 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
ieee 802.12,resource reservation,guaranteed service,deterministic service guarantee,single-hub case,local area network,intelligent networks,scheduling algorithm,lan,network performance,unix,data packets,testing,scheduling,local area networks,packet switching,telecommunication services,network topology,throughput,computer aided software engineering | Network delay,Admission control,Computer science,Network simulation,Computer network,Network topology,IEEE 802,Local area network,Unix architecture,Distributed computing,Network performance | Journal |
Volume | Issue | ISSN |
6 | 5 | 1063-6692 |
Citations | PageRank | References |
3 | 0.55 | 21 |
Authors | ||
1 |