Network traffic classification is a critical concern in network security and management, essential for accurately differentiating among various network applications, optimizing service quality, and improving user experience. The exponential increase in worldwide Internet users and network traffic is continuously augmenting the diversity and complexity of network applications, rendering the Internet environment increasingly intricate and dynamic. Conventional machine learning techniques possess restricted processing abilities for network traffic attributes and struggle to address the progressively intricate traffic classification tasks in contemporary networks. In recent years, the swift advancement of deep learning technologies, particularly Graph Neural Networks (GNN), has yielded significant improvements in network traffic classification. GNN can capture the structured information among network nodes and extract the latent features of network traffic. Nonetheless, current network traffic classification models continue to exhibit deficiencies in the thoroughness of feature extraction. To tackle the problem, this research proposes a method for constructing traffic graphs utilizing numerical similarity and byte distance proximity by exploring the latent correlations among bytes, and it constructs a model, SDA-GNN, based on Graph Isomorphic Networks (GIN) for the categorization of network traffic. In particular, the Dynamic Time Warping (DTW) distance is employed to evaluate the disparity in byte distributions, a channel attention mechanism is utilized to extract additional features, and a Long Short-Term Memory Network (LSTM) enhances the stability of the training process by extracting sequence characteristics. Experimental findings on two actual datasets indicate that the SDA-GNN model surpasses other baseline techniques across multiple assessment parameters in the network traffic classification task, achieving classification accuracy enhancements of 2.19% and 1.49%, respectively. © (2024), (International Association of Engineers). All rights reserved.