@article{touch_baldine_dutta_finn_ford_jordan_massey_matta_papadopoulos_reiher_et al._2011, title={A Dynamic Recursive Unified Internet Design (DRUID)}, volume={55}, ISSN={["1872-7069"]}, DOI={10.1016/j.comnet.2010.12.016}, abstractNote={The Dynamic Recursive Unified Internet Design (DRUID) is a future Internet design that unifies overlay networks with conventional layered network architectures. DRUID is based on the fundamental concept of recursion, enabling a simple and direct network architecture that unifies the data, control, management, and security aspects of the current Internet, leading to a more trustworthy network. DRUID’s architecture is based on a single recursive block that can adapt to support a variety of communication functions, including parameterized mechanisms for hard/soft state, flow and congestion control, sequence control, fragmentation and reassembly, compression, encryption, and error recovery. This recursion is guided by the structure of a graph of translation tables that help compartmentalize the scope of various functions and identifier spaces, while relating these spaces for resource discovery, resolution, and routing. The graph also organizes persistent state that coordinates behavior between individual data events (e.g., coordinating packets as a connection), among different associations (e.g., between connections), as well as helping optimize the recursive discovery process through caching, and supporting prefetching and distributed pre-coordination. This paper describes the DRUID architecture composed of these three parts (recursive block, translation tables, persistent state), and highlights its goals and benefits, including unifying the data, control, management, and security planes currently considered orthogonal aspects of network architecture.}, number={4}, journal={COMPUTER NETWORKS}, author={Touch, Joe and Baldine, Ilia and Dutta, Rudra and Finn, Gregory G. and Ford, Bryan and Jordan, Scott and Massey, Dan and Matta, Abraham and Papadopoulos, Christos and Reiher, Peter and et al.}, year={2011}, month={Mar}, pages={919–935} }
 @article{rouskas_baldine_1997, title={Multicast routing with end-to-end delay and delay variation constraints}, volume={15}, ISSN={["0733-8716"]}, DOI={10.1109/49.564133}, abstractNote={We study the problem or constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: (1) bounded delay along the paths from the source to each destination and (2) bounded variation among the delays along these paths. We first establish that the problem of determining such a constrained tree is NP-complete. We then present a heuristic that demonstrates good average case behavior in terms of the maximum interdestination delay variation. The heuristic achieves its best performance under conditions typical of multicast scenarios in high speed networks. We also show that it is possible to dynamically reorganize the initial tree in response to changes in the destination set, in a way that is minimally disruptive to the multicast session.}, number={3}, journal={IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS}, author={Rouskas, GN and Baldine, I}, year={1997}, month={Apr}, pages={346–356} }