ENDIST: Edge Node Divided Spanning Tree

Suh, Changjin; Kim, Kyungmi; Shin, Jisoo

doi:10.1109/icact.2008.4493877

Cited by 6 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A previous work named ENDIST [7] provides multiple routing paths from edge-node divided trees but may have serious overlapping in a symmetric DCN topology like Portland. Later, Disjoint-ENDIST (DENDIST) [8] is built upon ENDIST but provides a selection of disjoint paths for initializing a DCN.…”

Section: Background: Per-flow Routing In Sdnmentioning

confidence: 99%

“…As a result, rather than static routing, dynamic routing is shown a better choice for a SDN-based datacenter with better performance in many aspects. As cloud computing gets more prevalent, many related works [7] [8] [9] have been devoted to dynamic routing for providing better performance for datacenter networks (DCNs). However, as software-defined networking (SDN) emerges for per-flow routing, many of these algorithms become timeinefficient and even induce much overhead to the DCN.…”

Section: Udp Streaming In Spb Vs Swf In Sdnmentioning

confidence: 99%

“…SDN not only allows traditional L2/L3 routing functions, but also supports L4 to L7 identification for the control plane. Figure 1 illustrates the centralized controller to manage all network devices in SDN and enables dynamic routing that can be Many research works such as ENDIST [7], D 2 ENDIST [8] and DENDIST-FM [9] have been proposed to target the routing issue in DCNs. However, since ENDIST and D 2 ENDIST do not consider software-defined networking (SDN), once these algorithms are applied to a SDN-based network directly, their high complexities may lead to poor performance.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SWF: Segmented Wildcard Forwarding for flow migration in OpenFlow datacenter networks

Kuo

Wen

Suo

et al. 2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Networking and performance become major issues in cloud computing. Software Defined Networking (SDN) enables flow-level management and makes routing more effective and flexible for datacenter networks (DCNs). A prior dynamic routing algorithm named Flow Migration shows good results in improving throughput and avoiding congestion through simulation . However, as Flow Migration is applied to a SDN-based DCN, tremendous overhead occurs in modifying flow tables of switches. Therefore, a novel Segmented Wildcard Forwarding (SWF) scheme is proposed to facilitate Flow Migration. SWF leverages the symmetry of a Portland topology and applies wildcard matching for balancing network loading and lowering table-modification cost for flows. Experimental results show that on a Portland 4-8-8 datacenter network, the proposed SWF scheme achieves higher throughput over than the traditional SPB does, and even reduces ∼70% modification cost used by the original implementation of Flow Migration. As a result, Segmented Wildcard Forwarding (SWF) is proven a mechanism that practically realizes dynamic routing of SDN but also improves network performance as well as cost for flow migration, simultaneously.IEEE ICC 2015 SAC -Data Storage and Cloud Computing 978-1-4673-6432-4/15/$31.00 ©2015 IEEE

show abstract

Section: Background: Per-flow Routing In Sdnmentioning

confidence: 99%

Section: Udp Streaming In Spb Vs Swf In Sdnmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

SWF: Segmented Wildcard Forwarding for flow migration in OpenFlow datacenter networks

Kuo

Wen

Suo

et al. 2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…On the other hand, the routing research in cloud computing targets various performance perspectives under different applications and includes Hash-based routing (HBR) [2], ENDIST [4], and D 2 ENDIST [5]. HBR constructs a mapping of ports between downlinks and uplinks using a hash table to achieve load balancing.…”

Section: Introductionmentioning

confidence: 99%

D<sup>2</sup>ENDIST-FM: Flow migration in routing of OpenFlow-based cloud networks

Lin

Liu

Kuo

et al. 2013

2013 IEEE 2nd International Conference on Cloud Networking (CloudNet)

View full text Add to dashboard Cite

A prior layer-2 routing algorithm-D 2 ENDIST demonstrates advantages in throughput improvement, reroute period and failure recovery. Moreover, with the invention of software-defined networking (SDN), a revolutionary networking concept, dynamic routing protocols can embrace more flexible policy on per-flow basis. However, due to runtime complexity of dynamic routing, many issues on the practicality emerge and await to be resolved. Therefore, in this paper, we first apply D 2 ENDIST to a SDN architecture and compare performances between dynamic-routing and flow-control mechanisms in a OpenFlow-based cloud network. Then, the flow-migration (FM) scheme, showing a better flow-control management, can be combined with D 2 ENDIST, and evolved into D 2 ENDIST-FM. At last, experimental results demonstrate that D 2 ENDIST-FM enables better feasibility in real-world applications, throughput improvement, sensitivity to reroute period and reduction in failure recovery time. 978-1-4799-0568-3/13/$31.00 c 2013 IEEE

show abstract

D<sup>2</sup>ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters

Liu

Wen

Wang

2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

ENDIST: Edge Node Divided Spanning Tree

Cited by 6 publications

References 7 publications

SWF: Segmented Wildcard Forwarding for flow migration in OpenFlow datacenter networks

SWF: Segmented Wildcard Forwarding for flow migration in OpenFlow datacenter networks

D<sup>2</sup>ENDIST-FM: Flow migration in routing of OpenFlow-based cloud networks

D<sup>2</sup>ENDIST: Dynamic and disjoint ENDIST-based layer-2 routing algorithm for cloud datacenters

Contact Info

Product

Resources

About