Cologne: A Declarative Distributed Constraint Optimization Platform

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Liu, Changbin
Ren, Lu
Mao, Yun
Basu, Prithwish
Contributor
Abstract

This paper presents Cologne, a declarative optimization platform that enables constraint optimization problems (COPs) to be declaratively specified and incrementally executed in distributed systems. Cologne integrates a declarative networking engine with an off-theshelf constraint solver. We have developed the Colog language that combines distributed Datalog used in declarative networking with language constructs for specifying goals and constraints used in COPs. Cologne uses novel query processing strategies for processing Colog programs, by combining the use of bottom-up distributed Datalog evaluation with top-down goal-oriented constraint solving. Using case studies based on cloud and wireless network optimizations, we demonstrate that Cologne (1) can flexibly support a wide range of policy-based optimizations in distributed systems, (2) results in orders of magnitude less code compared to imperative implementations, and (3) is highly efficient with low overhead and fast convergence times.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2012-01-01
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Liu, C., Ren, L., Loo, B., Mao, Y., & Basu, P., Cologne: A Declarative Distributed Constraint Optimization Platform, Journal Article, 2012, doi: http://arxiv.org/abs/1204.6080
Recommended citation
Collection