A Traffic Splitting Algorithm Based on Dual Hash Table for Multi-path Internet Routing

Bu, Youjun; Guo, Hong; Hu, Hongchao; Wang, Binqiang

doi:10.1109/mvhi.2010.20

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar research can be seen in a large number of cross-layer references [6,33,34]. Finally, in practical applications, the packet rearrangement problem can be solved by per-flow traffic splitting methods such as DHTC [35] or a flow cache [36]. Aside from that, we can also use the techniques in THR [32] and FLARE [37] to mitigate packet reordering.…”

Section: Sc K Mmentioning

confidence: 76%

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

2021

View full text Add to dashboard Cite

Due to overlay technologies, service providers have a logical view of the underlay network and can optimize the experience quality without modifying the physical network. However, the cross-layer interaction inevitably causes network fluctuation due to their inconsistent optimization objectives. Aside from that, network failures that occur in both layers not only cause network performance degradation but also significantly increase the frequency of cross-layer interaction. These problems make the network fluctuate for a long time, reduce the network performance, and influence the user experience, especially for time-sensitive applications. In this paper, we design a cross-layer architecture in which the logical layer can satisfy the service function chain demands and maximize the user experience and physical layer so it can optimize the overall network performance. Our cross-layer architecture can make proactive corrections in both layers. Furthermore, we investigate the cross-layer interaction and design two strategies to eliminate fluctuations and make the network converge quickly.

show abstract

Section: Sc K Mmentioning

confidence: 76%

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

2021

View full text Add to dashboard Cite

show abstract

“…In [5], through the comparison between the tree and the distributed hash table, the conclusion can be draw that the DHT structure is better because of its superior scalability and better resiliency. Bu et al [6] propose a traffic splitting algorithm based on dual hash table which work on the flow level to avoid packet reordering.…”

Section: Introductionmentioning

confidence: 99%

A Fast Connection Construction and Update Algorithm

Liu

2013

AMR

View full text Add to dashboard Cite

In the research area of network security, we often need to analyze the Internet traffic in real time. But the Internet traffic is usually very heavy, so it is very hard for us to analysis each packet one by one. Alternatively, analyzing the Internet traffic on flow level is often employed. Before analyzing the traffic flows, how we can fast construct and update these flows is a key issue. To solve this issue, in this paper, we propose a fast connection construction and update algorithm. Firstly, we define bidirectional flows as connection. Then, we use hash table to store the connection records and use this connection construction and update algorithm to ensure that these connection records can to be stored in memory in heavy traffic environment to achieve real-time traffic analysis. At last, the experiments show that the algorithm we proposed is efficient and can meet the traffic analysis need.

show abstract

A Traffic Splitting Algorithm Based on Dual Hash Table for Multi-path Internet Routing

Cited by 2 publications

References 12 publications

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

Robust and Fast Converging Cross-Layer Failure Correction in Segment-Routed Networks

A Fast Connection Construction and Update Algorithm

Contact Info

Product

Resources

About