Abstraction and constraint satisfaction techniques for planning bandwidth allocation

Frei, C.; Faltings, Boi

doi:10.1109/infcom.2000.832193

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key idea of blocking island (BI) [9] is transforming the original network graph into a hierarchy tree which contains available bandwidth information. The benefits of applying blocking island for path searching is obvious: it reduces the routing path search space significantly with bandwidth guarantee.…”

Section: ) Blocking Island Paradigmmentioning

confidence: 99%

“…The forwarding rules are installed along the shortest paths between frequent pairs in advance. Blocking island paradigm [9] is also applied to CheetahFlow to make traffic adaptive routing for elephant flows. The advantage of this scheme is that most of the flows are forwarded in data plane without asking the controller to make decisions in real time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

CheetahFlow: Towards low latency software-defined network

Wang

Xia

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Software defined networking (SDN), which enables programmability, has the advantage of global visibility and high flexibility. However, when forwarding new flows in SDN, the interaction between the switch and the controller imposes extra latency such as round-trip time and routing path search time. Even though such latency is acceptable for elephant flows since it only takes limited ratio of total transmission time of elephant flows, it is an overkill to pay certain overheads for mice flows due to the their short transmission time. Moreover, the controller is frequently invoked by the mice flows since the number of mice flows accounts for a large portion of the total number of flows. Hence, the frequent controller invocation is mainly responsible for the controller performance degradation, and thus increasing the flow setup latency significantly. To solve this problem, we propose CheetahFlow, a novel scheme to predict frequent communication pairs via support vector machine and proactively setup wildcard rules to reduce flow setup latency. Particularly, in order to avoid congestion along a fixed path, elephant flows are detected and rerouted to the non-congestion path efficiently by applying blocking island paradigm. Extensive experiments show that CheetahFlow prominently reduces latency without any loss of flexibility of SDN.

show abstract

Section: ) Blocking Island Paradigmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

CheetahFlow: Towards low latency software-defined network

Wang

Xia

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…The IMCFP with capacity constraints is known to be NP-complete [6]. Attempts to solve IMCFPs can be found in [5,13,16].…”

Section: Related Problems and Approachesmentioning

confidence: 99%

“…An unsuccessful attempt means either the re-routed solution is rejected by the SA criteria, or re-routing fails because there is no possible path. 5 Re-route all demands. If local search could not restore consistency, it implies that it was trapped in a local optimum.…”

Section: Figure 3 Repair With Simulated Annealingmentioning

confidence: 99%

Approaches to the Subnet Generation Problem

Raza

Sastry

2007

19th IEEE International Conference on Tools With Artificial Intelligence(ICTAI 2007)

View full text Add to dashboard Cite

This paper introduces the subnet generation problem (SGP) which is a new type of network routing problem that is found, for example, in some peer-to-peer applications. We explore two algorithms to solve the SGP by exploiting its special structure. The first algorithm, the tree search algorithm (TS), is an adaptation of an existing algorithm. TS decomposes the SGP into a master problem solved by a systematic tree search, and a subproblem solved by incomplete but efficient heuristics. Our question is what happens if we sacrifice the complete search in the master problem in exchange for better exploration of the search space.In order to answer this, we present a second algorithm, the local search algorithm (LS), which replaces the tree search with non-systematic search in the master problem. The two algorithms are compared in an experimental study.

show abstract

“…• A more complete description can be found in [12]. The approach gives a unique network decomposition (and hence hierarchy AH(R)) for any network state R (see [3] for a proof). As the bandwidth resources on the links change over time (due to allocations and deallocations of network traffic) controllers detect this and update their organisational relationships by merging and splitting their regions:…”

Section: Adaptive I/c -Hierarchy (Ah)mentioning

confidence: 99%

Bandwidth adaptive hierarchies for on-line ATM quality of service routing

Willmott

Faltings

ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485)

Self Cite

View full text Add to dashboard Cite

On-line QoS routing in ATM networks involves challenging problems in the distribution of information and control. This paper presents a hierarchical routing architecture which adapts its own structure over time to match available bandwidth in the network. The adaptive hierarchy is shown to significantly outperform a similar static hierarchy in preliminary tests and comparisons with centralised and hop-by-hop routing approaches are also encouraging. The paper also discusses the relevance of matching the information model to the network state for standard (PNNI) hierarchical routing architectures.

show abstract

Abstraction and constraint satisfaction techniques for planning bandwidth allocation

Cited by 6 publications

References 14 publications

CheetahFlow: Towards low latency software-defined network

CheetahFlow: Towards low latency software-defined network

Approaches to the Subnet Generation Problem

Bandwidth adaptive hierarchies for on-line ATM quality of service routing

Contact Info

Product

Resources

About