This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Utility Accrual Channel Establishment in Multihop Networks
April 2006 (vol. 55 no. 4)
pp. 428-442
ASCII Text
x 
 
Karthik Channakeshava, Binoy Ravindran, E. Douglas Jensen, "Utility Accrual Channel Establishment in Multihop Networks," IEEE Transactions on Computers, vol. 55, no. 4, pp. 428-442, April, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TC.2006.62,
author = {Karthik Channakeshava and Binoy Ravindran and E. Douglas Jensen},
title = {Utility Accrual Channel Establishment in Multihop Networks},
journal ={IEEE Transactions on Computers},
volume = {55},
number = {4},
issn = {0018-9340},
year = {2006},
pages = {428-442},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.62},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Utility Accrual Channel Establishment in Multihop Networks
IS - 4
SN - 0018-9340
SP428
EP442
EPD - 428-442
A1 - Karthik Channakeshava,
A1 - Binoy Ravindran,
A1 - E. Douglas Jensen,
PY - 2006
KW - Real-time systems
KW - multihop networks
KW - real-time channels
KW - time/utility functions.
VL - 55
JA - IEEE Transactions on Computers
ER -
 
We consider Real-Time CORBA 1.2 (Dynamic Scheduling) distributable threads operating in multihop networks. When distributable threads are subject to time/utility function-time constraints, and timeliness optimality criteria such as maximizing accrued system-wide utility is desired, utility accrual real-time channels must be established. Such channels transport messages that are generated as distributable threads transcend nodes, in a way that maximizes system-wide, message-level utility. We present 1) a localized utility accrual channel establishment algorithm called Localized Decision for Utility accrual Channel Establishment (or LocDUCE) and 2) a distributed utility accrual channel establishment algorithm called Global Decision for Utility accrual Channel Establishment (or GloDUCE). Since the channel establishment problem is {\cal N}{\cal P}{\hbox{-}}{\rm complete}, LocDUCE and GloDUCE heuristically compute channels, with LocDUCE making decisions based on local information pertaining to the node and GloDUCE making global decisions. We simulate the performance of the algorithms and compare them with the Open Shortest Path First (OSPF) routing algorithm and the optimal algorithm. We also implement these algorithms in a prototype testbed and experimentally compare their performance with OSPF. Our simulation and experimental measurements reveal that GloDUCE and LocDUCE accrue significantly higher utility than OSPF and also perform close to the optimal for some cases. Furthermore, GloDUCE outperforms LocDUCE under high downstream traffic.

[1] OMG, “Real-Time CORBA 2.0: Dynamic Scheduling Specification,” technical report, Object Management Group, Sept. 2001, OMG Final Adopted Specification, http://www.omg.org/docs/ptc01-08-34.pdf.
[2] E.D. Jensen, A. Wellings, R. Clark, and D. Wells, “The Distributed Real-Time Specification for Java: A Status Report,” Proc. Embedded Systems Conf., 2002.
[3] J.D. Northcutt, Mechanisms for Reliable Distributed Real-Time Operating Systems— The Alpha Kernel. Academic Press, 1987.
[4] The Open Group Research Inst.'s Real-Time Group, MK7.3a Release Notes. Cambridge, Mass.: The Open Group Research Inst., Oct. 1998.
[5] GlobalSecurity.org, “Multi-Platform Radar Technology Insertion Program,” http://www.globalsecurity.org/intell/systems mp-rtip.htm/, Apr. 2005.
[6] GlobalSecurity.org, “BMC3I Battle Management, Command, Control, Communications and Intelligence,” http://www.global security.org/space/systems bmc3i.htm/, Apr. 2005.
[7] W. Horn, “Some Simple Scheduling Algorithms,” Naval Research Logistics Quarterly, vol. 21, pp. 177-185, 1974.
[8] E.D. Jensen, C.D. Locke, and H. Tokuda, “A Time-Driven Scheduling Model for Real-Time Systems,” Proc. IEEE Real-Time Systems Symp. (RTSS), pp. 112-122, 1985.
[9] R. Clark et al., “An Adaptive, Distributed Airborne Tracking System,” Proc. Workshop Parallel and Distributed Real-Time Systems (WPDRTS), pp. 353-362, Apr. 1999.
[10] D. Maynard et al., “An Example Real-Time Command, Control, and Battle Management Application for Alpha,” technical report, Computer Science Dept., Carnegie Mellon Univ., Dec. 1988.
[11] P. Li, “Utility Accrual Real-Time Scheduling: Models and Algorithms,” PhD dissertation, Virginia Tech, 2004.
[12] C.D. Locke, “Best-Effort Decision Making for Real-Time Scheduling,” PhD dissertation, Carnegie Mellon Univ., 1986.
[13] R. Clark, “Scheduling Dependent Real-Time Activities,” PhD dissertation, Carnegie Mellon Univ., 1990.
[14] J. Wang and B. Ravindran, “Time-Utility Function-Driven Switched Ethernet: Packet Scheduling Algorithm, Implementation, and Feasibility Analysis,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 1, Jan. 2004.
[15] H. Wu, B. Ravindran, E.D. Jensen, and U. Balli, “Utility Accrual Scheduling under Arbitrary Time/Utility Functions and Multiunit Resource Constraints,” Proc. IEEE Int'l Conf. Embedded Systems and Real-Time Computing Systems and Applications (RTCSA), pp. 80-98, Aug. 2004.
[16] D. Ferrari and D.C. Verma, “A Scheme for Real-Time Channel Establishment in Wide Area Networks,” IEEE J. Selected Areas in Comm., vol. 8, no. 3, pp. 368-379, Apr. 1990.
[17] V. Kompella, “Multicast Routing Algorithms for Multimedia Traffic,” PhD dissertation, Univ. of California, San Diego, 1993.
[18] D.D. Kandlur, K.G. Shin, and D. Ferrari, “Real-Time Communication in Multi-Hop Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 10, pp. 1044-1056, Oct. 1994.
[19] G. Manimaran, H.S. Rahul, and C.S. R. Murthy, “A New Distributed Route Selection Approach for Channel Establishment in Real-Time Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 5, pp. 698-709, Oct. 1999.
[20] K.G. Shin, C. Chou, and S. Kweon, “Distributed Route Selection for Establishing Real-Time Channels,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 3, pp. 318-335, Mar. 2000.
[21] G.L. Lann, “Proof-Based System Engineering and Embedded Systems,” Lecture Notes on Computer Science, G. Rozenberg and F. Vaandrager, eds., vol. 1494, pp. 208-248. Springer-Verlag, Oct. 1998.
[22] K. Channakeshava and B. Ravindran, “On Utility Accrual Channel Establishment in Multi-Hop Networks,” Proc. IEEE Int'l Symp. Object-Oriented Real-Time Distributed Computing (ISORC), pp. 277-284, May 2004.
[23] K. Chen and P. Muhlethaler, “A Scheduling Algorithm for Tasks Described by Time Value Function,” J. Real-Time Systems, vol. 10, no. 3, pp. 293-312, May 1996.
[24] K. Channakeshava, “Utility Accrual Real-Time Channel Establishment in Multi-Hop Networks,” master's thesis, Virginia Tech, Aug. 2003, http://scholar.lib.vt.edu/theses/available etd-0322004-173216/.
[25] S. Han and K.G. Shin, “A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multi-Hop Networks,” IEEE Trans. Computers, vol. 47, no. 1, pp. 46-61, Jan. 1998.
[26] S. Raghavan, G. Manimaran, and C.S.R. Murthy, “An Integrated Scheme for Establishing Dependable Real-Time Channels in Multi-Hop Networks,” Proc. Eighth Int'l Conf. Computer Comm. and Networks (ICCCN), Oct. 1999.
[27] K.P. Gummadi, M.J. Pradeep, and C.S. R. Murthy, “An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 81-94, Feb. 2003.

Index Terms:
Real-time systems, multihop networks, real-time channels, time/utility functions.
Citation:
Karthik Channakeshava, Binoy Ravindran, E. Douglas Jensen, "Utility Accrual Channel Establishment in Multihop Networks," IEEE Transactions on Computers, vol. 55, no. 4, pp. 428-442, April 2006, doi:10.1109/TC.2006.62
Usage of this product signifies your acceptance of the Terms of Use.