Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks

摘要

This paper studies the issue of assigning orientations to all links of an undirected network, which is called the link-orientation problem (LOP). First, we describe some practical variations and address some complexity analysis in LOPs for general networks. Then, we design efficient algorithms to solve these LOPs issues. The proposed approach employs the recursive shortest path rules and the efficient cost cores scheme to resolve the LOP issues for some weighted network systems. These classes of networks include multi-square, convex-bipartite, and convex-split networks. Next, we use the cost core algorithm for adjusting LOP and obtain the more efficient LOP for the weighted convex-bipartite and convex-split networks. In general, the LOP scheme can support the actual applications requirements to realize a WFQ (weighted fair queuing) task for multicast routing in real networks. Finally, the findings of this paper can be mainly applied to some network applications, including efficient revision of load balancing in a ATM switch network, quick selection of a firm's PCS (Proxy Cache Server) on the Web, and dynamic adjusting of link's changing conditions in a workflow system on the Internet. (c) 2005 Elsevier Inc. All rights reserved.