{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:57:08Z","timestamp":1776113828067,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tsc.2026.3671484","type":"journal-article","created":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:58:26Z","timestamp":1773086306000},"page":"906-919","source":"Crossref","is-referenced-by-count":0,"title":["Adapting Large Language Models for Encrypted Traffic Analysis Services: An Efficient Realization With Mixture of LoRA Experts"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3537-1467","authenticated-orcid":false,"given":"Yi","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2990-2169","authenticated-orcid":false,"given":"Xiang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8045-4226","authenticated-orcid":false,"given":"Chengjun","family":"Cai","sequence":"additional","affiliation":[{"name":"Computer Science and Information Technology Center, City University of Hong Kong (Dongguan), Dongguan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3701-4946","authenticated-orcid":false,"given":"Xingliang","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, University of Melbourne, Parkville, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0547-315X","authenticated-orcid":false,"given":"Cong","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3457904"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3266757"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.40"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3447382"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/APNOMS.2014.6996569"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.100613.00161"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198257"},{"key":"ref8","article-title":"NetGPT: Generative pretrained transformer for network traffic","author":"Meng","year":"2023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512217"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3626111.3628196"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2899085"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3227500"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3215507"},{"key":"ref14","first-page":"499","article-title":"Encrypted application classification with convolutional neural network","volume-title":"Proc. IFIP Netw. Conf.","author":"Yang"},{"issue":"12","key":"ref15","first-page":"2745","article-title":"On inferring application protocol behaviors in encrypted network traffic","volume":"7","author":"Wright","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2478741"},{"key":"ref17","first-page":"525","article-title":"Multi-task learning as multi-objective optimization","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Sener"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3279427"},{"key":"ref19","first-page":"661","article-title":"Large language model adaptation for networking","volume-title":"Proc. ACM Conf. Special Int. Group Data Commun.","author":"Wu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00118"},{"issue":"8","key":"ref21","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI Blog"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.00280"},{"key":"ref24","first-page":"61501","article-title":"VisionLLM: Large language model is also an open-ended decoder for vision-centric tasks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref25","article-title":"Harnessing explanations: LLM-to-LM interpreter for enhanced text-attributed graph representation learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"He"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539314"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3489441"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00102"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25674"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3626111.3628183"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3583740.3626809"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tranpol.2024.03.006"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.23919\/ITUK50268.2020.9303204"},{"key":"ref34","first-page":"202","article-title":"Investigating the catastrophic forgetting in multimodal large language model fine-tuning","volume-title":"Proc. 1st Conf. Parsimony Learn.","author":"Zhai"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737507"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583227"},{"key":"ref37","article-title":"ChatGLM: A family of large language models from GLM-130B to GLM-4 all tools","author":"Team","year":"2024"},{"key":"ref38","article-title":"NUDT mobile traffic dataset","author":"Zhao","year":"2025"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/WACVW60836.2024.00106"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.63317\/5m6ctqrk686e"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3663363"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3618257.3624845"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN.2017.7899588"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.414"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3703155"},{"key":"ref46","article-title":"Adaptive budget allocation for parameter-efficient fine-tuning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.36227\/techrxiv.172055626.64129172\/v1","article-title":"A survey on mixture of experts","author":"Cai","year":"2024"},{"key":"ref48","first-page":"4624","article-title":"Demystifying softmax gating function in Gaussian mixture of experts","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nguyen"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657722"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24412"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.5220\/0005740704070414"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.5220\/0006105602530262"},{"key":"ref53","article-title":"DeepSeek-V2: A strong, economical, and efficient mixture-of-experts language model","author":"Liu","year":"2024"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.85"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/PST55820.2022.9851966"},{"key":"ref56","article-title":"LoRA: Low-rank adaptation of large language models","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hu"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4629386\/11479482\/11425822.pdf?arnumber=11425822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:37:07Z","timestamp":1776109027000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11425822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":56,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2026.3671484","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}