• Complex
  • Title
  • Author
  • Keyword
  • Abstract
  • Scholars
High Impact Results & Cited Count Trend for Year Keyword Cloud and Partner Relationship
Export Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 1 >
COIN: A fast packet inspection method over compressed traffic EI
期刊论文 | 2019 , 127 , 122-134 | Journal of Network and Computer Applications
Abstract&Keyword Cite

Abstract :

Matching multiple patterns simultaneously is a key technique in Deep Packet Inspection systems, such as firewall, Intrusion Detection Systems, etc. However, most web services nowadays tend to compress their traffic for less data transferring and better user experience, which has challenged the original multi-pattern matching method that work on raw content only. The straightforward solutions directly match decompressed data which multiply the data to be matched. The state-of-the-art works skip scanning some data in compressed segments, but still exist the redundant checking, which are not efficient enough. In this paper, we propose COmpression INspection (COIN) method for multi-pattern matching over compressed traffic. COIN does not recheck the patterns within compressed segment if it has been matched before, so as to further improve the performance of matching, we have collected real traffic data from Alexa top sites and performed the experiments. The evaluation results show that COIN achieves 20.3% and 17.0% in the average of improvement than the state-of-the-art approaches on the string and regular expression matching with real traffic and rule sets. © 2018 Elsevier Ltd

Keyword :

Data transferring Deep packet inspection Evaluation results Intrusion Detection Systems Multi-pattern matching Packet inspection Regular-expression matching State-of-the-art approach

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Sun, Xiuwen , Li, Hao , Zhao, Dan et al. COIN: A fast packet inspection method over compressed traffic [J]. | Journal of Network and Computer Applications , 2019 , 127 : 122-134 .
MLA Sun, Xiuwen et al. "COIN: A fast packet inspection method over compressed traffic" . | Journal of Network and Computer Applications 127 (2019) : 122-134 .
APA Sun, Xiuwen , Li, Hao , Zhao, Dan , Lu, Xingxing , Hou, Kaiyu , Hu, Chengchen . COIN: A fast packet inspection method over compressed traffic . | Journal of Network and Computer Applications , 2019 , 127 , 122-134 .
Export to NoteExpress RIS BibTex
CORA: Conflict Razor for Policies in SDN EI Scopus
会议论文 | 2018 , 2018-April , 423-431
Abstract&Keyword Cite

Abstract :

© 2018 IEEE. Software Defined Network (SDN) enables flexible update of network functions with a well-defined abstraction between the control and the data plane. However, multiple active network functions with the same priority will potentially trigger conflicts among policies with overlapped flow space, causing the flow table explosion. In contrast to the local switch conflict resolution schemes proposed by previous works, this paper tackles the same problem from a different angle and resolves the policy conflict problem by coordinating all switches under a global centralized view. Specifically, we propose COnflict RAzor (CORA), which tremendously reduces the storage cost of conflicting policies leveraging the global network information obtained in the controller. The basic idea of CORA is migrating policies causing large explosions across the network if necessary, while keeping the semantics equivalence. We prove CORA's NP hardness and propose a heuristic to efficiently search a near-optimal policy migration strategy. Our experiments demonstrate that, CORA can effectively reduce the flow table storage occupation by at least 49% within less than 40 seconds.

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Li, Hao , Chen, Kaiyue , Pan, Tian et al. CORA: Conflict Razor for Policies in SDN [C] . 2018 : 423-431 .
MLA Li, Hao et al. "CORA: Conflict Razor for Policies in SDN" . (2018) : 423-431 .
APA Li, Hao , Chen, Kaiyue , Pan, Tian , Zhou, Yadong , Qian, Kun , Zheng, Kai et al. CORA: Conflict Razor for Policies in SDN . (2018) : 423-431 .
Export to NoteExpress RIS BibTex
ShadowP4: Building and testing modular programs EI Scopus
会议论文 | 2018 , 150-152
Abstract&Keyword Cite

Keyword :

Code merge Programmable data plane Testing

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zheng, Peng , Benson, Theophilus , Hu, Chengchen . ShadowP4: Building and testing modular programs [C] . 2018 : 150-152 .
MLA Zheng, Peng et al. "ShadowP4: Building and testing modular programs" . (2018) : 150-152 .
APA Zheng, Peng , Benson, Theophilus , Hu, Chengchen . ShadowP4: Building and testing modular programs . (2018) : 150-152 .
Export to NoteExpress RIS BibTex
Routing Optimization for Server-Centric Data Center Networks SCIE Scopus
期刊论文 | 2016 , 13 (2) , 593-608 | COMPUTER SCIENCE AND INFORMATION SYSTEMS | IF: 0.837
Abstract&Keyword Cite

Abstract :

Server-centric data center architecture has been proposed to provide high throughput, scalable construction and error tolerance with commodity servers and switches for cloud data centers. To fully utilize those advantages of servercentric data center, an effective routing algorithm to find high quality multiple paths in Server-centric network is needed. However, current routing algorithms cannot achieve this completely: 1) the state-of-art routing algorithms in server-centric data center just consider hop count when selecting paths; 2) traditional multi-constraint QoS routing algorithms only find one feasible path and are usually switch-oriented; 3) present multi-path algorithms cannot guarantee the performance of the founded paths. In this paper, we propose a multi-constrained routing algorithm for servercentric data centers, named Server-Centric Multi-Constrained Routing Algorithm (SCRAT). This algorithm exploits the topology features of the Server-Centric data center to decrease the algorithm complexity and returns optimal and feasible paths simultaneously. In simulations, SCRAT has a very high probability (more than 96%) to find the exact optimal path, and the cost of the optimal path found in SCRAT is about 10% less compared with path found in previous TS MCOP. Compared with previous MPTCP, SCRAT reduces the path delay by 18% less and increase the bandwidth by 20%.

Keyword :

server-centric data center routing optimization

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Wang, Huanzhao , Qian, Kun , Hu, ChengChen et al. Routing Optimization for Server-Centric Data Center Networks [J]. | COMPUTER SCIENCE AND INFORMATION SYSTEMS , 2016 , 13 (2) : 593-608 .
MLA Wang, Huanzhao et al. "Routing Optimization for Server-Centric Data Center Networks" . | COMPUTER SCIENCE AND INFORMATION SYSTEMS 13 . 2 (2016) : 593-608 .
APA Wang, Huanzhao , Qian, Kun , Hu, ChengChen , Zhang, Che , Zhou, Yadong . Routing Optimization for Server-Centric Data Center Networks . | COMPUTER SCIENCE AND INFORMATION SYSTEMS , 2016 , 13 (2) , 593-608 .
Export to NoteExpress RIS BibTex
A mechanism of dynamic meter sharing on openflow switch EI Scopus CSCD PKU
期刊论文 | 2016 , 39 (6) , 1224-1236 | Jisuanji Xuebao/Chinese Journal of Computers
Abstract&Keyword Cite

Abstract :

Per-flow rate-limiting is one of quality of the service (QoS) challenge in networking system. It is difficult to find a method that is both quick and efficient to manage flows which need to be limited to different rates due to the limitation of hardware resources. However, in OpenFlow-1.3 specification, the Meter part describes the definition of per-flow rate limiting. According to the description of Meter, this paper provides a detailed implementation of Meter based on ONetSwitch hardware platform and verifies the performance through multiple groups of experiment. Through the statistic of flows in network, there are only 100 active flows in million network in-progress flows. Therefore, the per-flow rate limiting problem may be resolved through multiple flows time sharing hardware resources. Referencing the idea of Dynamic Queue Sharing (DQS), Dynamic Meter Sharing (DMS) was proposed in this paper to schedule among different flows that sharing the same rate limiting pipe, but during different period. However, the number of rate limiters is limited due to the limitation of hardware resources. When flow numbers exceed the number of rate limiters, it is unavoidable to allocate some flows to a shared rate limiter waiting for idle ones. Although the critical "per-flow rate limiting" is not achieved, Meter has an advantage over traditional rate limiting method. The results show that Meter allocate an independent rate limiter for per-flow, then realize limiting multiple flows in different rate. © 2016, Science Press. All right reserved.

Keyword :

Flows in networks Hardware platform Hardware resources Networking systems Next generation Internet ONetSwitch Openflow Openflow switches

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Yang, Ji , Xu, Chen , Gong, Zhi-Min et al. A mechanism of dynamic meter sharing on openflow switch [J]. | Jisuanji Xuebao/Chinese Journal of Computers , 2016 , 39 (6) : 1224-1236 .
MLA Yang, Ji et al. "A mechanism of dynamic meter sharing on openflow switch" . | Jisuanji Xuebao/Chinese Journal of Computers 39 . 6 (2016) : 1224-1236 .
APA Yang, Ji , Xu, Chen , Gong, Zhi-Min , Hu, Cheng-Chen , Guan, Xiao-Hong . A mechanism of dynamic meter sharing on openflow switch . | Jisuanji Xuebao/Chinese Journal of Computers , 2016 , 39 (6) , 1224-1236 .
Export to NoteExpress RIS BibTex
10| 20| 50 per page
< Page ,Total 1 >

Export

Results:

Selected

to

Format:
FAQ| About| Online/Total:2228/51351177
Address:XI'AN JIAOTONG UNIVERSITY LIBRARY(No.28, Xianning West Road, Xi'an, Shaanxi Post Code:710049) Contact Us:029-82667865
Copyright:XI'AN JIAOTONG UNIVERSITY LIBRARY Technical Support:Beijing Aegean Software Co., Ltd.