Greedy On-Line File Transfer Routing
نویسندگان
چکیده
We study the performance of a simple greedy on-line algorithm for routing large file transfers in a network. The goal of the algorithm is to minimize network congestion. We show that the competitive ratio of the greedy algorithm is O (
منابع مشابه
A Lower Bound for On-line File Transfer Routing and Scheduling
In this paper, we study the On-Line File Transfer Routing and Scheduling problem. Given a sequence of le transfer requests and a graph that represents a network, the problem is to determine both a route and schedule for each le transfer in the sequence so as to minimize a suitable objective function. We require that an algorithm be on-line in the sense that it must respond to each request in th...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملEnergy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کاملA Hint-based Locating & Routing Mechanism in Peer-to-Peer File Sharing Systems1
A hint-based file locating & routing mechanism was proposed to improve the performance of peer-to-peer file sharing systems. The framework was based on the Freenet document routing model with file location hints to enhance the performance of file searching and downloading. Experiment shows that the proposed mechanism improves the system performance by saving disk space, as well as reduces file ...
متن کامل