{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:51:55Z","timestamp":1743043915213,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319943008"},{"type":"electronic","value":"9783319943015"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94301-5_4","type":"book-chapter","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T12:37:59Z","timestamp":1529498279000},"page":"43-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Real-Time Analysis of Big Network Packet Streams by Learning the Likelihood of Trusted Sequences"],"prefix":"10.1007","author":[{"given":"John","family":"Yoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"DeBiase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,21]]},"reference":[{"key":"4_CR1","unstructured":"Cesare, S., Xiang, Y.: Classification of malware using structured control flow. In: Proceedings of 8th Australasian Symposium on Parallel and Distributed Computing, vol. 107 (2010)"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/1151659.1159952","volume":"36","author":"Sailesh Kumar","year":"2006","unstructured":"Kumar, S., Dhamapurikar, S., Yu, F., Crowley, P., Tumer, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: The ACM SIGCOMM Computer Communication Review, vol. 36, no. 4 (2006)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cascarano, N., Ciminiera, L., Risso, F.: Improving cost and accuracy of DPI traffic classifiers. In: Proceedings of ACM Symposium on Applied Computing, Switzerland (2010)","DOI":"10.1145\/1774088.1774223"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Miura, R., Takano, Y., Miwa, S., Inoue, T.: GINTATE: scalable and extensible deep packet inspection system for encrypted network traffic. In: Proceedings of ACM Conference on SoICT, Viet Nam (2017)","DOI":"10.1145\/3155133.3155152"},{"key":"4_CR5","unstructured":"Wireshark. http:\/\/www.wireshark.org. Accessed 15 Feb 2018"},{"key":"4_CR6","unstructured":"How to block traffic by country in the CSF firewall. https:\/\/www.liquidweb.com\/kb\/how-to-block-traffic-by-country-in-the-csf-firewall\/. Accessed 15 Feb 2018"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Caruccio, L., Deufemia, V., Polese, G.: Evolutionary mining of relaxed dependencies from big data collections. In: Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics (2017)","DOI":"10.1145\/3102254.3102259"},{"key":"4_CR8","unstructured":"https:\/\/www.metasploit.com\/. Accessed 22 Feb 2018"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"3753","DOI":"10.1109\/TNET.2017.2753044","volume":"25","author":"J Fan","year":"2017","unstructured":"Fan, J., Guan, C., Ren, K., Cui, Y., Qiao, C.: SPABox: safeguarding privacy during deep packet inspection at a MiddleBox. IEEE\/ACM Trans. Netw. 25, 3753\u20133766 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"4_CR10","unstructured":"Lin, Z.: TLS session resumption: full-speed and secure. https:\/\/blog.cloudflare.com\/tls-session-resumption-full-speed-and-secure\/. Accessed 9 Mar (2018)"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2377677.2377688","volume":"42","author":"Harjot Gill","year":"2012","unstructured":"Gill, H., Lin, D., Sarna, L., Mead, R., Lee, K., Loo, B.: SP4: scalable programmable packet processing platform. In: ACM SIGCOMM Computer Communication Review, October 2012","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"4_CR12","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Boston (1989)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Nareddy, S., Westover, E., Hillesland, K., Kim, W.: Genome dynamics in coevolved genomes: database management system for tracing mutations. In: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, pp. 633\u2013634 (2014)","DOI":"10.1145\/2649387.2660810"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Bogard, J.: A probabilistic functional crossover operator for genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 925\u2013931 (2010)","DOI":"10.1145\/1830483.1830649"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BFb0040820","volume-title":"Evolutionary Programming VII","author":"SA Stanhope","year":"1998","unstructured":"Stanhope, S.A., Daida, J.M.: Optimal mutation and crossover rates for a genetic algorithm operating in a dynamic environment. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) EP 1998. LNCS, vol. 1447, pp. 693\u2013702. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0040820"},{"key":"4_CR16","unstructured":"http:\/\/www.obitko.com\/tutorials\/genetic-algorithms\/recommendations.php. Accessed 28 Jan 2016"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"LeFevre, J., Sankaranarayanan, J., Hacigumus, H., Tatemura, J., Polyzotis, N.: Towards a workload for evolutionary analytics. In: Proceedings of the 2nd Workshop on Data Analytics in the Cloud (2013)","DOI":"10.1145\/2486767.2486773"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F., Cao, Y., Deng, T., Lu, P.: Querying big data by accessing small data. In: ACM Symposium of Principles of Database Systems, pp. 173\u2013184 (2015)","DOI":"10.1145\/2745754.2745771"},{"key":"4_CR19","unstructured":"http:\/\/eoddata.com\/default.aspx. Accessed 29 Jan 2016"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"The R project for statistical computing. https:\/\/www.r-project.org\/. Accessed 29 Jan 2016","DOI":"10.1201\/EBK1439838631-9"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Tumoyan, E., Kavchuk, D.: The method of optimizing the automatic vulnerability validation. In: Proceedings of the 5th International Conference on Security of Information and Networks (2012)","DOI":"10.1145\/2388576.2388586"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Bergmann, K., Scheidler, R., Jacob, C.: Cryptanalysis using genetic algorithms. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, July 2008","DOI":"10.1145\/1389095.1389297"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Hoque, M., Mukit, M., Bikas, M.: An implementation of intrusion detection system using genetic algorithm. Int. J. Netw. Secur. Appl. 4 (2012)","DOI":"10.5121\/ijnsa.2012.4208"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.3923\/itj.2013.2167.2173","volume":"12","author":"M Hashemi","year":"2013","unstructured":"Hashemi, M., Muda, Z., Yassin, W.: Improving intrusion detection using genetic algorithm. Inf. Technol. J. 12, 2167\u20132173 (2013)","journal-title":"Inf. Technol. J."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Khan, A., Gleich, D., Pothen, A., Halappanavar, M.: A multithreaded algorithm for network alignment via approximate matching. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (2012)","DOI":"10.1109\/SC.2012.8"},{"key":"4_CR26","unstructured":"RFC Sourcebook, TCP\/UDP ports. http:\/\/www.networksorcery.com. Accessed 1 Mar 2018"}],"container-title":["Lecture Notes in Computer Science","Big Data \u2013 BigData 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94301-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:32:58Z","timestamp":1710232378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94301-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319943008","9783319943015"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94301-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIGDATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigdata2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.bigdatacongress.org\/2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"www.confhub.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"97","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}