Operations on Traffic Plans

Abstract

This chapter is devoted to a series of elementary operations permitting to combine traffic plans into new ones. New traffic plans can be built by restriction, concatenation, union, and hierarchical concatenation. These technical tools were introduced in [13]. The hierarchical concatenation gives a standard way to explicitly construct infinite irrigation trees, or patterns. Incidentally three elementary assumptions will be justified by their lack of incidence on the search of optimal traffic plans: X can be taken convex, the mass of χ can always be taken equal to one, and we can get rid of zero-length fibers.