dc.contributor.author |
Leligou, H-C |
en |
dc.contributor.author |
Angelopoulos, JD |
en |
dc.contributor.author |
Linardakis, C |
en |
dc.contributor.author |
Stavdas, A |
en |
dc.date.accessioned |
2014-03-01T01:19:45Z |
|
dc.date.available |
2014-03-01T01:19:45Z |
|
dc.date.issued |
2004 |
en |
dc.identifier.issn |
1389-1286 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/15698 |
|
dc.subject |
Access arbitration |
en |
dc.subject |
Access priorities |
en |
dc.subject |
MAC protocol |
en |
dc.subject |
Metropolitan rings |
en |
dc.subject |
QoS |
en |
dc.subject |
WDM |
en |
dc.subject.classification |
Computer Science, Hardware & Architecture |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.classification |
Telecommunications |
en |
dc.subject.other |
Bandwidth |
en |
dc.subject.other |
Closed loop control systems |
en |
dc.subject.other |
Computer simulation |
en |
dc.subject.other |
Interfaces (computer) |
en |
dc.subject.other |
Network protocols |
en |
dc.subject.other |
Quality of service |
en |
dc.subject.other |
Telecommunication traffic |
en |
dc.subject.other |
Wavelength division multiplexing |
en |
dc.subject.other |
Wide area networks |
en |
dc.subject.other |
Access arbitration |
en |
dc.subject.other |
Metropolitan rings |
en |
dc.subject.other |
Metropolitan area networks |
en |
dc.title |
A MAC protocol for efficient multiplexing QoS-sensitive and best-effort traffic in dynamically configurable WDM rings |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1016/j.comnet.2003.09.005 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1016/j.comnet.2003.09.005 |
en |
heal.language |
English |
en |
heal.publicationDate |
2004 |
en |
heal.abstract |
Slotted dynamically re-configurable Metropolitan rings are viewed as a viable alternative to WDM channel over-provisioning since they allow statistical sharing between the channels. A challenge these networks are facing is to simultaneously transport both delay sensitive and best-effort traffic. In this work, a strategy for mixing up different QoS classes efficiently in a dynamically re-configurable ring is proposed. The scheme is based on explicit class reservations for the delay-sensitive first priority traffic, which are allowed to fluctuate in accordance with demand. In contrast, best effort traffic is using only any bandwidth left over by the high QoS traffic, thus exploiting the elastic behaviour of best-effort traffic and its closed loop control. The performance of the proposed mechanism is evaluated via simulations demonstrating access delay below the round trip time for high priority traffic and good overall system efficiency by filling any spare capacity with best-effort traffic, which was buffered during busy periods. (C) 2003 Elsevier B.V. All rights reserved. |
en |
heal.publisher |
ELSEVIER SCIENCE BV |
en |
heal.journalName |
Computer Networks |
en |
dc.identifier.doi |
10.1016/j.comnet.2003.09.005 |
en |
dc.identifier.isi |
ISI:000188292900003 |
en |
dc.identifier.volume |
44 |
en |
dc.identifier.issue |
3 |
en |
dc.identifier.spage |
305 |
en |
dc.identifier.epage |
317 |
en |