PGCTC:基于图对比学习的PCDN流量识别OA

With the increasing demand for large-scale content services,the PCDN architecture that inte-grates P2P mechanisms has significantly improved network resource utilization and reduced operational costs for content providers,thanks to its distributed content transmission mode and lower service costs.But at the cost of sacrificing the upstream bandwidth of home broadband users,PCDN seriously affects the Internet experience of broadband users across the entire network.Therefore,precise identification and effective control of PCDN traffic have become key issues that communication operators urgently need to address.However,PCDN traffic recognition faces three major challenges:hybridity,encryption,and homogenization,which make it difficult for traditional recognition methods to distinguish them finely.To address these challenges,this paper proposes a graph comparison learning method named PGCTC for PCDN traffic.This method mines inter stream structural dependencies to enhance the ability to express implicit semantics in encrypted communication.It models indirect collaborative relationships between neighboring nodes to effectively alleviate recognition interference caused by mixed flow of PCDN.Fur-ther,a graph comparison mechanism is introduced to enhance the fine-grained discrimination ability for homogeneous traffic,achieving unified modeling and accurate classification of encrypted flows,collab-orative flows,and homogeneous flows.Experimental results on the CICIDS2017 dataset and a self built real PCDN dataset show that our method outperforms existing comparison methods in all indicators,dem-onstrating good effectiveness and cross scenario generalization performance.