Managing a portfolio of overlay paths

In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneously. We consider the problem of computing a set of paths and the relative amounts of data conveyed through them in order to provide the desired level of performance for data streams. Given the expectation, variance, and covariance of an appropriate metric of interest for overlay links, we attempt to solve the underlying resource allocation problem by applying methods used in managing a finance portfolio. We observe that the flow allocation problem requires constrained application of these methods, and we discuss the tractability of enforcing the constraints. We finally present some simulation results to evaluate the effectiveness of our proposed techniques. Categories and Subject Descriptors C.2.2 [Computer Communication Networks]: Network Protocols—Applications, routing protocols General Terms Algorith...

• Type: Conference
• Year: 2004
• Where: NOSSDAV
• Authors: Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ravi Sundaram
• Keywords: Allocation Problem, NOSSDAV 2004, Operating Systems, Resource Allocation Problem, flow Allocation Problem