AdSCHE: DESIGN OF AN AUCTION-BASED FRAMEWORK FOR DECENTRALIZED SCHEDULING

摘要: Decentralized scheduling is one of the newly emerged avenues in research. It concerned with allocating resources to alternative possible uses over time, where competing are represented by autonomous agents. Compared classical models, decentralized characterized distribution knowledge and control, which introduces new levels complexities, namely coordination complexity due interaction problems among agents mechanism design self-interested nature These complexities intertwine need be addressed concurrently. This paper presents an auction-based framework tackles through integrating iterative bidding protocol, a requirement-based language, constraint-based winner determination approach. Without imposing time window discretization on language allows bidders bid for processing set jobs constraints. Prices can attached quality attributes schedules. The algorithm depth-first branch bound search. A constraint directed procedure used at each node verify feasibility allocation. implemented ascending auction protocol. Experimental results show that proposed exhibits improved computational properties compared general combinatorial auctions. case study applying media content narrowcasting also presented.