Network realization problems require, given a specification for some network parameter (such as degrees, distances or connectivity), to construct a network G conforming to, or to determine that no such network exists. In this paper we study composed profile realization, where the given instance consists of two or more profile specifications that need to be realized simultaneously. To gain some understanding of the problem, we focus on two classical profile types, namely, degrees and distances, which were (separately) studied extensively in the past. We investigate a wide spectrum of variants of the composed distance & degree realization problem. For each variant we either give a polynomial-time realization algorithm or establish NP hardness. In particular: We consider both precise specifications and range specifications, which specify a range of permissible values for each entry of the profile.We consider realizations by both weighted and unweighted graphs.We also study settings where the realizing graph is restricted to specific graph classes, including trees and bipartite graphs.