Planning Heuristics for Efficient Data Movement on the Grid

Abstract

The paper describes a constraint programming approach for planning data transfers in computer networks, in particular some novel search heuristics.

Keywords

• Planning
• Heuristics
• Efficient
• Movement
• Grid