The behavior of the priority mechanism is evaluated with reference to the tokens CiT and DeT provided for in the DLL (Data Link Layer) protocol of the FieldBus architecture. The use of priorities in the access mechanism is assessed in terms of throughput and access delay. Two policies are considered for allocation of the bandwidth between the high- and low-priority channels. The first provides for a static subdivision of the time available for high- and low-priority acyclic traffic (by use of the DeT token). The second allows dynamic allocation of the available bandwidth between the two priorities (by use of the CiT token). Examination of the throughput for the two policies shows that the same values are only obtained when the first policy allocates at least 80% of the available bandwidth to high-priority traffic. This, however, systematically penalizes low-priority traffic, even when the amount of high-priority traffic is lower than the LAS (Link Active Scheduler) has estimated it to be through polling operations. The second policy, being self-adapting, allows bandwidth allocation to be optimized. The same considerations can be made for access delay.Reaxys Database Information|
Assessment of the Priority Mechanism in the Fieldbus Data Link Layer
CAVALIERI, Salvatore
;DI STEFANO, Antonella;MIRABELLA, Orazio
1991-01-01
Abstract
The behavior of the priority mechanism is evaluated with reference to the tokens CiT and DeT provided for in the DLL (Data Link Layer) protocol of the FieldBus architecture. The use of priorities in the access mechanism is assessed in terms of throughput and access delay. Two policies are considered for allocation of the bandwidth between the high- and low-priority channels. The first provides for a static subdivision of the time available for high- and low-priority acyclic traffic (by use of the DeT token). The second allows dynamic allocation of the available bandwidth between the two priorities (by use of the CiT token). Examination of the throughput for the two policies shows that the same values are only obtained when the first policy allocates at least 80% of the available bandwidth to high-priority traffic. This, however, systematically penalizes low-priority traffic, even when the amount of high-priority traffic is lower than the LAS (Link Active Scheduler) has estimated it to be through polling operations. The second policy, being self-adapting, allows bandwidth allocation to be optimized. The same considerations can be made for access delay.Reaxys Database Information|File | Dimensione | Formato | |
---|---|---|---|
IECON91.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Dimensione
466.22 kB
Formato
Adobe PDF
|
466.22 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.