TY - GEN
T1 - How to split a flow?
AU - Hartman, Tzvika
AU - Hassidim, Avinatan
AU - Kaplan, Haim
AU - Raz, Danny
AU - Segalov, Michal
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84861601370&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195830
DO - 10.1109/INFCOM.2012.6195830
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84861601370
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 828
EP - 836
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -