Undirected neighborhood graph G N =(V N ,E N ) for a specific video object/channel • determined by connections among (monitored) peers p i ∈V N and their neighbors Directed video graph G=(V V ,E V ) with embedding V V ⊆ V N • if micro-flow of video chunk sequences is exchanged between e i ∈ V V and e j ∈ V V • extended to a flow graph by a capacity function c: V V x V V → IR and a monitored flow (rate) function f: V V x V V x T → IR of a (message) type t ∈ T