Introduction to algorithms
Algorithms for a core and k-tree core of a tree
Journal of Algorithms
Polynomial auction algorithms for shortest paths
Computational Optimization and Applications
Design and performance of a threshold-based load balancing scheme in an ATM switch
Computer Networks and ISDN Systems
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Understanding and improving TCP performance over networks with minimum rate guarantees
IEEE/ACM Transactions on Networking (TON)
Computer networks: a systems approach
Computer networks: a systems approach
Monitoring QoS distribution in multimedia networks
International Journal of Network Management
Performance models of a firm's proxy cache server
Decision Support Systems
A reflective infrastructure for workflow adaptability
Data & Knowledge Engineering
Challenges and approaches in providing QoS monitoring
International Journal of Network Management
QoS-Sensitive Flows: Issues in IP Packet Handling
IEEE Internet Computing
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput
IEEE/ACM Transactions on Networking (TON)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Information Sciences: an International Journal
Hi-index | 0.00 |
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.