Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into k-rooted sibling trees. © 2013 Academic Publications, Ltd.