How to split a flow?

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

doi:10.1109/INFCOM.2012.6195830

How to split a flow?

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

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Pages	828-836
Number of pages	9
DOIs	https://doi.org/10.1109/INFCOM.2012.6195830
State	Published - 2012
Event	IEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States Duration: 25 Mar 2012 → 30 Mar 2012

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Conference

Conference	IEEE Conference on Computer Communications, INFOCOM 2012
Country/Territory	United States
City	Orlando, FL
Period	25/03/12 → 30/03/12

Access to Document

10.1109/INFCOM.2012.6195830

Cite this

@inproceedings{a7b79369cd294b76bc8c025ca0a1d0c6,

title = "How to split a flow?",

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.",

author = "Tzvika Hartman and Avinatan Hassidim and Haim Kaplan and Danny Raz and Michal Segalov",

year = "2012",

doi = "10.1109/INFCOM.2012.6195830",

language = "אנגלית",

isbn = "9781467307758",

series = "Proceedings - IEEE INFOCOM",

pages = "828--836",