How to split a flow?

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

doi:10.1109/infcom.2012.6195830

Cited by 47 publications

(56 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 3: X' 'in each of the data defined in the previous definition 3 to calculate the corresponding influence, and finally take m' of the corresponding behavior of the corresponding data as the evaluation of the value of the user behavior E: (8) Because the evaluation method reflects the degree of influence of the user behavior and the change of the network state, the evaluation value is helpful to discover the users who cause the network state change, and can control, encourage or suspend the users with different influence and encounter the risk.…”

Section: User Behavior Assessment Processmentioning

confidence: 99%

The research on user behavior evaluation method for network state

Zhang¹,

Xu²

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

Section: User Behavior Assessment Processmentioning

confidence: 99%

The research on user behavior evaluation method for network state

Zhang¹,

Xu²

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

“…As in [26], the greedy algorithm is shown to have the best performance. The flow decomposition problem has also been studied in [14]. Its main contribution is an approximation algorithm that decomposes all but an ǫ-fraction of a flow into at most O(1/ǫ 2 ) times the smallest possible number of decomposed paths.…”

Section: Related Workmentioning

confidence: 99%

Optimizing Data Plane Resources for Multipath Flows

Nakibly

Cohen

Katzir

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In many modern networks, such as datacenters, optical networks, and MPLS, the delivery of a traffic flow with a certain bandwidth demand over a single network path is either not possible or not cost effective. In these cases, it is very often possible to improve the network's bandwidth utilization by splitting the traffic flow over multiple efficient paths. While using multiple paths for the same traffic flow increases the efficiency of the network, it consumes expensive forwarding resources from the network nodes, such as TCAM entries of Ethernet/MPLS switches and wavelengths/lightpaths of optical switches. In this paper we define several problems related to splitting a traffic flow over multiple paths while minimizing the consumption of forwarding resources, and present efficient algorithms for solving these problems.

show abstract

“…To tackle the second problem, the number of paths should be kept as low as possible, thus reducing the overhead caused by additional table entries and control messages [15]. A practical approach for embedding a virtual link into multiple paths can be achieved by using a multicommodity flow formulation.…”

Section: B Multipath Concernsmentioning

confidence: 99%

“…A practical approach for embedding a virtual link into multiple paths can be achieved by using a multicommodity flow formulation. Yet, although such approaches yield good solutions, they generate an unpredictable number of paths [15]. Therefore, any solution for assigning virtual links to multiple paths should be upper bounded, thus allowing better control over the outcome of the embedding phase.…”

Section: B Multipath Concernsmentioning

confidence: 99%

See 1 more Smart Citation

No more backups: Toward efficient embedding of survivable virtual networks

Oliveira

Marcon

Bays

et al. 2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Although network virtualization can improve security by isolating traffic from different networks, routers and links are still vulnerable to attacks on the underlying network. High capacity physical links, in particular, constitute good targets since they may be important for a large number of virtual networks. Previous work protects virtual networks by setting aside backup resources. Although effective, this solution increases the cost to infrastructure providers. In this paper, we present a virtual network embedding approach which enables resilience to attacks and efficiency in resource utilization. Our approach is two-folded: while a preventive strategy embeds virtual links into multiple substrate paths, a reactive strategy attempts to reallocate any capacity affected by an underlying DoS attack. Since the embedding problem is NP-Hard, we devise a Simulated Annealing meta-heuristic to solve it efficiently. Results show our solution can provide resilience to attacks at a lower cost.

show abstract

How to split a flow?

Cited by 47 publications

References 11 publications

The research on user behavior evaluation method for network state

The research on user behavior evaluation method for network state

Optimizing Data Plane Resources for Multipath Flows

No more backups: Toward efficient embedding of survivable virtual networks

Contact Info

Product

Resources

About