TY - GEN
T1 - GD-aggregate
T2 - 28th IEEE International Real-Time Systems Symposium, RTSS 2007
AU - Wang, Qixin
AU - Liu, Xue
AU - Hou, Jennifer
AU - Sha, Lui
PY - 2007
Y1 - 2007
N2 - The convergence of computer and physical world calls for next generation Wide Area Network (WAN) infrastructures for hard real-time and embedded applications. Such networks need virtual topologies to achieve scalability, configurability, and flexibility. Virtual topologies are made of virtual links, for which, the state-of-the-art building tool is Guaranteed Rate server based aggregates (GR-aggregates). However, common-practice weight assignment scheme couples GR-aggregate End-to-End (E2E) delay bound with aggregate's data throughput inverse proportionally. This is undesirable for many hard real-time embedded sensing/actuating applications, whose traffic has small data throughput but requires short E2E delay. We propose Guaranteed Delay server based aggregates (GD-aggregates), which allow assigning weights according to priorities instead of data throughput. This decouples E2E delay guarantee from data throughput, hence meets the needs of hard realtime embedded applications. In addition, GD-aggregates can be analyzed with simple closed form formulae, and can be easily planned with optimization tools.
AB - The convergence of computer and physical world calls for next generation Wide Area Network (WAN) infrastructures for hard real-time and embedded applications. Such networks need virtual topologies to achieve scalability, configurability, and flexibility. Virtual topologies are made of virtual links, for which, the state-of-the-art building tool is Guaranteed Rate server based aggregates (GR-aggregates). However, common-practice weight assignment scheme couples GR-aggregate End-to-End (E2E) delay bound with aggregate's data throughput inverse proportionally. This is undesirable for many hard real-time embedded sensing/actuating applications, whose traffic has small data throughput but requires short E2E delay. We propose Guaranteed Delay server based aggregates (GD-aggregates), which allow assigning weights according to priorities instead of data throughput. This decouples E2E delay guarantee from data throughput, hence meets the needs of hard realtime embedded applications. In addition, GD-aggregates can be analyzed with simple closed form formulae, and can be easily planned with optimization tools.
UR - http://www.scopus.com/inward/record.url?scp=48649089326&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48649089326&partnerID=8YFLogxK
U2 - 10.1109/RTSS.2007.8
DO - 10.1109/RTSS.2007.8
M3 - Conference contribution
AN - SCOPUS:48649089326
SN - 0769530621
SN - 9780769530628
T3 - Proceedings - Real-Time Systems Symposium
SP - 379
EP - 388
BT - Proceedings - 28th IEEE International Real-Time Systems Symposium, RTSS 2007
Y2 - 3 December 2007 through 6 December 2007
ER -