Sciweavers

Share
ICPP
2002
IEEE

BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks

10 years 29 days ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-level messages have endto-end timeliness requirements that are specified using Jensen's benefit functions. The objective of BPA is to maximize the aggregate message-Ievel benefit. The algorithm reasons that this objective can be achieved by maximizing aggregate packet-level benefit, where packets of messages are allowed to inherit benefit functions of their parent messages. BP A thus solves a non-preemptive packet scheduling problem. Since this problem is NP-hard, BPA heuristically computes packet schedules to maximize aggregate benefit, incurring a worst-case computational complexity of O(n2). This is better than the O(n3) complexity of the previously known best algorithm (called CMA) for the same problem. Further, our experimental studies show that BPA performs as good as CMA for a broad set of benefit...
Jinggang Wang, Binoy Ravindran
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where ICPP
Authors Jinggang Wang, Binoy Ravindran
Comments (0)
books