On utility accrual real-time channel establishment in multi-hop networks

We consider real-time CORBA 2.0 (dynamic scheduling) distributable threads operating in multihop networks. When distributable threads are subject to time/utility function-time constraints and utility accrual optimality criteria, utility accrual real-time channels must be established. Such channels transport inter-node messages of distributable threads in a way that maximizes system-wide, message-level accrued utility. We present a utility accrual channel establishment algorithm called local decision for utility accrual channel establishment (or Loc-DUCE) that heuristically computes channels. Our experimental measurements using a prototype implementation reveal that LocDUCE accrues significantly higher utility than the open shortest path first routing algorithm