Traffic engineering of management flows by link augmentations on confluent trees

DOI10.1007/S00224-007-9010-0MaRDI QIDQ2471695zbMATH OpenOpenAlexFDO

Authors Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Joseph (Seffi) Naor, Baruch Schieber, Vahab S. Mirrokni

Publication date 18 February 2008

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-007-9010-0

zbMATH Keywords

Combinatorial optimizationConfluent flowsDynamic programmingManagement flowsNetwork managementTraffic engineering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Meet and merge: approximation algorithms for confluent flows
• scientific article; zbMATH DE number 2088478
• Meet and merge: approximation algorithms for confluent flows
• On-line traffic management in new generation computer networks
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows

Cites work

• (Almost) tight bounds and existence theorems for confluent flows
• An overtraining-resistant stochastic modeling method for pattern recognition
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Meet and merge: approximation algorithms for confluent flows

This page was built for publication: Traffic engineering of management flows by link augmentations on confluent trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471695)