We study information theoretic models of interference networks that consist of K Base Station (BS) - Mobile Terminal (MT) pairs. Each BS is connected to the MT carrying the same index as well as L following MTs, where the connectivity parameter L >= 1. We fix the value of L and study large networks as K goes to infinity. We assume that each MT can be associated with Nc BSs, and these associations are determined by a cloud-based controller that has a global view of the network. An MT has to be associated with a BS, in order for the BS to transmit its message in the downlink, or decode its message in the uplink. In previous work, the cell associations that maximize the average uplink-downlink per user degrees of freedom (puDoF) were identified for the case when L=1. Further, when only the downlink is considered, the problem was settled for all values of L when we are restricted to use only zero-forcing interference cancellation schemes. In this work, we first propose puDoF inner bounds for arbitrary values of L when only the uplink is considered, and characterize the uplink puDoF value when only zero-forcing schemes are allowed. We then introduce new achievable average uplink-downlink puDoF values. We show that the new scheme is optimal for the range when Nc <= L/2 when we restrict our attention to zero forcing schemes. Additionally we conjecture that the having unity puDoF during uplink is optimal when Nc >= L.