How to split a flow?

Tzvika Hartman, Avinatan Hassidim, Haim Kaplan, Danny Raz, Michal Segalov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Many practically deployed flow algorithms produce the output as a set of values associated with the network links. However, to actually deploy a flow in a network we often need to represent it as a set of paths between the source and destination nodes.

Original languageEnglish
Title of host publication2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Pages828-836
Number of pages9
DOIs
StatePublished - 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: 25 Mar 201230 Mar 2012

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

ConferenceIEEE Conference on Computer Communications, INFOCOM 2012
Country/TerritoryUnited States
CityOrlando, FL
Period25/03/1230/03/12

Fingerprint

Dive into the research topics of 'How to split a flow?'. Together they form a unique fingerprint.

Cite this