[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_326b2596-f16f-4d0d-9bd6-09c73228413d":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:326b2596-f16f-4d0d-9bd6-09c73228413d,\"}":754},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":675,"manageAffiliations":692,"indexDatabases":713,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},"326b2596-f16f-4d0d-9bd6-09c73228413d","2023-05-29T11:45:47.006+00:00","2025-11-21T10:05:13.756+00:00",[],"Computer-Communication-Review",{"country":665,"issn":667,"introduce":669,"eissn":671,"title":673},{"VOID":666},"US",{"VOID":668},"19435819",{"EN":670},"Computer Communication Review (CCR) is an online publication of the ACM Special Interest Group on Data Communication (SIGCOMM) and publishes articles on topics within the SIG's field of interest. Technical papers accepted to CCR typically report on practical advances or the practical applications of theoretical advances. CCR serves as a forum for interesting and novel ideas at an early stage in their development. The focus is on timely dissemination of new ideas that may help trigger additional investigations. While the innovation and timeliness are the major criteria for its acceptance, technical robustness and readability will also be considered in the review process. We particularly encourage papers with early evaluation or feasibility studies.",{"VOID":672},"01464833",{"EN":674},"Computer Communication Review",[676,684],{"id":677,"createTime":678,"updateTime":679,"relativeEntities":680,"label":681,"description":683,"parentId":26,"standard":26,"scholarHubFieldId":26},"f0f0ec9c-bb68-4288-a6f1-ee3d47dc35eb","2023-05-29T10:24:08.348+00:00","2023-11-21T07:29:12.845+00:00",[],{"EN":682},"Computer Networks and Communications",{},{"id":685,"createTime":686,"updateTime":687,"relativeEntities":688,"label":689,"description":691,"parentId":26,"standard":26,"scholarHubFieldId":26},"aae089e7-8b62-4df4-ab86-aada3693b3f8","2023-05-29T10:24:07.736+00:00","2023-11-21T07:29:12.850+00:00",[],{"EN":690},"Software",{},[693,703],{"id":694,"createTime":695,"updateTime":696,"relativeEntities":697,"slug":698,"properties":699,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":702,"statistic":26},"e413bfb3-d7e1-44b7-91f5-e2c2169ea732","2023-05-29T12:06:10.964+00:00","2024-02-11T02:11:46.468+00:00",[],"ASSOC-COMPUTING-MACHINERY",{"title":700},{"EN":701},"ASSOC COMPUTING MACHINERY",[],{"id":704,"createTime":705,"updateTime":706,"relativeEntities":707,"slug":708,"properties":709,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"url":26,"parentIds":712,"statistic":26},"3e1064b5-61a8-4ca3-bf0f-108007c66507","2023-05-29T10:24:25.162+00:00","2025-11-21T10:07:07.489+00:00",[],"Association-for-Computing-Machinery-ACM-",{"title":710},{"EN":711},"Association for Computing Machinery (ACM)",[],[714,734],{"id":715,"indexDatabase":716,"url":728,"indexYears":729,"academicFieldIds":730,"indexDatabaseRanking":733},"1d333f2c-6fd7-42e3-8747-9e02753d8633",{"id":717,"createTime":718,"updateTime":719,"relativeEntities":720,"label":721,"description":723,"key":725,"publicationTags":726,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":722,"VI":722},"Scopus - Elsevier",{"EN":722,"VI":724},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[727],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F13683","1995-2025",[731,732],"f8ab36fc-bc72-48f2-a425-9f3e042f2272","b4ee5f56-1514-428f-b517-37576cea076b","SCOPUS__Q1",{"id":735,"indexDatabase":736,"url":750,"indexYears":26,"academicFieldIds":751,"indexDatabaseRanking":26},"36e3c6d7-28d0-4fa1-a031-4fb28952d0a0",{"id":737,"createTime":738,"updateTime":739,"relativeEntities":740,"label":741,"description":743,"key":746,"publicationTags":747,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":742,"VI":742},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":744,"EN":745},"Cơ sở dữ liệu SCIE","SCIE database","scie",[748,749],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0146-4833",[752],"5e7ab733-08f6-4bda-8a2e-55af36fcbd05","https:\u002F\u002Fwww.sigcomm.org\u002Fpublications\u002Fcomputer-communication-review",{"meta":755,"data":757},{"total":756},"18",[758,1101,1324,1534,1722,1884,2149,2360,2520,2732],{"id":759,"createTime":760,"updateTime":760,"relativeEntities":761,"slug":762,"properties":763,"entityType":775,"verifyStatus":25,"verifyTime":776,"verifyNote":777,"syncStatus":28,"languages":778,"translateLanguages":26,"viewCount":36,"primaryUrl":779,"fullTextUrl":26,"authors":780,"publicationType":961,"publisherRelationship":962,"citationCount":995,"citationInfo":996,"publishDate":1007,"publishYear":1008,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1009,"isForceReanalyzing":1100},"5c8c77cc-f54e-4c57-baf7-529238868c8f","2025-01-25T15:03:43.711+00:00",[],"Named-data-networking",{"mag":764,"keywords":766,"openalex":767,"abstract":769,"title":771,"doi":773},{"VOID":765},"2155903900",{},{"VOID":768},"W2155903900",{"EN":770},"\u003Cjats:p>\n            Named Data Networking (NDN) is one of five projects funded by the U.S. National Science Foundation under its Future Internet Architecture Program. NDN has its roots in an earlier project, Content-Centric Networking (CCN), which Van Jacobson first publicly presented in 2006. The NDN project investigates Jacobson's proposed evolution from today's host-centric network architecture (IP) to a\n            \u003Cjats:italic>data-centric\u003C\u002Fjats:italic>\n            network architecture (NDN). This conceptually simple shift has far-reaching implications for how we design, develop, deploy, and use networks and applications. We describe the motivation and vision of this new architecture, and its basic components and operations. We also provide a snapshot of its current design, development status, and research challenges. More information about the project, including prototype implementations, publications, and annual reports, is available on named-data.net.\n          \u003C\u002Fjats:p>",{"EN":772},"Named data networking",{"VOID":774},"10.1145\u002F2656877.2656887","PUBLICATION","2025-01-25T15:03:43.710+00:00","Auto Verify",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F2656877.2656887",[781,803,823,840,857,878,899,921,940],{"id":782,"sortIndex":135,"researcher":26,"roles":783,"affiliations":784,"properties":796},"01dc3e8b-bc83-4bad-a246-15d36964a7b0",[],[785],{"id":786,"sortIndex":36,"affiliation":787,"properties":26},"05fd103b-10ec-4328-bb5d-0468ef25e2f6",{"id":788,"createTime":789,"updateTime":790,"relativeEntities":791,"slug":792,"properties":793,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"c170a95c-822a-4bdf-9446-1b110ab90867","2024-01-15T16:10:43.938+00:00","2025-01-30T18:14:51.133+00:00",[],"Colorado-State-University-Fort-Collins-CO-USA",{"title":794},{"VI":795},"Colorado State University, Fort Collins, CO, USA",{"openalex":797,"orcid":799,"title":801},{"VOID":798},"A5105352599",{"VOID":800},"https:\u002F\u002Forcid.org\u002F0009-0008-3090-0540",{"EN":802},"Christos Papadopoulos",{"id":804,"sortIndex":114,"researcher":26,"roles":805,"affiliations":806,"properties":818},"50a0e11a-7be7-41c8-b300-9932d9448349",[],[807],{"id":808,"sortIndex":36,"affiliation":809,"properties":26},"42868e31-0bb9-4b29-9d3e-524646c46001",{"id":810,"createTime":811,"updateTime":812,"relativeEntities":813,"slug":814,"properties":815,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"4b189c9f-477f-4cfc-a478-a23f51058732","2024-02-08T05:48:59.168+00:00","2025-01-25T15:03:43.728+00:00",[],"UCLA-Los-Angeles-CA-USA",{"title":816},{"VI":817},"UCLA, Los Angeles, CA, USA",{"openalex":819,"title":821},{"VOID":820},"A5076857929",{"EN":822},"Jeffrey A Burke",{"id":824,"sortIndex":115,"researcher":26,"roles":825,"affiliations":826,"properties":833},"37cba0f4-bc40-46fd-a623-40965b5cda89",[],[827],{"id":828,"sortIndex":36,"affiliation":829,"properties":26},"5521cd13-a2ad-4dc5-8f2f-5c6d58d522d6",{"id":810,"createTime":811,"updateTime":812,"relativeEntities":830,"slug":814,"properties":831,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":832},{"VI":817},{"openalex":834,"orcid":836,"title":838},{"VOID":835},"A5063486829",{"VOID":837},"https:\u002F\u002Forcid.org\u002F0000-0003-0420-1267",{"EN":839},"Alexander Afanasyev",{"id":841,"sortIndex":36,"researcher":26,"roles":842,"affiliations":843,"properties":850},"00abd7ae-c05a-4a14-9099-65b7c5aac1ed",[],[844],{"id":845,"sortIndex":36,"affiliation":846,"properties":26},"ac24c958-e93c-4795-ab34-c96671b70b1f",{"id":810,"createTime":811,"updateTime":812,"relativeEntities":847,"slug":814,"properties":848,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":849},{"VI":817},{"openalex":851,"orcid":853,"title":855},{"VOID":852},"A5100350696",{"VOID":854},"https:\u002F\u002Forcid.org\u002F0000-0002-9471-4500",{"EN":856},"Lixia Zhang",{"id":858,"sortIndex":111,"researcher":26,"roles":859,"affiliations":860,"properties":871},"d979b1fa-b633-49d6-a697-76da7e1c87b0",[],[861],{"id":862,"sortIndex":36,"affiliation":863,"properties":26},"ca59481d-1f61-4ade-b78c-9f9b5f749775",{"id":864,"createTime":865,"updateTime":865,"relativeEntities":866,"slug":867,"properties":868,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"96c6ef5c-3462-431c-955a-2abb280cb54b","2025-01-25T15:03:43.770+00:00",[],"UC-San-Diego-La-Jolla-CA-USA",{"title":869},{"EN":870},"UC San Diego, La Jolla, CA, USA",{"openalex":872,"orcid":874,"title":876},{"VOID":873},"A5072282499",{"VOID":875},"https:\u002F\u002Forcid.org\u002F0000-0003-4824-3493",{"EN":877},"kc claffy",{"id":879,"sortIndex":158,"researcher":26,"roles":880,"affiliations":881,"properties":892},"a0e7de00-8eb6-4ba7-9a85-bd2377bc6611",[],[882],{"id":883,"sortIndex":36,"affiliation":884,"properties":26},"8fecf352-0ed8-444b-8b76-617c6f7e6ff2",{"id":885,"createTime":886,"updateTime":886,"relativeEntities":887,"slug":888,"properties":889,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3c58498a-1001-4cf7-afe0-bb1a13e34e4c","2025-01-25T15:03:43.807+00:00",[],"MemphisUniversity-Memphis-TN-USA",{"title":890},{"EN":891},"MemphisUniversity, Memphis, TN, USA",{"openalex":893,"orcid":895,"title":897},{"VOID":894},"A5100363636",{"VOID":896},"https:\u002F\u002Forcid.org\u002F0000-0001-7925-7957",{"EN":898},"Lan Wang",{"id":900,"sortIndex":50,"researcher":26,"roles":901,"affiliations":902,"properties":914},"181f73d4-980f-4d54-800f-47b6f38cad05",[],[903],{"id":904,"sortIndex":36,"affiliation":905,"properties":26},"dac7311d-ff72-4f20-9b95-5182874e6678",{"id":906,"createTime":907,"updateTime":908,"relativeEntities":909,"slug":910,"properties":911,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"15707279-b045-4a6b-93d8-11534442f556","2023-12-24T13:49:28.552+00:00","2025-02-05T01:19:52.798+00:00",[],"Arizona-State-University-Tempe-AZ-USA",{"title":912},{"VI":913},"Arizona State University, Tempe, AZ USA",{"openalex":915,"orcid":917,"title":919},{"VOID":916},"A5050010654",{"VOID":918},"https:\u002F\u002Forcid.org\u002F0009-0001-5333-8465",{"EN":920},"Beichuan Zhang",{"id":922,"sortIndex":59,"researcher":26,"roles":923,"affiliations":924,"properties":935},"5efde983-146d-4e80-be2f-fdc6987589f0",[],[925],{"id":926,"sortIndex":36,"affiliation":927,"properties":26},"7daa07cb-4a45-4613-b9b9-71ac6c275364",{"id":928,"createTime":929,"updateTime":929,"relativeEntities":930,"slug":931,"properties":932,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"57aa4378-64f9-4b9d-a824-44f1cd42814c","2025-01-25T15:03:43.757+00:00",[],"UCLA-Los-Angles-CA-USA",{"title":933},{"EN":934},"UCLA, Los Angles, CA, USA",{"openalex":936,"title":938},{"VOID":937},"A5041215029",{"EN":939},"Van Jacobson",{"id":941,"sortIndex":162,"researcher":26,"roles":942,"affiliations":943,"properties":954},"d7302410-4f23-4910-ab60-57e2d56a661e",[],[944],{"id":945,"sortIndex":36,"affiliation":946,"properties":26},"eed2c198-a964-468c-8149-551ed0a93baa",{"id":947,"createTime":948,"updateTime":948,"relativeEntities":949,"slug":950,"properties":951,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"968abcc4-2f30-4b9d-a6fd-40e306c9098f","2025-01-25T15:03:43.783+00:00",[],"Washington-University-St-Louis-CA-USA",{"title":952},{"EN":953},"Washington University, St. Louis, CA, USA",{"openalex":955,"orcid":957,"title":959},{"VOID":956},"A5081087040",{"VOID":958},"https:\u002F\u002Forcid.org\u002F0000-0003-4222-5091",{"EN":960},"Patrick Crowley","ARTICLE",{"url":26,"publisher":963,"properties":988},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":964,"slug":663,"properties":965,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":971,"manageAffiliations":972,"indexDatabases":973,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":966,"issn":967,"introduce":968,"eissn":969,"title":970},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[974,981],{"id":735,"indexDatabase":975,"url":750,"indexYears":26,"academicFieldIds":980,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":976,"label":977,"description":978,"key":746,"publicationTags":979,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":982,"url":728,"indexYears":729,"academicFieldIds":987,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":983,"label":984,"description":985,"key":725,"publicationTags":986,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":989,"pages":991,"issue":993},{"VOID":990},"44",{"VOID":992},"66-73",{"VOID":994},"3",1992,{"total":995,"publishYear":26,"statisticByYear":997},{"2012":114,"2013":51,"2014":285,"2015":998,"2016":999,"2017":1000,"2018":1001,"2019":1002,"2020":1003,"2021":1004,"2022":1005,"2023":1006,"2024":353},98,188,239,238,263,255,203,193,165,"2014-07-28",2014,[1010,1013,1016,1019,1022,1025,1028,1031,1034,1037,1040,1043,1046,1049,1052,1055,1058,1061,1064,1067,1070,1073,1076,1079,1082,1085,1088,1091,1094,1097],{"id":26,"text":1011,"url":26,"identifiers":1012},"NS-3-based NDN simulator. http:\u002F\u002Fndnsim.net.  NS-3-based NDN simulator. http:\u002F\u002Fndnsim.net.",{},{"id":26,"text":1014,"url":26,"identifiers":1015},"10.1145\u002F2018584.2018586",{"doi":1014},{"id":26,"text":1017,"url":26,"identifiers":1018},"10.5555\u002F353677.353678",{"doi":1017},{"id":26,"text":1020,"url":26,"identifiers":1021},"A. Afanasyev , P. Mahadevan , I. Moiseenko , E. Uzun , and L. Zhang . Interest flooding attack and countermeasures in Named Data Networking . In Proc. of IFIP Networking , May 2013 . A. Afanasyev, P. Mahadevan, I. Moiseenko, E. Uzun, and L. Zhang. Interest flooding attack and countermeasures in Named Data Networking. In Proc. of IFIP Networking, May 2013.",{},{"id":26,"text":1023,"url":26,"identifiers":1024},"M. Boguná , F. Papadopoulos , and D. Krioukov . Sustaining the Internet with Hyperbolic Mapping. Nature Comms , 1 : 62 , 2010 . M. Boguná, F. Papadopoulos, and D. Krioukov. Sustaining the Internet with Hyperbolic Mapping. Nature Comms, 1:62, 2010.",{},{"id":26,"text":1026,"url":26,"identifiers":1027},"10.1109\u002FINFCOMW.2013.6970725",{"doi":1026},{"id":26,"text":1029,"url":26,"identifiers":1030},"CCNx. Ccnx software. http:\u002F\u002Fwww.ccnx.org.  CCNx. Ccnx software. http:\u002F\u002Fwww.ccnx.org.",{},{"id":26,"text":1032,"url":26,"identifiers":1033},"P. Crowley . Named Data Networking (Demo). In China-America Frontiers of Engineering Symposium, Frontiers of Engineering , 2013 . P. Crowley. Named Data Networking (Demo). In China-America Frontiers of Engineering Symposium, Frontiers of Engineering, 2013.",{},{"id":26,"text":1035,"url":26,"identifiers":1036},"10.1145\u002F2534169.2486023",{"doi":1035},{"id":26,"text":1038,"url":26,"identifiers":1039},"10.1109\u002FINFCOMW.2014.6849267",{"doi":1038},{"id":26,"text":1041,"url":26,"identifiers":1042},"10.1006\u002Fjvlc.1996.0009",{"doi":1041},{"id":26,"text":1044,"url":26,"identifiers":1045},"10.5555\u002F794199.795125",{"doi":1044},{"id":26,"text":1047,"url":26,"identifiers":1048},"10.1145\u002F2491224.2491231",{"doi":1047},{"id":26,"text":1050,"url":26,"identifiers":1051},"10.1145\u002F1658939.1658941",{"doi":1050},{"id":26,"text":1053,"url":26,"identifiers":1054},"10.1103\u002FPhysRevE.82.036106",{"doi":1053},{"id":26,"text":1056,"url":26,"identifiers":1057},"10.1145\u002F1111322.1111328",{"doi":1056},{"id":26,"text":1059,"url":26,"identifiers":1060},"NDN Team . Named Data Networking (NDN) Project 2012 - 2013 Annual Report , Sept 2013 . NDN Team. Named Data Networking (NDN) Project 2012 - 2013 Annual Report, Sept 2013.",{},{"id":26,"text":1062,"url":26,"identifiers":1063},"NDN team. NDN Forwarding Daemon , 2014 . http:\u002F\u002Fnamed-data.net\u002Fdoc\u002FNFD\u002Fcurrent\u002F. NDN team. NDN Forwarding Daemon, 2014. http:\u002F\u002Fnamed-data.net\u002Fdoc\u002FNFD\u002Fcurrent\u002F.",{},{"id":26,"text":1065,"url":26,"identifiers":1066},"NDN team. NDN Platform 2014. http:\u002F\u002Fnamed-data.net\u002Fcodebase\u002Fplatform\u002F.  NDN team. NDN Platform 2014. http:\u002F\u002Fnamed-data.net\u002Fcodebase\u002Fplatform\u002F.",{},{"id":26,"text":1068,"url":26,"identifiers":1069},"W. Shang , Q. Ding , A. Marianantoni , J. Burke , and L. Zhang . Securing building management systems using named data networking . IEEE Network Special Issue on Information-Centric Networking , Apr 2014 . W. Shang, Q. Ding, A. Marianantoni, J. Burke, and L. Zhang. Securing building management systems using named data networking. IEEE Network Special Issue on Information-Centric Networking, Apr 2014.",{},{"id":26,"text":1071,"url":26,"identifiers":1072},"W. Shang , J. Thompson , M. Cherkaoui , J. Burke , and L. Zhang . NDN.JS: A JavaScript Client Library for Named Data Networking. In IEEE INFOCOM 2013 NOMEN Workshop , Apr 2013 . W. Shang, J. Thompson, M. Cherkaoui, J. Burke, and L. Zhang. NDN.JS: A JavaScript Client Library for Named Data Networking. In IEEE INFOCOM 2013 NOMEN Workshop, Apr 2013.",{},{"id":26,"text":1074,"url":26,"identifiers":1075},"10.5555\u002F2537857.2537892",{"doi":1074},{"id":26,"text":1077,"url":26,"identifiers":1078},"10.1145\u002F2342488.2342505",{"doi":1077},{"id":26,"text":1080,"url":26,"identifiers":1081},"G. Xylomenos , C. Ververidis , V. Siris , N. Fotiou , C. Tsilopoulos , X. Vasilakos , K. Katsaros , and G. Polyzos . A survey of information-centric networking research . IEEE Communications Surveys Tutorials , 2013 . G. Xylomenos, C. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. Katsaros, and G. Polyzos. A survey of information-centric networking research. IEEE Communications Surveys Tutorials, 2013.",{},{"id":26,"text":1083,"url":26,"identifiers":1084},"10.1016\u002Fj.comcom.2013.01.005",{"doi":1083},{"id":26,"text":1086,"url":26,"identifiers":1087},"10.1145\u002F2317307.2317319",{"doi":1086},{"id":26,"text":1089,"url":26,"identifiers":1090},"10.1109\u002FINFOCOM.2014.6848146",{"doi":1089},{"id":26,"text":1092,"url":26,"identifiers":1093},"10.1109\u002FICCCN.2012.6289305",{"doi":1092},{"id":26,"text":1095,"url":26,"identifiers":1096},"Z. Zhu and A. Afanasyev . Let's ChronoSync: Decentralized dataset state synchronization in NDN . In ICNP , 2013 . Z. Zhu and A. Afanasyev. Let's ChronoSync: Decentralized dataset state synchronization in NDN. In ICNP, 2013.",{},{"id":26,"text":1098,"url":26,"identifiers":1099},"10.1145\u002F2089016.2089036",{"doi":1098},false,{"id":1102,"createTime":1103,"updateTime":1103,"relativeEntities":1104,"slug":1105,"properties":1106,"entityType":775,"verifyStatus":25,"verifyTime":1118,"verifyNote":777,"syncStatus":28,"languages":1119,"translateLanguages":26,"viewCount":36,"primaryUrl":1120,"fullTextUrl":26,"authors":1121,"publicationType":961,"publisherRelationship":1195,"citationCount":1228,"citationInfo":1229,"publishDate":1234,"publishYear":1235,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1236,"isForceReanalyzing":1100},"05a1b099-da77-422b-969a-83a28f0f5d0d","2024-10-02T23:33:17.133+00:00",[],"Rethinking-virtual-network-embedding",{"mag":1107,"keywords":1109,"openalex":1110,"abstract":1112,"title":1114,"doi":1116},{"VOID":1108},"2114298221",{},{"VOID":1111},"W2114298221",{"EN":1113},"\u003Cjats:p>Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each virtual network to specific nodes and links in the substrate network. Since the general embedding problem is computationally intractable, past research restricted the problem space to allow efficient solutions, or focused on designing heuristic algorithms. In this paper, we advocate a different approach: rethinking the design of the substrate network to enable simpler embedding algorithms and more efficient use of resources, without restricting the problem space. In particular, we simplify virtual link embedding by: i) allowing the substrate network to split a virtual link over multiple substrate paths and ii) employing path migration to periodically re-optimize the utilization of the substrate network. We also explore node-mapping algorithms that are customized to common classes of virtual-network topologies. Our simulation experiments show that path splitting, path migration,and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networks\u003C\u002Fjats:p>",{"EN":1115},"Rethinking virtual network embedding",{"VOID":1117},"10.1145\u002F1355734.1355737","2024-10-02T23:33:17.132+00:00",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1355734.1355737",[1122,1144,1161,1178],{"id":1123,"sortIndex":36,"researcher":26,"roles":1124,"affiliations":1125,"properties":1137},"75c15c70-991a-4efb-9723-815bf928b8c2",[],[1126],{"id":1127,"sortIndex":36,"affiliation":1128,"properties":26},"c212b61b-6e73-4ed0-9e74-95e070f94f77",{"id":1129,"createTime":1130,"updateTime":1131,"relativeEntities":1132,"slug":1133,"properties":1134,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b3f77c96-b332-48cc-85f7-c61b9ca8703b","2024-01-21T02:47:57.167+00:00","2025-01-28T07:31:36.516+00:00",[],"Princeton-University-Princeton-NJ",{"title":1135},{"VI":1136},"Princeton University, Princeton, NJ",{"openalex":1138,"orcid":1140,"title":1142},{"VOID":1139},"A5035157838",{"VOID":1141},"https:\u002F\u002Forcid.org\u002F0000-0002-2381-0212",{"EN":1143},"Minlan Yu",{"id":1145,"sortIndex":114,"researcher":26,"roles":1146,"affiliations":1147,"properties":1154},"209ade69-3589-4432-bbf8-a9d3423a0902",[],[1148],{"id":1149,"sortIndex":36,"affiliation":1150,"properties":26},"9dd629bc-6cd3-4cf8-ade3-9a987104ccec",{"id":1129,"createTime":1130,"updateTime":1131,"relativeEntities":1151,"slug":1133,"properties":1152,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1153},{"VI":1136},{"openalex":1155,"orcid":1157,"title":1159},{"VOID":1156},"A5003914268",{"VOID":1158},"https:\u002F\u002Forcid.org\u002F0000-0002-0231-8165",{"EN":1160},"Jennifer Rexford",{"id":1162,"sortIndex":59,"researcher":26,"roles":1163,"affiliations":1164,"properties":1171},"30e58552-c18f-4f4a-8af5-d81f9fafb166",[],[1165],{"id":1166,"sortIndex":36,"affiliation":1167,"properties":26},"3665bb6b-df91-48f9-99fd-42382eca7461",{"id":1129,"createTime":1130,"updateTime":1131,"relativeEntities":1168,"slug":1133,"properties":1169,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1170},{"VI":1136},{"openalex":1172,"orcid":1174,"title":1176},{"VOID":1173},"A5052709754",{"VOID":1175},"https:\u002F\u002Forcid.org\u002F0000-0002-2319-9142",{"EN":1177},"Mung Chiang",{"id":1179,"sortIndex":115,"researcher":26,"roles":1180,"affiliations":1181,"properties":1188},"0ce00fd2-6c4a-4248-857f-66eb0d4270b4",[],[1182],{"id":1183,"sortIndex":36,"affiliation":1184,"properties":26},"182a4e68-410e-4cc3-b4d0-830562c9083e",{"id":1129,"createTime":1130,"updateTime":1131,"relativeEntities":1185,"slug":1133,"properties":1186,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1187},{"VI":1136},{"openalex":1189,"orcid":1191,"title":1193},{"VOID":1190},"A5037245619",{"VOID":1192},"https:\u002F\u002Forcid.org\u002F0000-0002-6955-3135",{"EN":1194},"Yung Yi",{"url":26,"publisher":1196,"properties":1221},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1197,"slug":663,"properties":1198,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1204,"manageAffiliations":1205,"indexDatabases":1206,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1199,"issn":1200,"introduce":1201,"eissn":1202,"title":1203},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1207,1214],{"id":735,"indexDatabase":1208,"url":750,"indexYears":26,"academicFieldIds":1213,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":1209,"label":1210,"description":1211,"key":746,"publicationTags":1212,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":1215,"url":728,"indexYears":729,"academicFieldIds":1220,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":1216,"label":1217,"description":1218,"key":725,"publicationTags":1219,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":1222,"pages":1224,"issue":1226},{"VOID":1223},"38",{"VOID":1225},"17-29",{"VOID":1227},"2",1218,{"total":1228,"publishYear":26,"statisticByYear":1230},{"2012":1231,"2013":532,"2014":126,"2015":627,"2016":166,"2017":367,"2018":1232,"2019":536,"2020":534,"2021":1233,"2022":222,"2023":397,"2024":53},103,102,61,"2008-03-31",2008,[1237,1240,1243,1246,1249,1252,1255,1258,1261,1264,1267,1270,1273,1276,1279,1282,1285,1288,1291,1294,1297,1300,1303,1306,1309,1312,1315,1318,1321],{"id":26,"text":1238,"url":26,"identifiers":1239},"Akamai content distribution network. http:\u002F\u002Fwww.akamai.com\u002F.  Akamai content distribution network. http:\u002F\u002Fwww.akamai.com\u002F.",{},{"id":26,"text":1241,"url":26,"identifiers":1242},"GENI.http:\u002F\u002Fwww.geni.net\u002F.  GENI.http:\u002F\u002Fwww.geni.net\u002F.",{},{"id":26,"text":1244,"url":26,"identifiers":1245},"Planetlab.https:\u002F\u002Fwww.planet-lab.org\u002F.  Planetlab.https:\u002F\u002Fwww.planet-lab.org\u002F.",{},{"id":26,"text":1247,"url":26,"identifiers":1248},"Virtual Network Embedding Simulator. http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz  Virtual Network Embedding Simulator. http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz",{},{"id":26,"text":1250,"url":26,"identifiers":1251},"R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993.   R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993.",{},{"id":26,"text":1253,"url":26,"identifiers":1254},"D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http:\u002F\u002Fwww.cs.cmu.edu\u002F~dga\u002Fpapers\u002Fandersen-assign.ps 2002.  D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http:\u002F\u002Fwww.cs.cmu.edu\u002F~dga\u002Fpapers\u002Fandersen-assign.ps 2002.",{},{"id":26,"text":1256,"url":26,"identifiers":1257},"10.1109\u002FMC.2005.136",{"doi":1256},{"id":26,"text":1259,"url":26,"identifiers":1260},"10.1145\u002F1177080.1177100",{"doi":1259},{"id":26,"text":1262,"url":26,"identifiers":1263},"10.1145\u002F1159913.1159916",{"doi":1262},{"id":26,"text":1265,"url":26,"identifiers":1266},"10.1109\u002FTNET.2002.803918",{"doi":1265},{"id":26,"text":1268,"url":26,"identifiers":1269},"Eppstein D., 1994, Proc. IEEE Symposium on Foundations of Computer Science",{},{"id":26,"text":1271,"url":26,"identifiers":1272},"10.1109\u002FINFOCOM.2006.139",{"doi":1271},{"id":26,"text":1274,"url":26,"identifiers":1275},"10.1145\u002F1198255.1198265",{"doi":1274},{"id":26,"text":1277,"url":26,"identifiers":1278},"10.1109\u002F65.826367",{"doi":1277},{"id":26,"text":1280,"url":26,"identifiers":1281},"10.1145\u002F380752.380830",{"doi":1280},{"id":26,"text":1283,"url":26,"identifiers":1284},"10.1145\u002F263326.263344",{"doi":1283},{"id":26,"text":1286,"url":26,"identifiers":1287},"10.1109\u002FMNET.2008.4476066",{"doi":1286},{"id":26,"text":1289,"url":26,"identifiers":1290},"10.1109\u002FINFCOM.2007.25",{"doi":1289},{"id":26,"text":1292,"url":26,"identifiers":1293},"Kirkpatrick S., 1983, Optimization by simulated annealing. Science, Number, 4598, 220",{},{"id":26,"text":1295,"url":26,"identifiers":1296},"Kleinberg J., 1996, MIT",{},{"id":26,"text":1298,"url":26,"identifiers":1299},"10.5555\u002F795663.796365",{"doi":1298},{"id":26,"text":1301,"url":26,"identifiers":1302},"10.1109\u002F71.963420",{"doi":1301},{"id":26,"text":1304,"url":26,"identifiers":1305},"10.1145\u002F1028788.1028836",{"doi":1304},{"id":26,"text":1307,"url":26,"identifiers":1308},"10.1145\u002F956981.956988",{"doi":1307},{"id":26,"text":1310,"url":26,"identifiers":1311},"10.1109\u002FGLOCOM.2005.1577741",{"doi":1310},{"id":26,"text":1313,"url":26,"identifiers":1314},"Webb K., 2004, Workshop on Real, Large Distributed Systems (WORLDS)",{},{"id":26,"text":1316,"url":26,"identifiers":1317},"Wood T., 2007, Proc. Networked Systems Design and Implementation",{},{"id":26,"text":1319,"url":26,"identifiers":1320},"10.5555\u002F1895868.1895900",{"doi":1319},{"id":26,"text":1322,"url":26,"identifiers":1323},"10.1109\u002FINFOCOM.2006.322",{"doi":1322},{"id":1325,"createTime":1326,"updateTime":1326,"relativeEntities":1327,"slug":1328,"properties":1329,"entityType":775,"verifyStatus":25,"verifyTime":1326,"verifyNote":777,"syncStatus":28,"languages":1341,"translateLanguages":26,"viewCount":36,"primaryUrl":1342,"fullTextUrl":26,"authors":1343,"publicationType":961,"publisherRelationship":1384,"citationCount":1416,"citationInfo":1417,"publishDate":1420,"publishYear":1421,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1422,"isForceReanalyzing":1100},"c43df92a-13c7-4832-b0c9-33591e926cf4","2024-10-15T16:11:53.131+00:00",[],"PAMAS-power-aware-multi-access-protocol-with-signalling-for-ad-hoc-networks",{"mag":1330,"keywords":1332,"openalex":1333,"abstract":1335,"title":1337,"doi":1339},{"VOID":1331},"2017333190",{},{"VOID":1334},"W2017333190",{"EN":1336},"\u003Cjats:p>In this paper we develop a new multiaccess protocol for ad hoc radio networks. The protocol is based on the original MACA protocol with the adition of a separate signalling channel. The unique feature of our protocol is that it conserves battery power at nodes by intelligently powering off nodes that are not actively transmitting or receiving packets. The manner in which nodes power themselves off does not influence the delay or throughput characteristics of our protocol. We illustrate the power conserving behavior of PAMAS via extensive simulations performed over ad hoc networks containing 10-20 nodes. Our results indicate that power savings of between 10% and 70% are attainable in most systems. Finally, we discuss how the idea of power awareness can be built into other multiaccess protocols as well.\u003C\u002Fjats:p>",{"EN":1338},"PAMAS—power aware multi-access protocol with signalling for ad hoc networks",{"VOID":1340},"10.1145\u002F293927.293928",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F293927.293928",[1344,1363],{"id":1345,"sortIndex":115,"researcher":26,"roles":1346,"affiliations":1347,"properties":1358},"bd041705-5b3c-424b-a57b-134745996cb1",[],[1348],{"id":1349,"sortIndex":36,"affiliation":1350,"properties":26},"2ee26870-22de-44ff-b90c-c3228941ee34",{"id":1351,"createTime":1352,"updateTime":1352,"relativeEntities":1353,"slug":1354,"properties":1355,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"a993aa66-29b7-4615-8d94-a162fb67f469","2024-10-15T16:11:53.158+00:00",[],"Aerospace-Corporation-El-Segundo-CA",{"title":1356},{"EN":1357},"Aerospace Corporation, El Segundo, CA",{"openalex":1359,"title":1361},{"VOID":1360},"A5015982779",{"EN":1362},"C.S. Raghavendra",{"id":1364,"sortIndex":36,"researcher":26,"roles":1365,"affiliations":1366,"properties":1377},"b1d1d760-548c-4ef7-ae6a-74bb65969c03",[],[1367],{"id":1368,"sortIndex":36,"affiliation":1369,"properties":26},"eb5796a3-e8ca-444c-8b27-0d625fc1e171",{"id":1370,"createTime":1371,"updateTime":1371,"relativeEntities":1372,"slug":1373,"properties":1374,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"78a2b14a-913a-49ef-889b-6867240417f1","2024-10-15T16:11:53.146+00:00",[],"Department-of-Electrical-amp-Computer-Engineering-Oregon-State-University-Corvallis-OR",{"title":1375},{"EN":1376},"Department of Electrical & Computer Engineering, Oregon State University, Corvallis, OR",{"openalex":1378,"orcid":1380,"title":1382},{"VOID":1379},"A5068360596",{"VOID":1381},"https:\u002F\u002Forcid.org\u002F0000-0002-1509-0497",{"EN":1383},"Suresh Singh",{"url":26,"publisher":1385,"properties":1410},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1386,"slug":663,"properties":1387,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1393,"manageAffiliations":1394,"indexDatabases":1395,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1388,"issn":1389,"introduce":1390,"eissn":1391,"title":1392},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1396,1403],{"id":735,"indexDatabase":1397,"url":750,"indexYears":26,"academicFieldIds":1402,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":1398,"label":1399,"description":1400,"key":746,"publicationTags":1401,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":1404,"url":728,"indexYears":729,"academicFieldIds":1409,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":1405,"label":1406,"description":1407,"key":725,"publicationTags":1408,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":1411,"pages":1413,"issue":1415},{"VOID":1412},"28",{"VOID":1414},"5-26",{"VOID":994},1134,{"total":1416,"publishYear":26,"statisticByYear":1418},{"2012":358,"2013":1419,"2014":517,"2015":48,"2016":516,"2017":111,"2018":50,"2019":59,"2020":298,"2021":116,"2022":114,"2023":115,"2024":59},55,"1998-07-01",1998,[1423,1426,1429,1432,1435,1438,1441,1444,1447,1450,1453,1456,1459,1462,1465,1468,1471,1474,1477,1480,1483,1486,1489,1492,1495,1498,1501,1504,1507,1510,1513,1516,1519,1522,1525,1528,1531],{"id":26,"text":1424,"url":26,"identifiers":1425},"{1} Rooftop Communications http:\u002F\u002Fwww.rooftop.com  {1} Rooftop Communications http:\u002F\u002Fwww.rooftop.com",{},{"id":26,"text":1427,"url":26,"identifiers":1428},"{2} http:\u002F\u002Fwww.global-defence-review.com\u002FDigitalBattlefield.html  {2} http:\u002F\u002Fwww.global-defence-review.com\u002FDigitalBattlefield.html",{},{"id":26,"text":1430,"url":26,"identifiers":1431},"{3} http:\u002F\u002Fwww.networks.digital.com\u002Fnpb\u002Fhtml\u002Fproducts_guide\u002Froamwir2.html  {3} http:\u002F\u002Fwww.networks.digital.com\u002Fnpb\u002Fhtml\u002Fproducts_guide\u002Froamwir2.html",{},{"id":26,"text":1433,"url":26,"identifiers":1434},"{4} D. Beyer , \"Accomplishments of the D ARPA SURAN Program\" , Proc. IEEE MILCOM'90 , Monterey, CA , Oct. 1990 . {4} D. Beyer, \"Accomplishments of the DARPA SURAN Program\", Proc. IEEE MILCOM'90, Monterey, CA, Oct. 1990.",{},{"id":26,"text":1436,"url":26,"identifiers":1437},"10.1145\u002F190314.190334",{"doi":1436},{"id":26,"text":1439,"url":26,"identifiers":1440},"{6} Béla Bollobás , Random Graphs , Academic Press , 1985 . {6} Béla Bollobás, Random Graphs, Academic Press, 1985.",{},{"id":26,"text":1442,"url":26,"identifiers":1443},"{7} A. Chandrakasan , T. Simon , J. Goodman and W. Rabiner , \" Signal Processing for an ultra low power Wireless Video Camera \", 3rd International Workshop on Mobile Multimedia Communications , Princeton, NJ , September 25-27, 1996 . {7} A. Chandrakasan, T. Simon, J. Goodman and W. Rabiner, \"Signal Processing for an ultra low power Wireless Video Camera\", 3rd International Workshop on Mobile Multimedia Communications, Princeton, NJ, September 25-27, 1996.",{},{"id":26,"text":1445,"url":26,"identifiers":1446},"10.1109\u002FVETEC.1998.683696",{"doi":1445},{"id":26,"text":1448,"url":26,"identifiers":1449},"10.1109\u002FPROC.1987.13704",{"doi":1448},{"id":26,"text":1451,"url":26,"identifiers":1452},"{10} F. Douglis , F. Kaashoek , B. Marsh , R. Caceres , K. Lai and J. Tauber , \" Storage Alternatives for Mobile Computers \", Proc. 1994 Symposium on Operating Systems Design and Implementation, OSDI , November 1994 . {10} F. Douglis, F. Kaashoek, B. Marsh, R. Caceres, K. Lai and J. Tauber, \"Storage Alternatives for Mobile Computers\", Proc. 1994 Symposium on Operating Systems Design and Implementation, OSDI, November 1994.",{},{"id":26,"text":1454,"url":26,"identifiers":1455},"10.1109\u002FPROC.1987.13703",{"doi":1454},{"id":26,"text":1457,"url":26,"identifiers":1458},"10.1145\u002F263105.263137",{"doi":1457},{"id":26,"text":1460,"url":26,"identifiers":1461},"{13} J.J. Garcia-Luna-Aceves Chane L. Fullmer and Ewerton Madruga \"Wireless Mobile Internetworking\" Manuscript.  {13} J.J. Garcia-Luna-Aceves Chane L. Fullmer and Ewerton Madruga \"Wireless Mobile Internetworking\" Manuscript.",{},{"id":26,"text":1463,"url":26,"identifiers":1464},"10.1007\u002FBF01200845",{"doi":1463},{"id":26,"text":1466,"url":26,"identifiers":1467},"{15} E.P. Harris and K.W. Warren , \" Low Power Technologies: A System Perspective \", 3rd International Workshop on Mobile Multimedia Communications , Princeton, NJ , September 25-27, 1996 . {15} E.P. Harris and K.W. Warren, \"Low Power Technologies: A System Perspective\", 3rd International Workshop on Mobile Multimedia Communications, Princeton, NJ, September 25-27, 1996.",{},{"id":26,"text":1469,"url":26,"identifiers":1470},"10.1109\u002FPROC.1987.13702",{"doi":1469},{"id":26,"text":1472,"url":26,"identifiers":1473},"{17} P. Karn , \" MACA - a New Channel Access Method for Packet Radio\" , in ARRL\u002FCRRL Amateur Radio 9th Computer Networking Conference , pp. 134 - 140 , 1990 . {17} P. Karn, \"MACA - a New Channel Access Method for Packet Radio\", in ARRL\u002FCRRL Amateur Radio 9th Computer Networking Conference, pp. 134-140, 1990.",{},{"id":26,"text":1475,"url":26,"identifiers":1476},"{18} B. M. Leiner , D. L. Neilson and F. A. Tobagi ( Eds .) , Proceedings of the IEEE, Vol. 75(1) , Special Issue on Packet Radio Networks , January 1987 . {18} B. M. Leiner, D. L. Neilson and F. A. Tobagi (Eds.), Proceedings of the IEEE, Vol. 75(1), Special Issue on Packet Radio Networks, January 1987.",{},{"id":26,"text":1478,"url":26,"identifiers":1479},"{19} K. Li , R. Kumpf , P. Horton and T. Anderson , \" A Quantitative Analysis of Disk Drive Power Management in Portable Computers \", Proceedings 1994 USENIX , San Francisco, CA , pp. 279 - 291 , 1994 . {19} K. Li, R. Kumpf, P. Horton and T. Anderson, \"A Quantitative Analysis of Disk Drive Power Management in Portable Computers\", Proceedings 1994 USENIX, San Francisco, CA, pp. 279-291, 1994.",{},{"id":26,"text":1481,"url":26,"identifiers":1482},"{20} Chunhung Richard Lin and Mario Gerla, \"Asynchronous Multimedia Multihop Wireless Networks\" , Proceedings IEEE INFOCOM'97 , ( 1997 ). {20} Chunhung Richard Lin and Mario Gerla, \"Asynchronous Multimedia Multihop Wireless Networks\", Proceedings IEEE INFOCOM'97, (1997).",{},{"id":26,"text":1484,"url":26,"identifiers":1485},"10.1109\u002FICC.1995.524295",{"doi":1484},{"id":26,"text":1487,"url":26,"identifiers":1488},"10.1109\u002F49.622910",{"doi":1487},{"id":26,"text":1490,"url":26,"identifiers":1491},"{23} W. Mangione-Smith , P. S. Ghang , S. Nazareth , P. Lettieri , W. Boring and R. Jain , \" A low power architecture for wireless multimedia systems: Lessons learned from building a power hog \", Proc. 1996 International Symp. on Low Power Electronics and Design , Monterey, CA , pp. 23 - 28 . {23} W. Mangione-Smith, P. S. Ghang, S. Nazareth, P. Lettieri, W. Boring and R. Jain, \"A low power architecture for wireless multimedia systems: Lessons learned from building a power hog\", Proc. 1996 International Symp. on Low Power Electronics and Design, Monterey, CA, pp. 23-28.",{},{"id":26,"text":1493,"url":26,"identifiers":1494},"10.1145\u002F215530.215560",{"doi":1493},{"id":26,"text":1496,"url":26,"identifiers":1497},"{25} D. Petras and A. Krämling , \" MAC protocol with polling and fast collision resolution for an ATM air interface \", Proc. IEEE ATM'96 workshop , San Francisco, CA , Aug. 1996 . {25} D. Petras and A. Krämling, \"MAC protocol with polling and fast collision resolution for an ATM air interface\", Proc. IEEE ATM'96 workshop, San Francisco, CA, Aug. 1996.",{},{"id":26,"text":1499,"url":26,"identifiers":1500},"{26} Christian Röhl, H. Woesner and A. Wolisz , \" A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11 \", Proc. of the 6th WINLAB Workshop on Third Generation Wireless Systems , March 1997 . {26} Christian Röhl, H. Woesner and A. Wolisz, \"A Short Look on Power Saving Mechanisms in the Wireless LAN Standard Draft IEEE 802.11\", Proc. of the 6th WINLAB Workshop on Third Generation Wireless Systems, March 1997.",{},{"id":26,"text":1502,"url":26,"identifiers":1503},"10.1109\u002F49.56379",{"doi":1502},{"id":26,"text":1505,"url":26,"identifiers":1506},"10.1023\u002FA:1019128411323",{"doi":1505},{"id":26,"text":1508,"url":26,"identifiers":1509},"{29} Cheng-shong Wu and Victor O.K . Li, \"Receiver-Initiated Busy-Tone Multiple Access in Packet Radio Networks \", Proceedings ACM SIGCOMM'87 Workshop , Stowe, Vermont, Aug. 11-15 , Vol. 17(5), pp. 336- 342 , 1987 . {29} Cheng-shong Wu and Victor O.K. Li, \"Receiver-Initiated Busy-Tone Multiple Access in Packet Radio Networks\", Proceedings ACM SIGCOMM'87 Workshop, Stowe, Vermont, Aug. 11-15, Vol. 17(5), pp. 336-342, 1987.",{},{"id":26,"text":1511,"url":26,"identifiers":1512},"10.1109\u002FVETEC.1997.605397",{"doi":1511},{"id":26,"text":1514,"url":26,"identifiers":1515},"{31} Krishna M. Sivalingam M. B. Srivastava P. Agrawal and J-C. Chen \"Low-Power Access Protocols Based on Scheduling for Wireless and Mobile ATM Networks\" Manuscript http:\u002F\u002Fwww.eecs.wsu.edu\u002F~krishna.  {31} Krishna M. Sivalingam M. B. Srivastava P. Agrawal and J-C. Chen \"Low-Power Access Protocols Based on Scheduling for Wireless and Mobile ATM Networks\" Manuscript http:\u002F\u002Fwww.eecs.wsu.edu\u002F~krishna.",{},{"id":26,"text":1517,"url":26,"identifiers":1518},"{32} W. Mangione-Smith and P.S. Ghang , \" A low power medium access control protocol for portable multi-media systems \", 3rd International Workshop on Mobile Multimedia Communications , September 25-27, 1996 . {32} W. Mangione-Smith and P.S. Ghang, \"A low power medium access control protocol for portable multi-media systems\", 3rd International Workshop on Mobile Multimedia Communications, September 25-27, 1996.",{},{"id":26,"text":1520,"url":26,"identifiers":1521},"{33} M. Stemm and P. Gauthier and D. Harada , \" Reducing power consumption of network interfaces in hand-held devices \", 3rd International Workshop on Mobile Multimedia Communications , September 25-27, 1996 . {33} M. Stemm and P. Gauthier and D. Harada, \"Reducing power consumption of network interfaces in hand-held devices\", 3rd International Workshop on Mobile Multimedia Communications, September 25-27, 1996.",{},{"id":26,"text":1523,"url":26,"identifiers":1524},"10.1109\u002FTCOM.1975.1092767",{"doi":1523},{"id":26,"text":1526,"url":26,"identifiers":1527},"{35} H. S. Wilf , Algorithms and Complexity , Prentice Hall , 1986 . {35} H. S. Wilf, Algorithms and Complexity, Prentice Hall, 1986.",{},{"id":26,"text":1529,"url":26,"identifiers":1530},"{36} S. Zdonik , M. Franklin , R. Alonso and S. Acharya , \" Are \"disks in the air\" just pie in the sky? \", IEEE Workshop on Mobile Computing Systems and Applications , Santa Cruz, CA , pp. 12 - 19 , December 1994 . {36} S. Zdonik, M. Franklin, R. Alonso and S. Acharya, \"Are \"disks in the air\" just pie in the sky?\", IEEE Workshop on Mobile Computing Systems and Applications, Santa Cruz, CA, pp. 12-19, December 1994.",{},{"id":26,"text":1532,"url":26,"identifiers":1533},"{37} Michele Zorzi and R. R. Rao , \" energy Management in wireless Communications \", Proc. 6th WINLAB Workshop on Third Generation Wireless Information Networks , March 1997 . {37} Michele Zorzi and R. R. Rao, \"energy Management in wireless Communications\", Proc. 6th WINLAB Workshop on Third Generation Wireless Information Networks, March 1997.",{},{"id":1535,"createTime":1536,"updateTime":1536,"relativeEntities":1537,"slug":1538,"properties":1539,"entityType":775,"verifyStatus":25,"verifyTime":1536,"verifyNote":777,"syncStatus":28,"languages":1551,"translateLanguages":26,"viewCount":36,"primaryUrl":1552,"fullTextUrl":26,"authors":1553,"publicationType":961,"publisherRelationship":1615,"citationCount":1648,"citationInfo":1649,"publishDate":1651,"publishYear":1652,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1653,"isForceReanalyzing":1100},"437e1ac2-a2a7-4ba4-bb05-65fd21056094","2024-09-28T18:27:15.995+00:00",[],"Routing-in-a-delay-tolerant-network",{"mag":1540,"keywords":1542,"openalex":1543,"abstract":1545,"title":1547,"doi":1549},{"VOID":1541},"3162828249",{},{"VOID":1544},"W3162828249",{"EN":1546},"\u003Cjats:p>We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several algorithms and use simulations to compare their performance with respect to the amount of knowledge they require about network topology. We find that, as expected, the algorithms using the least knowledge tend to perform poorly. We also find that with limited additional knowledge, far less than complete global knowledge, efficient algorithms can be constructed for routing in such environments. To the best of our knowledge this is the first such investigation of routing issues in DTNs.\u003C\u002Fjats:p>",{"EN":1548},"Routing in a delay tolerant network",{"VOID":1550},"10.1145\u002F1030194.1015484",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1030194.1015484",[1554,1573,1595],{"id":1555,"sortIndex":115,"researcher":26,"roles":1556,"affiliations":1557,"properties":1568},"33ed2dfe-2360-489b-9793-2d66f3e4830f",[],[1558],{"id":1559,"sortIndex":36,"affiliation":1560,"properties":26},"b6344a89-ebde-4449-9db5-8ff11fffb98d",{"id":1561,"createTime":1562,"updateTime":1562,"relativeEntities":1563,"slug":1564,"properties":1565,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"cf3a6c04-b6fd-4f86-ac8d-14313f771ca3","2024-09-28T18:27:16.010+00:00",[],"Intel-Research-Berkeley",{"title":1566},{"EN":1567},"Intel Research, Berkeley",{"openalex":1569,"title":1571},{"VOID":1570},"A5071167836",{"EN":1572},"Kevin Fall",{"id":1574,"sortIndex":36,"researcher":26,"roles":1575,"affiliations":1576,"properties":1588},"e278a76a-5ee5-4a50-8222-d4f13d72c22d",[],[1577],{"id":1578,"sortIndex":36,"affiliation":1579,"properties":26},"e5322416-bd4b-4035-b76e-306bb47ebbfc",{"id":1580,"createTime":1581,"updateTime":1582,"relativeEntities":1583,"slug":1584,"properties":1585,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"19da5a30-e106-43d3-a9ef-0909b798516e","2024-01-04T13:33:04.608+00:00","2025-02-24T08:37:18.828+00:00",[],"University-of-Washington",{"title":1586},{"VI":1587},"University of Washington",{"openalex":1589,"orcid":1591,"title":1593},{"VOID":1590},"A5101473084",{"VOID":1592},"https:\u002F\u002Forcid.org\u002F0009-0001-6395-0682",{"EN":1594},"Sushant Jain",{"id":1596,"sortIndex":114,"researcher":26,"roles":1597,"affiliations":1598,"properties":1610},"38c769a7-d2c8-48ca-a29a-ba3ce16f2bdd",[],[1599],{"id":1600,"sortIndex":36,"affiliation":1601,"properties":26},"fd86fbca-cefa-4221-8fe2-6eec184a568a",{"id":1602,"createTime":1603,"updateTime":1604,"relativeEntities":1605,"slug":1606,"properties":1607,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"16a399c8-6ca1-4a76-b348-cf488f694917","2023-12-20T19:29:14.942+00:00","2025-02-10T05:36:35.586+00:00",[],"University-of-California-Berkeley",{"title":1608},{"VI":1609},"University of California, Berkeley",{"openalex":1611,"title":1613},{"VOID":1612},"A5103514891",{"EN":1614},"Rabin Patra",{"url":26,"publisher":1616,"properties":1641},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1617,"slug":663,"properties":1618,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1624,"manageAffiliations":1625,"indexDatabases":1626,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1619,"issn":1620,"introduce":1621,"eissn":1622,"title":1623},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1627,1634],{"id":735,"indexDatabase":1628,"url":750,"indexYears":26,"academicFieldIds":1633,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":1629,"label":1630,"description":1631,"key":746,"publicationTags":1632,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":1635,"url":728,"indexYears":729,"academicFieldIds":1640,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":1636,"label":1637,"description":1638,"key":725,"publicationTags":1639,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":1642,"pages":1644,"issue":1646},{"VOID":1643},"34",{"VOID":1645},"145-158",{"VOID":1647},"4",579,{"total":1648,"publishYear":26,"statisticByYear":1650},{"2012":254,"2013":259,"2014":517,"2015":539,"2016":396,"2017":168,"2018":255,"2019":79,"2020":239,"2021":173,"2022":298,"2023":53},"2004-08-30",2004,[1654,1657,1660,1663,1666,1669,1671,1674,1677,1680,1683,1686,1689,1692,1695,1698,1701,1704,1707,1710,1713,1716,1719],{"id":26,"text":1655,"url":26,"identifiers":1656},"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.",{},{"id":26,"text":1658,"url":26,"identifiers":1659},"AMSAT. http:\u002F\u002Fwww.amsat.org\u002F.  AMSAT. http:\u002F\u002Fwww.amsat.org\u002F.",{},{"id":26,"text":1661,"url":26,"identifiers":1662},"10.1145\u002F288235.288256",{"doi":1661},{"id":26,"text":1664,"url":26,"identifiers":1665},"X. Chen and A. L. Murphy . Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing , August 2001 . X. Chen and A. L. Murphy. Enabling Disconnected Transitive Communication in Mobile Adhoc Networks. In Workshop on Principles of Mobile Computing, August 2001.",{},{"id":26,"text":1667,"url":26,"identifiers":1668},"CPLEX\n  : Linear Programming Solver. http:\u002F\u002Fwww.ilog.com\u002F.  CPLEX: Linear Programming Solver. http:\u002F\u002Fwww.ilog.com\u002F.",{},{"id":26,"text":1667,"url":26,"identifiers":1670},{},{"id":26,"text":1672,"url":26,"identifiers":1673},"10.1145\u002F863955.863960",{"doi":1672},{"id":26,"text":1675,"url":26,"identifiers":1676},"L. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton University Press , 1962 . L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.",{},{"id":26,"text":1678,"url":26,"identifiers":1679},"S. Gao . Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis , MIT , 2002 . S. Gao. Routing Problems in Stochastic Time-Dependent Networks with Applications in Dynamic Traffic Assignment. Master's thesis, MIT, 2002.",{},{"id":26,"text":1681,"url":26,"identifiers":1682},"P. Honeymoon and S. Bellovin . PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference , 1986 . P. Honeymoon and S. Bellovin. PATHALIAS: The Care and Feeding of Relative Address. In USENIX Conference, 1986.",{},{"id":26,"text":1684,"url":26,"identifiers":1685},"B. Hoppe and É. Tardos. The Quickest Transshipment Problem . In SODA , Jan. 1996 . B. Hoppe and É. Tardos. The Quickest Transshipment Problem. In SODA, Jan. 1996.",{},{"id":26,"text":1687,"url":26,"identifiers":1688},"10.1145\u002F605397.605408",{"doi":1687},{"id":26,"text":1690,"url":26,"identifiers":1691},"B. Kotnyek . An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936 , INRIA , Sept. 2003 . B. Kotnyek. An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936, INRIA, Sept. 2003.",{},{"id":26,"text":1693,"url":26,"identifiers":1694},"J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\u002F\u002Fwww.qsl.net\u002Fkd2bd\u002Fpredict.html\u002F.  J. A. Magliacane. PREDICT: Satellite Tracking Software. http:\u002F\u002Fwww.qsl.net\u002Fkd2bd\u002Fpredict.html\u002F.",{},{"id":26,"text":1696,"url":26,"identifiers":1697},"10.1109\u002FICNP.2001.992756",{"doi":1696},{"id":26,"text":1699,"url":26,"identifiers":1700},"10.1145\u002F938985.939012",{"doi":1699},{"id":26,"text":1702,"url":26,"identifiers":1703},"R. Ogier . Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks , 18 : 303 -- 318 , 1988 . R. Ogier. Minimum-delay Routing in Continuous-time Dynamic Networks with Piecewise-constant Capacities. Networks, 18:303--318, 1988.",{},{"id":26,"text":1705,"url":26,"identifiers":1706},"10.1145\u002F79147.214078",{"doi":1705},{"id":26,"text":1708,"url":26,"identifiers":1709},"10.1109\u002FMC.2004.1260729",{"doi":1708},{"id":26,"text":1711,"url":26,"identifiers":1712},"10.5555\u002F1060289.1060319",{"doi":1711},{"id":26,"text":1714,"url":26,"identifiers":1715},"10.1109\u002FSNPA.2003.1203354",{"doi":1714},{"id":26,"text":1717,"url":26,"identifiers":1718},"TIER Project. http:\u002F\u002Ftier.cs.berkeley.edu\u002F.  TIER Project. http:\u002F\u002Ftier.cs.berkeley.edu\u002F.",{},{"id":26,"text":1720,"url":26,"identifiers":1721},"Wizzy Project. http:\u002F\u002Fwww.wizzy.org.za\u002F.  Wizzy Project. http:\u002F\u002Fwww.wizzy.org.za\u002F.",{},{"id":1723,"createTime":1724,"updateTime":1724,"relativeEntities":1725,"slug":1726,"properties":1727,"entityType":775,"verifyStatus":25,"verifyTime":1724,"verifyNote":777,"syncStatus":28,"languages":1739,"translateLanguages":26,"viewCount":36,"primaryUrl":1740,"fullTextUrl":26,"authors":1741,"publicationType":961,"publisherRelationship":1818,"citationCount":1851,"citationInfo":1852,"publishDate":1854,"publishYear":1855,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1856,"isForceReanalyzing":1100},"a4954c07-412e-4106-b0ea-15a3726067b6","2024-12-26T21:23:14.250+00:00",[],"Understanding-data-center-traffic-characteristics",{"mag":1728,"keywords":1730,"openalex":1731,"abstract":1733,"title":1735,"doi":1737},{"VOID":1729},"2613694343",{},{"VOID":1732},"W2613694343",{"EN":1734},"\u003Cjats:p>As data centers become more and more central in Internet communications, both research and operations communities have begun to explore how to better design and manage them. In this paper, we present a preliminary empirical study of end-to-end traffic patterns in data center networks that can inform and help evaluate research and operational approaches. We analyze SNMP logs collected at 19 data centers to examine temporal and spatial variations in link loads and losses. We find that while links in the core are heavily utilized the ones closer to the edge observe a greater degree of loss. We then study packet traces collected at a small number of switches in one data center and find evidence of ON-OFF traffic behavior. Finally, we develop a framework that derives ON-OFF traffic parameters for data center traffic sources that best explain the SNMP data collected for the data center. We show that the framework can be used to evaluate data center traffic engineering approaches. We are also applying the framework to design network-level traffic generators for data centers.\u003C\u002Fjats:p>",{"EN":1736},"Understanding data center traffic characteristics",{"VOID":1738},"10.1145\u002F1672308.1672325",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1672308.1672325",[1742,1764,1781,1796],{"id":1743,"sortIndex":36,"researcher":26,"roles":1744,"affiliations":1745,"properties":1757},"cd9b93e8-5220-48c2-beed-569b2769e990",[],[1746],{"id":1747,"sortIndex":36,"affiliation":1748,"properties":26},"1c3de7de-8d55-49df-b799-e829fdb83547",{"id":1749,"createTime":1750,"updateTime":1751,"relativeEntities":1752,"slug":1753,"properties":1754,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"171e428e-4b22-4091-8779-2d832a084804","2023-12-12T22:57:46.299+00:00","2025-01-01T02:22:52.859+00:00",[],"University-Of-Wisconsin-Madison-WI-USA",{"title":1755},{"VI":1756},"University Of Wisconsin, Madison, WI USA",{"openalex":1758,"orcid":1760,"title":1762},{"VOID":1759},"A5069985929",{"VOID":1761},"https:\u002F\u002Forcid.org\u002F0000-0002-5855-8811",{"EN":1763},"Theophilus Benson",{"id":1765,"sortIndex":114,"researcher":26,"roles":1766,"affiliations":1767,"properties":1774},"c34d87e4-b6e1-44f5-81d9-fe018204c38a",[],[1768],{"id":1769,"sortIndex":36,"affiliation":1770,"properties":26},"8260bf75-9d3d-4360-81a2-62868a8eebe8",{"id":1749,"createTime":1750,"updateTime":1751,"relativeEntities":1771,"slug":1753,"properties":1772,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1773},{"VI":1756},{"openalex":1775,"orcid":1777,"title":1779},{"VOID":1776},"A5035329776",{"VOID":1778},"https:\u002F\u002Forcid.org\u002F0000-0002-5920-170X",{"EN":1780},"Aditya Akella",{"id":1782,"sortIndex":115,"researcher":26,"roles":1783,"affiliations":1784,"properties":1791},"dd06e7ca-ca45-4b56-bd05-3567a3566651",[],[1785],{"id":1786,"sortIndex":36,"affiliation":1787,"properties":26},"2faa55b8-1528-4bc6-92f6-15c01e467411",{"id":1749,"createTime":1750,"updateTime":1751,"relativeEntities":1788,"slug":1753,"properties":1789,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1790},{"VI":1756},{"openalex":1792,"title":1794},{"VOID":1793},"A5104044470",{"EN":1795},"Ashok Anand",{"id":1797,"sortIndex":59,"researcher":26,"roles":1798,"affiliations":1799,"properties":1811},"f8db466d-aa1e-41b9-bf12-1f8ea3f32c38",[],[1800],{"id":1801,"sortIndex":36,"affiliation":1802,"properties":26},"ef5ce896-ce5c-48a3-a8bf-fdd06f94e0f9",{"id":1803,"createTime":1804,"updateTime":1805,"relativeEntities":1806,"slug":1807,"properties":1808,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"328b308a-6bb9-4c24-a501-2f3bc5c20a06","2024-01-15T04:40:34.345+00:00","2024-12-26T21:23:14.273+00:00",[],"Microsoft-Redmond-WA-USA",{"title":1809},{"VI":1810},"Microsoft Redmond, WA, USA",{"openalex":1812,"orcid":1814,"title":1816},{"VOID":1813},"A5100447267",{"VOID":1815},"https:\u002F\u002Forcid.org\u002F0000-0002-4214-9423",{"EN":1817},"Ming Zhang",{"url":26,"publisher":1819,"properties":1844},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1820,"slug":663,"properties":1821,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1827,"manageAffiliations":1828,"indexDatabases":1829,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":1822,"issn":1823,"introduce":1824,"eissn":1825,"title":1826},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[1830,1837],{"id":735,"indexDatabase":1831,"url":750,"indexYears":26,"academicFieldIds":1836,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":1832,"label":1833,"description":1834,"key":746,"publicationTags":1835,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":1838,"url":728,"indexYears":729,"academicFieldIds":1843,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":1839,"label":1840,"description":1841,"key":725,"publicationTags":1842,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":1845,"pages":1847,"issue":1849},{"VOID":1846},"40",{"VOID":1848},"92-99",{"VOID":1850},"1",513,{"total":1851,"publishYear":26,"statisticByYear":1853},{"2012":240,"2013":539,"2014":48,"2015":1233,"2016":259,"2017":608,"2018":48,"2019":285,"2020":222,"2021":159,"2022":336,"2023":238,"2024":234},"2010-01-07",2010,[1857,1860,1863,1866,1869,1872,1875,1878,1881],{"id":26,"text":1858,"url":26,"identifiers":1859},"The network simulator -- ns-2. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F.  The network simulator -- ns-2. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F. http:\u002F\u002Fwww.isi.edu\u002Fnsnam\u002Fns\u002F.",{},{"id":26,"text":1861,"url":26,"identifiers":1862},"10.1145\u002F1402958.1402967",{"doi":1861},{"id":26,"text":1864,"url":26,"identifiers":1865},"10.1145\u002F963985.963988",{"doi":1864},{"id":26,"text":1867,"url":26,"identifiers":1868},"10.1145\u002F1397718.1397732",{"doi":1867},{"id":26,"text":1870,"url":26,"identifiers":1871},"10.1109\u002F90.282603",{"doi":1870},{"id":26,"text":1873,"url":26,"identifiers":1874},"T. Oetiker. Round robin database tool. http:\u002F\u002Foss.oetiker.ch\u002Frrdtool\u002F.  T. Oetiker. Round robin database tool. http:\u002F\u002Foss.oetiker.ch\u002Frrdtool\u002F.",{},{"id":26,"text":1876,"url":26,"identifiers":1877},"10.1109\u002F90.392383",{"doi":1876},{"id":26,"text":1879,"url":26,"identifiers":1880},"C.S. version 2 MIBs. http:\u002F\u002Fwww.cisco.com\u002Fpublic\u002Fmibs\u002F.  C.S. version 2 MIBs. http:\u002F\u002Fwww.cisco.com\u002Fpublic\u002Fmibs\u002F.",{},{"id":26,"text":1882,"url":26,"identifiers":1883},"F. Wilcoxon . Biometrics bulletin. 1:80--83 , 1945 . F. Wilcoxon. Biometrics bulletin. 1:80--83, 1945.",{},{"id":1885,"createTime":1886,"updateTime":1886,"relativeEntities":1887,"slug":1888,"properties":1889,"entityType":775,"verifyStatus":25,"verifyTime":1886,"verifyNote":777,"syncStatus":28,"languages":1901,"translateLanguages":26,"viewCount":36,"primaryUrl":1902,"fullTextUrl":26,"authors":1903,"publicationType":961,"publisherRelationship":2033,"citationCount":2065,"citationInfo":2066,"publishDate":2068,"publishYear":2069,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2070,"isForceReanalyzing":1100},"880af528-8a29-4dc7-8b5c-334aad3cce77","2024-10-02T23:33:12.189+00:00",[],"Virtual-network-embedding-through-topology-aware-node-ranking",{"mag":1890,"keywords":1892,"openalex":1893,"abstract":1895,"title":1897,"doi":1899},{"VOID":1891},"2130267070",{},{"VOID":1894},"W2130267070",{"EN":1896},"\u003Cjats:p>Virtualizing and sharing networked resources have become a growing trend that reshapes the computing and networking architectures. Embedding multiple virtual networks (VNs) on a shared substrate is a challenging problem on cloud computing platforms and large-scale sliceable network testbeds. In this paper we apply the Markov Random Walk (RW) model to rank a network node based on its resource and topological attributes. This novel topology-aware node ranking measure reflects the relative importance of the node. Using node ranking we devise two VN embedding algorithms. The first algorithm maps virtual nodes to substrate nodes according to their ranks, then embeds the virtual links between the mapped nodes by finding shortest paths with unsplittable paths and solving the multi-commodity flow problem with splittable paths. The second algorithm is a backtracking VN embedding algorithm based on breadth-first search, which embeds the virtual nodes and links during the same stage using node ranks. Extensive simulation experiments show that the topology-aware node rank is a better resource measure and the proposed RW-based algorithms increase the long-term average revenue and acceptance ratio compared to the existing embedding algorithms.\u003C\u002Fjats:p>",{"EN":1898},"Virtual network embedding through topology-aware node ranking",{"VOID":1900},"10.1145\u002F1971162.1971168",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1971162.1971168",[1904,1926,1948,1965,1982,1999,2016],{"id":1905,"sortIndex":115,"researcher":26,"roles":1906,"affiliations":1907,"properties":1919},"83094c45-b88a-401a-b7f0-6fb2fefe09ee",[],[1908],{"id":1909,"sortIndex":36,"affiliation":1910,"properties":26},"b43337a6-b7ed-49ec-95e1-730a928303ca",{"id":1911,"createTime":1912,"updateTime":1913,"relativeEntities":1914,"slug":1915,"properties":1916,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"c923695f-a03b-4d19-9df2-777f8d5cfbc4","2024-01-04T16:48:17.943+00:00","2025-02-09T15:30:06.201+00:00",[],"Beijing-University-of-Posts-and-Telecommunications-Beijing-China",{"title":1917},{"VI":1918},"Beijing University of Posts and Telecommunications, Beijing, China",{"openalex":1920,"orcid":1922,"title":1924},{"VOID":1921},"A5036865453",{"VOID":1923},"https:\u002F\u002Forcid.org\u002F0000-0003-4266-7527",{"EN":1925},"Sen Su",{"id":1927,"sortIndex":135,"researcher":26,"roles":1928,"affiliations":1929,"properties":1941},"76f4bcd1-7525-4f06-b7bd-b609f19d158e",[],[1930],{"id":1931,"sortIndex":36,"affiliation":1932,"properties":26},"50b39abe-a167-4588-9ce3-4b245458154c",{"id":1933,"createTime":1934,"updateTime":1935,"relativeEntities":1936,"slug":1937,"properties":1938,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"d38bfdab-d399-44a8-89df-0da62237e1f8","2024-04-17T21:46:29.364+00:00","2024-10-16T01:07:30.626+00:00",[],"-University-of-Massachusetts-Lowell-Lowell-USA-",{"title":1939},{"EN":1940},"[University of Massachusetts Lowell, Lowell, USA]",{"openalex":1942,"orcid":1944,"title":1946},{"VOID":1943},"A5100440164",{"VOID":1945},"https:\u002F\u002Forcid.org\u002F0000-0003-1172-1551",{"EN":1947},"Jie Wang",{"id":1949,"sortIndex":36,"researcher":26,"roles":1950,"affiliations":1951,"properties":1958},"994b6198-293b-4ec3-94e6-57f8284c7be9",[],[1952],{"id":1953,"sortIndex":36,"affiliation":1954,"properties":26},"104d8501-e5b6-4957-9795-a40128e14628",{"id":1911,"createTime":1912,"updateTime":1913,"relativeEntities":1955,"slug":1915,"properties":1956,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1957},{"VI":1918},{"openalex":1959,"orcid":1961,"title":1963},{"VOID":1960},"A5062327704",{"VOID":1962},"https:\u002F\u002Forcid.org\u002F0000-0001-6556-2264",{"EN":1964},"Xiang Cheng",{"id":1966,"sortIndex":114,"researcher":26,"roles":1967,"affiliations":1968,"properties":1975},"bbf80f5a-a054-4ee3-bfea-bc609c4caa45",[],[1969],{"id":1970,"sortIndex":36,"affiliation":1971,"properties":26},"32410e8d-92a5-41e1-8efa-f60597756b53",{"id":1911,"createTime":1912,"updateTime":1913,"relativeEntities":1972,"slug":1915,"properties":1973,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1974},{"VI":1918},{"openalex":1976,"orcid":1978,"title":1980},{"VOID":1977},"A5101759820",{"VOID":1979},"https:\u002F\u002Forcid.org\u002F0000-0002-3242-150X",{"EN":1981},"Zhongbao Zhang",{"id":1983,"sortIndex":59,"researcher":26,"roles":1984,"affiliations":1985,"properties":1992},"916c1e87-2e8e-4ba0-a0c6-473f2811c593",[],[1986],{"id":1987,"sortIndex":36,"affiliation":1988,"properties":26},"3029f85d-69c3-4c45-a014-8b459f21d628",{"id":1911,"createTime":1912,"updateTime":1913,"relativeEntities":1989,"slug":1915,"properties":1990,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1991},{"VI":1918},{"openalex":1993,"orcid":1995,"title":1997},{"VOID":1994},"A5068218622",{"VOID":1996},"https:\u002F\u002Forcid.org\u002F0000-0003-3405-1183",{"EN":1998},"Hanchi Wang",{"id":2000,"sortIndex":162,"researcher":26,"roles":2001,"affiliations":2002,"properties":2009},"5f6ea006-d666-46d5-9ea0-8d321e65e1fa",[],[2003],{"id":2004,"sortIndex":36,"affiliation":2005,"properties":26},"33ed9df4-fed1-4e84-a127-3ab0b61fb9d6",{"id":1933,"createTime":1934,"updateTime":1935,"relativeEntities":2006,"slug":1937,"properties":2007,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2008},{"EN":1940},{"openalex":2010,"orcid":2012,"title":2014},{"VOID":2011},"A5003621523",{"VOID":2013},"https:\u002F\u002Forcid.org\u002F0000-0002-5301-5092",{"EN":2015},"Yan Luo",{"id":2017,"sortIndex":111,"researcher":26,"roles":2018,"affiliations":2019,"properties":2026},"b270e967-3ae9-40c9-a9d8-73b51c5745a1",[],[2020],{"id":2021,"sortIndex":36,"affiliation":2022,"properties":26},"a4d717b7-1a93-485e-aea2-860b6d896f22",{"id":1911,"createTime":1912,"updateTime":1913,"relativeEntities":2023,"slug":1915,"properties":2024,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2025},{"VI":1918},{"openalex":2027,"orcid":2029,"title":2031},{"VOID":2028},"A5011978021",{"VOID":2030},"https:\u002F\u002Forcid.org\u002F0000-0002-6978-1787",{"EN":2032},"Fangchun Yang",{"url":26,"publisher":2034,"properties":2059},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2035,"slug":663,"properties":2036,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2042,"manageAffiliations":2043,"indexDatabases":2044,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2037,"issn":2038,"introduce":2039,"eissn":2040,"title":2041},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2045,2052],{"id":735,"indexDatabase":2046,"url":750,"indexYears":26,"academicFieldIds":2051,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":2047,"label":2048,"description":2049,"key":746,"publicationTags":2050,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":2053,"url":728,"indexYears":729,"academicFieldIds":2058,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":2054,"label":2055,"description":2056,"key":725,"publicationTags":2057,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":2060,"pages":2062,"issue":2064},{"VOID":2061},"41",{"VOID":2063},"38-47",{"VOID":1227},506,{"total":2065,"publishYear":26,"statisticByYear":2067},{"2012":336,"2013":252,"2014":358,"2015":254,"2016":47,"2017":539,"2018":29,"2019":252,"2020":257,"2021":396,"2022":238,"2023":244,"2024":116},"2011-04-15",2011,[2071,2074,2077,2080,2083,2086,2089,2092,2095,2098,2101,2104,2107,2109,2111,2114,2117,2120,2122,2125,2128,2131,2134,2136,2139,2142,2145,2147],{"id":26,"text":2072,"url":26,"identifiers":2073},"Amazonec2 http:\u002F\u002Faws.amazon.com\u002Fec2\u002F.  Amazonec2 http:\u002F\u002Faws.amazon.com\u002Fec2\u002F.",{},{"id":26,"text":2075,"url":26,"identifiers":2076},"VNE-RW Simulator http:\u002F\u002Fint.bupt.edu.cn\u002F~sensu\u002Fvne-rw.html.  VNE-RW Simulator http:\u002F\u002Fint.bupt.edu.cn\u002F~sensu\u002Fvne-rw.html.",{},{"id":26,"text":2078,"url":26,"identifiers":2079},"VNE Simulator http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz.  VNE Simulator http:\u002F\u002Fwww.cs.princeton.edu\u002F~minlanyu\u002Fembed.tar.gz.",{},{"id":26,"text":2081,"url":26,"identifiers":2082},"R.K. Ahuja T.L. Magnanti J.B. Orlin and K. Weihe. Network fows: theory algorithms and applications. Prentice hall Englewood Cliffs NJ 1993.   R.K. Ahuja T.L. Magnanti J.B. Orlin and K. Weihe. Network fows: theory algorithms and applications. Prentice hall Englewood Cliffs NJ 1993.",{},{"id":26,"text":2084,"url":26,"identifiers":2085},"Andersen David G., 2002, Unpublished Manuscript",{},{"id":26,"text":2087,"url":26,"identifiers":2088},"10.1145\u002F1052934.1052938",{"doi":2087},{"id":26,"text":2090,"url":26,"identifiers":2091},"10.1007\u002F978-3-642-12963-6_3",{"doi":2090},{"id":26,"text":2093,"url":26,"identifiers":2094},"10.1109\u002FMCOM.2009.5183468",{"doi":2093},{"id":26,"text":2096,"url":26,"identifiers":2097},"10.1109\u002FINFCOM.2009.5061987",{"doi":2096},{"id":26,"text":2099,"url":26,"identifiers":2100},"Cordella L.P., 2001, 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 149",{},{"id":26,"text":2102,"url":26,"identifiers":2103},"10.1109\u002FTKDE.2004.1264818",{"doi":2102},{"id":26,"text":2105,"url":26,"identifiers":2106},"10.1109\u002FSFCS.1994.365697",{"doi":2105},{"id":26,"text":1271,"url":26,"identifiers":2108},{"doi":1271},{"id":26,"text":1274,"url":26,"identifiers":2110},{"doi":1274},{"id":26,"text":2112,"url":26,"identifiers":2113},"Global Environment for Network Innovations. National Science Foundation http:\u002F\u002Fwww.geni.net\u002F August 2005.  Global Environment for Network Innovations. National Science Foundation http:\u002F\u002Fwww.geni.net\u002F August 2005.",{},{"id":26,"text":2115,"url":26,"identifiers":2116},"10.1109\u002FTPAMI.2005.138",{"doi":2115},{"id":26,"text":2118,"url":26,"identifiers":2119},"C. Guo G. Lu H.J. Wang S. Yang C. Kong P. Sun W. Wu Y. Zhang MSR Asia and MSR Redmond. SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees.  C. Guo G. Lu H.J. Wang S. Yang C. Kong P. Sun W. Wu Y. Zhang MSR Asia and MSR Redmond. SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees.",{},{"id":26,"text":1280,"url":26,"identifiers":2121},{"doi":1280},{"id":26,"text":2123,"url":26,"identifiers":2124},"10.1145\u002F1544012.1544027",{"doi":2123},{"id":26,"text":2126,"url":26,"identifiers":2127},"10.1109\u002FICC.2008.1056",{"doi":2126},{"id":26,"text":2129,"url":26,"identifiers":2130},"10.1145\u002F1592648.1592662",{"doi":2129},{"id":26,"text":2132,"url":26,"identifiers":2133},"Page L., 1998, Stanford Digital Library Technologies Project",{},{"id":26,"text":1307,"url":26,"identifiers":2135},{"doi":1307},{"id":26,"text":2137,"url":26,"identifiers":2138},"Seneta E., 2006, Springer Verlag",{},{"id":26,"text":2140,"url":26,"identifiers":2141},"10.1109\u002FGLOCOM.2003.1258787",{"doi":2140},{"id":26,"text":2143,"url":26,"identifiers":2144},"Turner JS, IEEE Global Telecommunications Conference, 2005. GLOBECOM'05, 2",{},{"id":26,"text":1117,"url":26,"identifiers":2146},{"doi":1117},{"id":26,"text":1322,"url":26,"identifiers":2148},{"doi":1322},{"id":2150,"createTime":2151,"updateTime":2151,"relativeEntities":2152,"slug":2153,"properties":2154,"entityType":775,"verifyStatus":28,"verifyTime":2166,"verifyNote":2167,"syncStatus":28,"languages":2168,"translateLanguages":26,"viewCount":36,"primaryUrl":2169,"fullTextUrl":26,"authors":2170,"publicationType":961,"publisherRelationship":2201,"citationCount":2234,"citationInfo":2235,"publishDate":2237,"publishYear":2238,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2239,"isForceReanalyzing":1100},"ffb1824b-d187-4c77-9842-a3b4c0fb5ce5","2024-09-12T03:38:09.186+00:00",[],"High-performance-TCP-in-ANSNET",{"mag":2155,"keywords":2157,"openalex":2158,"abstract":2160,"title":2162,"doi":2164},{"VOID":2156},"2054256732",{},{"VOID":2159},"W2054256732",{"EN":2161},"\u003Cjats:p>This report concentrates on specific requirements and goals of the research networks supported by ANSNET, but applies to any TCP dominated high speed WAN and in particular those striving to support high speed end-to-end flows. Measurements have been made under conditions intended to better understand performance barriers imposed by network equipment queueing capacities and queue drop strategies.The IBM RS\u002F6000 based routers currently supporting ANSNET performed very well in these tests. Measurements have been made with the current software and performance enhanced software. Single TCP flows are able to achieve 40 Mb\u002Fs and competing multiple TCP flows achieve over 41 Mb\u002Fs link utilization on 44.7 Mb\u002Fs DS3 links with delays comparable to US cross continent ANSNET delays. Congestion collapse is demonstrated with intentionally reduced queueing capacity and using window sizes much larger than optimal.A variation of Floyd and Jacobson's Random Early Detection (RED) algorithm [1] is tested. Performance improved with the use of RED for tests involving multiple flows. With RED and queueing capacity at or above the delay bandwidth product, congestion collapse is avoided, allowing the maximum window size to safely be set arbitrarily high.Queueing capacity greater than or equal to the delay bandwidth product and RED are recommended. RED provides performance improvement in all but the single flow case, but cannot substitute for adequate queueing capacity, particularly if high speed flows are to be supported.\u003C\u002Fjats:p>",{"EN":2163},"High performance TCP in ANSNET",{"VOID":2165},"10.1145\u002F205511.205520","2024-09-12T03:38:09.185+00:00","Author affiliation is blank",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F205511.205520",[2171,2190],{"id":2172,"sortIndex":36,"researcher":26,"roles":2173,"affiliations":2174,"properties":2185},"2b76de59-6030-4fce-aa1b-1eaad7228cc3",[],[2175],{"id":2176,"sortIndex":36,"affiliation":2177,"properties":26},"ceb1bf1d-499c-425f-856e-4513dc73c580",{"id":2178,"createTime":2179,"updateTime":2179,"relativeEntities":2180,"slug":2181,"properties":2182,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"319422e5-7ed7-401a-a13d-92e57a3cdec8","2024-09-12T03:38:09.216+00:00",[],"Advanced-Network-Services-Inc-",{"title":2183},{"EN":2184},"Advanced Network & Services, Inc .",{"openalex":2186,"title":2188},{"VOID":2187},"A5086022930",{"EN":2189},"Curtis Villamizar",{"id":2191,"sortIndex":115,"researcher":26,"roles":2192,"affiliations":2193,"properties":2194},"097ea12b-bd20-433a-98cc-55c5b2c91f51",[],[],{"openalex":2195,"orcid":2197,"title":2199},{"VOID":2196},"A5101763789",{"VOID":2198},"https:\u002F\u002Forcid.org\u002F0000-0003-2221-7772",{"EN":2200},"Cheng Song",{"url":26,"publisher":2202,"properties":2227},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2203,"slug":663,"properties":2204,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2210,"manageAffiliations":2211,"indexDatabases":2212,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2205,"issn":2206,"introduce":2207,"eissn":2208,"title":2209},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2213,2220],{"id":735,"indexDatabase":2214,"url":750,"indexYears":26,"academicFieldIds":2219,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":2215,"label":2216,"description":2217,"key":746,"publicationTags":2218,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":2221,"url":728,"indexYears":729,"academicFieldIds":2226,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":2222,"label":2223,"description":2224,"key":725,"publicationTags":2225,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":2228,"pages":2230,"issue":2232},{"VOID":2229},"24",{"VOID":2231},"45-60",{"VOID":2233},"5",369,{"total":2234,"publishYear":26,"statisticByYear":2236},{"2012":516,"2013":51,"2014":516,"2015":53,"2016":158,"2017":158,"2018":116,"2019":116,"2020":135,"2021":52,"2022":162,"2023":59,"2024":114},"1994-10-20",1994,[2240,2243,2246,2249,2252,2255,2258,2261,2264,2267,2271,2274,2278,2281,2284,2287,2290,2293,2296,2299,2302,2305,2308,2311,2314,2317,2320,2323,2326,2329,2332,2335,2338,2341,2344,2347,2350,2353,2356],{"id":26,"text":2241,"url":26,"identifiers":2242},"10.1109\u002F90.251892",{"doi":2241},{"id":26,"text":2244,"url":26,"identifiers":2245},"Almes G. T., 1994, Third Symposium on High Speed Networking for Research in Europe",{},{"id":26,"text":2247,"url":26,"identifiers":2248},"Claffy K. C., 1993, Internet Society",{},{"id":26,"text":2250,"url":26,"identifiers":2251},"{4} ANS Network Operations Center \"Ansnet link utilization daily reports.\" unpublished reports used for capacity planning Oct 1994.  {4} ANS Network Operations Center \"Ansnet link utilization daily reports.\" unpublished reports used for capacity planning Oct 1994.",{},{"id":26,"text":2253,"url":26,"identifiers":2254},"{5} ANS Network Operations Center \"Ansnet congestion loss daily reports.\" unpublished reports used for capacity planning Oct 1994.  {5} ANS Network Operations Center \"Ansnet congestion loss daily reports.\" unpublished reports used for capacity planning Oct 1994.",{},{"id":26,"text":2256,"url":26,"identifiers":2257},"10.1145\u002F1024908.1024910",{"doi":2256},{"id":26,"text":2259,"url":26,"identifiers":2260},"10.1145\u002F52324.52356",{"doi":2259},{"id":26,"text":2262,"url":26,"identifiers":2263},"{8} J. Postel \"Transmission control protocol \" Network Working Group Request for Comments RFC 793 Information Sciences Institute University of Southern California Sept. 1981.  {8} J. Postel \"Transmission control protocol \" Network Working Group Request for Comments RFC 793 Information Sciences Institute University of Southern California Sept. 1981.",{},{"id":26,"text":2265,"url":26,"identifiers":2266},"Clark D., 1982, Internet Engineering Task Force",{},{"id":26,"text":2268,"url":26,"identifiers":2269},"{10} J. Nagle \"Congestion control in IP\u002FTCP internetworks \" Request for Comments RFC 896 Internet Engineering Task Force Jan. 1984.  {10} J. Nagle \"Congestion control in IP\u002FTCP internetworks \" Request for Comments RFC 896 Internet Engineering Task Force Jan. 1984.",{"doi":2270},"10.17487\u002Frfc0896",{"id":26,"text":2272,"url":26,"identifiers":2273},"Postel J., 1983, Internet Engineering Task Force",{},{"id":26,"text":2275,"url":26,"identifiers":2276},"{12} D. Mills \"Internet delay experiments \" Request for Comments RFC 889 Internet Engineering Task Force Dec. 1983.  {12} D. Mills \"Internet delay experiments \" Request for Comments RFC 889 Internet Engineering Task Force Dec. 1983.",{"doi":2277},"10.17487\u002Frfc0889",{"id":26,"text":2279,"url":26,"identifiers":2280},"Braden R., 1989, Information Sciences Institute",{},{"id":26,"text":2282,"url":26,"identifiers":2283},"Peterson L., 1991, Internet Engineering Task Force",{},{"id":26,"text":2285,"url":26,"identifiers":2286},"Braden R., 1988, Internet Engineering Task Force",{},{"id":26,"text":2288,"url":26,"identifiers":2289},"Fox R., 1989, Internet Engineering Task Force",{},{"id":26,"text":2291,"url":26,"identifiers":2292},"McKenzie A., 1989, Internet Engineering Task Force",{},{"id":26,"text":2294,"url":26,"identifiers":2295},"Braden R., 1990, Internet Engineering Task Force",{},{"id":26,"text":2297,"url":26,"identifiers":2298},"Borman D., 1992, Internet Engineering Task Force",{},{"id":26,"text":2300,"url":26,"identifiers":2301},"{20} W. R. Stevens TCP\u002FIP illustrated: the protocols vol. 1. Reading Massachusetts : Addison-Wesley 1994.   {20} W. R. Stevens TCP\u002FIP illustrated: the protocols vol. 1. Reading Massachusetts : Addison-Wesley 1994.",{},{"id":26,"text":2303,"url":26,"identifiers":2304},"10.1109\u002F35.29545",{"doi":2303},{"id":26,"text":2306,"url":26,"identifiers":2307},"10.1145\u002F378444.378446",{"doi":2306},{"id":26,"text":2309,"url":26,"identifiers":2310},"{23} V. Jacobson \"Some design issues for high-speed networks \" in Networkshop '93 (Melbourne Australia) Nov. 1993.  {23} V. Jacobson \"Some design issues for high-speed networks \" in Networkshop '93 (Melbourne Australia) Nov. 1993.",{},{"id":26,"text":2312,"url":26,"identifiers":2313},"Mogul J., 1990, Internet Engineering Task Force",{},{"id":26,"text":2315,"url":26,"identifiers":2316},"Knowles S., 1993, Internet Engineering Task Force",{},{"id":26,"text":2318,"url":26,"identifiers":2319},"Floyd S., 1992, On traffic phase effects in packet-switched gateways, Internetworking : Research and Experience, 3, 115",{},{"id":26,"text":2321,"url":26,"identifiers":2322},"10.1145\u002F381906.381931",{"doi":2321},{"id":26,"text":2324,"url":26,"identifiers":2325},"10.1145\u002F115992.116006",{"doi":2324},{"id":26,"text":2327,"url":26,"identifiers":2328},"10.1145\u002F179606.179616",{"doi":2327},{"id":26,"text":2330,"url":26,"identifiers":2331},"{30} C. Villamizar \"A variation of random early detection congestion avoidance.\" work in progress.  {30} C. Villamizar \"A variation of random early detection congestion avoidance.\" work in progress.",{},{"id":26,"text":2333,"url":26,"identifiers":2334},"10.1145\u002F115994.116003",{"doi":2333},{"id":26,"text":2336,"url":26,"identifiers":2337},"Paxson V., 1993, University of California",{},{"id":26,"text":2339,"url":26,"identifiers":2340},"10.1145\u002F167954.166255",{"doi":2339},{"id":26,"text":2342,"url":26,"identifiers":2343},"10.1145\u002F190314.190338",{"doi":2342},{"id":26,"text":2345,"url":26,"identifiers":2346},"{35} C. Partridge \"Editorial : The end of simple traffic models \" IEEE Network vol. 7 Sept. 1993.  {35} C. Partridge \"Editorial : The end of simple traffic models \" IEEE Network vol. 7 Sept. 1993.",{},{"id":26,"text":2348,"url":26,"identifiers":2349},"{36} T. Skibo \"Experiences with tcp extensions for high-performance networks.\" contained in ftp:\u002F\u002Fvixen.cso.uiuc.edu\u002Fpub\u002Ftcplw.shar.Z.  {36} T. Skibo \"Experiences with tcp extensions for high-performance networks.\" contained in ftp:\u002F\u002Fvixen.cso.uiuc.edu\u002Fpub\u002Ftcplw.shar.Z.",{},{"id":26,"text":2351,"url":26,"identifiers":2352},"10.1145\u002F122431.122434",{"doi":2351},{"id":26,"text":2354,"url":26,"identifiers":2355},"{38} I. Merit \"Nsfnet statistics repository.\" ftp:\u002F\u002Fnis.nsf.net\u002Fstatistics\u002Fnsfnet\u002F.  {38} I. Merit \"Nsfnet statistics repository.\" ftp:\u002F\u002Fnis.nsf.net\u002Fstatistics\u002Fnsfnet\u002F.",{},{"id":26,"text":2357,"url":26,"identifiers":2358},"{39} A. Romanow and S. Floyd \"Dynamics of TCP traffic over ATM networks.\" see also 6th IEEE LAN\u002FMAN Workshop 1993.  {39} A. Romanow and S. Floyd \"Dynamics of TCP traffic over ATM networks.\" see also 6th IEEE LAN\u002FMAN Workshop 1993.",{"doi":2359},"10.1145\u002F190314.190322",{"id":2361,"createTime":2362,"updateTime":2362,"relativeEntities":2363,"slug":2364,"properties":2365,"entityType":775,"verifyStatus":25,"verifyTime":2362,"verifyNote":777,"syncStatus":28,"languages":2376,"translateLanguages":26,"viewCount":36,"primaryUrl":2377,"fullTextUrl":26,"authors":2378,"publicationType":961,"publisherRelationship":2461,"citationCount":2493,"citationInfo":2494,"publishDate":2496,"publishYear":2497,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2498,"isForceReanalyzing":1100},"979569c7-6355-4faf-ae29-00f6b3f88f6f","2025-01-25T15:03:41.035+00:00",[],"Adaptive-forwarding-in-named-data-networking",{"mag":2366,"keywords":2368,"openalex":2369,"abstract":2371,"title":2373,"doi":2375},{"VOID":2367},"2114103190",{},{"VOID":2370},"W2114103190",{"EN":2372},"\u003Cjats:p>In Named Data Networking (NDN) architecture, packets carry data names rather than source or destination addresses. This change of paradigm leads to a new data plane: data consumers send out Interest packets, routers forward them and maintain the state of pending Interests, which is used to guide Data packets back to the consumers. NDN routers' forwarding process is able to detect network problems by observing the two-way traffic of Interest and Data packets, and explore multiple alternative paths without loops. This is in sharp contrast to today's IP forwarding process which follows a single path chosen by the routing process, with no adaptability of its own. In this paper we outline the design of NDN's adaptive forwarding, articulate its potential benefits, and identify open research issues.\u003C\u002Fjats:p>",{"EN":2374},"Adaptive forwarding in named data networking",{"VOID":1086},[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F2317307.2317319",[2379,2397,2414,2428,2447],{"id":2380,"sortIndex":59,"researcher":26,"roles":2381,"affiliations":2382,"properties":2393},"d77c4d6e-0cc5-433a-9ceb-a3114e5e5012",[],[2383],{"id":2384,"sortIndex":36,"affiliation":2385,"properties":26},"fd893d2b-df53-4536-a011-a30169d28e3f",{"id":2386,"createTime":2387,"updateTime":2387,"relativeEntities":2388,"slug":2389,"properties":2390,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"478a8b53-6f09-4db6-a783-13ada8d5af06","2025-01-25T15:03:41.051+00:00",[],"University-of-Arizona-Arizona-AZ-USA-TAB-",{"title":2391},{"EN":2392},"University of Arizona, Arizona, AZ, USA#TAB#",{"openalex":2394,"orcid":2395,"title":2396},{"VOID":916},{"VOID":918},{"EN":920},{"id":2398,"sortIndex":36,"researcher":26,"roles":2399,"affiliations":2400,"properties":2407},"f89349b1-a2bb-466b-b531-17c7746fe9e9",[],[2401],{"id":2402,"sortIndex":36,"affiliation":2403,"properties":26},"33779540-9cf9-4c28-84d6-38c44cf4ca0f",{"id":2386,"createTime":2387,"updateTime":2387,"relativeEntities":2404,"slug":2389,"properties":2405,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2406},{"EN":2392},{"openalex":2408,"orcid":2410,"title":2412},{"VOID":2409},"A5103187665",{"VOID":2411},"https:\u002F\u002Forcid.org\u002F0000-0003-3075-8413",{"EN":2413},"Cheng Yi",{"id":2415,"sortIndex":115,"researcher":26,"roles":2416,"affiliations":2417,"properties":2424},"504dc868-0bc5-47e2-bfd5-6673e7eb6fe0",[],[2418],{"id":2419,"sortIndex":36,"affiliation":2420,"properties":26},"2f691e83-a60b-4ade-9dc2-7b0730c53be8",{"id":810,"createTime":811,"updateTime":812,"relativeEntities":2421,"slug":814,"properties":2422,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2423},{"VI":817},{"openalex":2425,"orcid":2426,"title":2427},{"VOID":835},{"VOID":837},{"EN":839},{"id":2429,"sortIndex":114,"researcher":26,"roles":2430,"affiliations":2431,"properties":2443},"d99abf7f-56b5-4328-85da-e7bc829f0f7b",[],[2432],{"id":2433,"sortIndex":36,"affiliation":2434,"properties":26},"a3ef6ba6-ff23-4af4-997e-593f5181610d",{"id":2435,"createTime":2436,"updateTime":2437,"relativeEntities":2438,"slug":2439,"properties":2440,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"df58972c-2534-41ab-850d-4ab2d125f015","2024-01-12T12:37:29.873+00:00","2025-01-25T15:03:41.083+00:00",[],"University-of-Memphis-Memphis-TN-USA",{"title":2441},{"VI":2442},"University of Memphis, Memphis, TN, USA",{"openalex":2444,"orcid":2445,"title":2446},{"VOID":894},{"VOID":896},{"EN":898},{"id":2448,"sortIndex":111,"researcher":26,"roles":2449,"affiliations":2450,"properties":2457},"221e946d-bf15-4661-bc9e-21ca86428efa",[],[2451],{"id":2452,"sortIndex":36,"affiliation":2453,"properties":26},"c2d2009e-07cd-4fea-a5ad-294f92ba6ce1",{"id":810,"createTime":811,"updateTime":812,"relativeEntities":2454,"slug":814,"properties":2455,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2456},{"VI":817},{"openalex":2458,"orcid":2459,"title":2460},{"VOID":852},{"VOID":854},{"EN":856},{"url":26,"publisher":2462,"properties":2487},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2463,"slug":663,"properties":2464,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2470,"manageAffiliations":2471,"indexDatabases":2472,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2465,"issn":2466,"introduce":2467,"eissn":2468,"title":2469},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2473,2480],{"id":735,"indexDatabase":2474,"url":750,"indexYears":26,"academicFieldIds":2479,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":2475,"label":2476,"description":2477,"key":746,"publicationTags":2478,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":2481,"url":728,"indexYears":729,"academicFieldIds":2486,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":2482,"label":2483,"description":2484,"key":725,"publicationTags":2485,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":2488,"pages":2490,"issue":2492},{"VOID":2489},"42",{"VOID":2491},"62-67",{"VOID":994},298,{"total":2493,"publishYear":26,"statisticByYear":2495},{"2012":59,"2013":238,"2014":237,"2015":397,"2016":125,"2017":257,"2018":517,"2019":239,"2020":516,"2021":173,"2022":103,"2023":173,"2024":162},"2012-06-26",2012,[2499,2502,2504,2507,2510,2513,2517],{"id":26,"text":2500,"url":26,"identifiers":2501},"Ioannidis J., 2002, Proc. of NDSS Symposium",{},{"id":26,"text":1050,"url":26,"identifiers":2503},{"doi":1050},{"id":26,"text":2505,"url":26,"identifiers":2506},"10.1109\u002FICNP.2006.320179",{"doi":2505},{"id":26,"text":2508,"url":26,"identifiers":2509},"10.1145\u002F633025.633035",{"doi":2508},{"id":26,"text":2511,"url":26,"identifiers":2512},"10.1145\u002F1282380.1282408",{"doi":2511},{"id":26,"text":2514,"url":26,"identifiers":2515},"Paolo Gasti Gene Tsudik Ersin Uzun Lixia Zhang. DoS & DDoS in named-data networking May 2012. Under submission.  Paolo Gasti Gene Tsudik Ersin Uzun Lixia Zhang. DoS & DDoS in named-data networking May 2012. Under submission.",{"doi":2516},"10.1109\u002FICCCN.2013.6614127",{"id":26,"text":2518,"url":26,"identifiers":2519},"10.1109\u002FICDCS.2012.35",{"doi":2518},{"id":2521,"createTime":2522,"updateTime":2522,"relativeEntities":2523,"slug":2524,"properties":2525,"entityType":775,"verifyStatus":25,"verifyTime":2522,"verifyNote":777,"syncStatus":28,"languages":2537,"translateLanguages":26,"viewCount":36,"primaryUrl":2538,"fullTextUrl":26,"authors":2539,"publicationType":961,"publisherRelationship":2616,"citationCount":2648,"citationInfo":2649,"publishDate":2651,"publishYear":2652,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2653,"isForceReanalyzing":1100},"74249b7a-8e6e-44e5-9577-0b5380204868","2024-11-28T04:55:19.600+00:00",[],"Achieving-sub-second-IGP-convergence-in-large-IP-networks",{"mag":2526,"keywords":2528,"openalex":2529,"abstract":2531,"title":2533,"doi":2535},{"VOID":2527},"2009038171",{},{"VOID":2530},"W2009038171",{"EN":2532},"\u003Cjats:p>We describe and analyse in details the various factors that influence the convergence time of intradomain link state routing protocols. This convergence time reflects the time required by a network to react to the failure of a link or a router. To characterise the convergence process, we first use detailed measurements to determine the time required to perform the various operations of a link state protocol on currently deployed routers. We then build a simulation model based on those measurements and use it to study the convergence time in large networks. Our measurements and simulations indicate that sub-second link-state IGP convergence can be easily met on an ISP network without any compromise on stability.\u003C\u002Fjats:p>",{"EN":2534},"Achieving sub-second IGP convergence in large IP networks",{"VOID":2536},"10.1145\u002F1070873.1070877",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F1070873.1070877",[2540,2560,2582,2599],{"id":2541,"sortIndex":115,"researcher":26,"roles":2542,"affiliations":2543,"properties":2555},"cdebc242-55e3-47c8-8276-bf462fb68c4f",[],[2544],{"id":2545,"sortIndex":36,"affiliation":2546,"properties":26},"7a92a858-2737-46ce-8263-38f219c56f44",{"id":2547,"createTime":2548,"updateTime":2549,"relativeEntities":2550,"slug":2551,"properties":2552,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"01f80683-119d-44e4-8c67-5c7592048528","2024-09-04T15:49:38.232+00:00","2025-06-11T15:24:06.838+00:00",[],"Cisco-Systems",{"title":2553},{"EN":2554},"Cisco Systems",{"openalex":2556,"title":2558},{"VOID":2557},"A5022173749",{"EN":2559},"Clarence Filsfils",{"id":2561,"sortIndex":36,"researcher":26,"roles":2562,"affiliations":2563,"properties":2575},"6468f2f9-c4d4-4cea-9871-87778763d6b0",[],[2564],{"id":2565,"sortIndex":36,"affiliation":2566,"properties":26},"89a7c0e6-18e9-4521-a0ae-b4fc82042045",{"id":2567,"createTime":2568,"updateTime":2569,"relativeEntities":2570,"slug":2571,"properties":2572,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"33372aec-66e3-4e43-9442-71851cfe2e86","2024-01-21T19:17:34.886+00:00","2024-11-28T04:55:19.681+00:00",[],"Universit%C3%A9-catholique-de-Louvain-UCL-Belgium",{"title":2573},{"VI":2574},"Université catholique de Louvain (UCL), Belgium",{"openalex":2576,"orcid":2578,"title":2580},{"VOID":2577},"A5047044311",{"VOID":2579},"https:\u002F\u002Forcid.org\u002F0009-0001-0481-4912",{"EN":2581},"Pierre François",{"id":2583,"sortIndex":114,"researcher":26,"roles":2584,"affiliations":2585,"properties":2592},"c8d8bb8a-7785-43e9-b25a-22a8885e190e",[],[2586],{"id":2587,"sortIndex":36,"affiliation":2588,"properties":26},"90b303ca-dd30-4220-995b-589382acca35",{"id":2547,"createTime":2548,"updateTime":2549,"relativeEntities":2589,"slug":2551,"properties":2590,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2591},{"EN":2554},{"openalex":2593,"orcid":2595,"title":2597},{"VOID":2594},"A5084987369",{"VOID":2596},"https:\u002F\u002Forcid.org\u002F0000-0003-3290-7785",{"EN":2598},"John Evans",{"id":2600,"sortIndex":59,"researcher":26,"roles":2601,"affiliations":2602,"properties":2609},"11c7ac27-4e6e-469f-bb98-fa6e8c71e138",[],[2603],{"id":2604,"sortIndex":36,"affiliation":2605,"properties":26},"8bf3cfb1-366f-4174-ae90-715da6191f61",{"id":2567,"createTime":2568,"updateTime":2569,"relativeEntities":2606,"slug":2571,"properties":2607,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2608},{"VI":2574},{"openalex":2610,"orcid":2612,"title":2614},{"VOID":2611},"A5024795280",{"VOID":2613},"https:\u002F\u002Forcid.org\u002F0000-0002-6717-0296",{"EN":2615},"Olivier Bonaventure",{"url":26,"publisher":2617,"properties":2642},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2618,"slug":663,"properties":2619,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2625,"manageAffiliations":2626,"indexDatabases":2627,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2620,"issn":2621,"introduce":2622,"eissn":2623,"title":2624},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2628,2635],{"id":735,"indexDatabase":2629,"url":750,"indexYears":26,"academicFieldIds":2634,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":2630,"label":2631,"description":2632,"key":746,"publicationTags":2633,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":2636,"url":728,"indexYears":729,"academicFieldIds":2641,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":2637,"label":2638,"description":2639,"key":725,"publicationTags":2640,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":2643,"pages":2645,"issue":2647},{"VOID":2644},"35",{"VOID":2646},"35-44",{"VOID":994},290,{"total":2648,"publishYear":26,"statisticByYear":2650},{"2012":222,"2013":79,"2014":234,"2015":516,"2016":356,"2017":52,"2018":52,"2019":162,"2020":158,"2021":50,"2022":111,"2023":162,"2024":114},"2005-07-01",2005,[2654,2657,2660,2663,2666,2669,2672,2675,2678,2681,2684,2687,2690,2693,2696,2699,2702,2705,2708,2711,2714,2717,2720,2723,2726,2729],{"id":26,"text":2655,"url":26,"identifiers":2656},"C. Alaettinoglu , V. Jacobson , and H. Yu . Towards millisecond IGP congergence. Internet draft, draft-alaettinoglu-ISIS-convergence-00.ps, work in progress , November 2000 .]] C. Alaettinoglu, V. Jacobson, and H. Yu. Towards millisecond IGP congergence. Internet draft, draft-alaettinoglu-ISIS-convergence-00.ps, work in progress, November 2000.]]",{},{"id":26,"text":2658,"url":26,"identifiers":2659},"10.1145\u002F383059.383077",{"doi":2658},{"id":26,"text":2661,"url":26,"identifiers":2662},"R. W. Callon . Use of OSI IS-IS for routing in TCP\u002FIP and dual environments. Request for Comments 1195 , Internet Engineering Task Force , Dec. 1990 .]] R. W. Callon. Use of OSI IS-IS for routing in TCP\u002FIP and dual environments. Request for Comments 1195, Internet Engineering Task Force, Dec. 1990.]]",{},{"id":26,"text":2664,"url":26,"identifiers":2665},"S. Casner . A fine-grained view of high-performance networking . Presented at NANOG22 , May 2001 .]] S. Casner. A fine-grained view of high-performance networking. Presented at NANOG22, May 2001.]]",{},{"id":26,"text":2667,"url":26,"identifiers":2668},"Cisco. IP Event Dampening. http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newf%t\u002F120limit\u002F120s\u002F120s22\u002Fs_ipevdp.htm.]]  Cisco. IP Event Dampening. http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newf%t\u002F120limit\u002F120s\u002F120s22\u002Fs_ipevdp.htm.]]",{},{"id":26,"text":2670,"url":26,"identifiers":2671},"Cisco. IS-IS Fast-Flooding of LSPs Using the fast-flood Command. Technical document http:\u002F\u002Fwww.cisco.com\u002Fen\u002FUS\u002Fproducts\u002Fsw\u002Fiosswrel\u002Fps1829\u002Fproducts_feature_guide09186a00801e87ab.html.]]  Cisco. IS-IS Fast-Flooding of LSPs Using the fast-flood Command. Technical document http:\u002F\u002Fwww.cisco.com\u002Fen\u002FUS\u002Fproducts\u002Fsw\u002Fiosswrel\u002Fps1829\u002Fproducts_feature_guide09186a00801e87ab.html.]]",{},{"id":26,"text":2673,"url":26,"identifiers":2674},"Cisco. IS-IS Support for Priority-Driven IP Prefix RIB Installation. Technical document http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newf%t\u002F120limit\u002F120s\u002F120s26\u002Ffslocrib.pdf.]]  Cisco. IS-IS Support for Priority-Driven IP Prefix RIB Installation. Technical document http:\u002F\u002Fwww.cisco.com\u002Funivercd\u002Fcc\u002Ftd\u002Fdoc\u002Fproduct\u002Fsoftware\u002Fios120\u002F120newf%t\u002F120limit\u002F120s\u002F120s26\u002Ffslocrib.pdf.]]",{},{"id":26,"text":2676,"url":26,"identifiers":2677},"Cisco. SONET triggers. http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F127\u002Fsonetrig.pdf.]]  Cisco. SONET triggers. http:\u002F\u002Fwww.cisco.com\u002Fwarp\u002Fpublic\u002F127\u002Fsonetrig.pdf.]]",{},{"id":26,"text":2679,"url":26,"identifiers":2680},"10.1007\u002FBF01386390",{"doi":2679},{"id":26,"text":2682,"url":26,"identifiers":2683},"C. Filsfils . Fast IGP convergence . Presented at RIPE47 , January 2004 .]] C. Filsfils. Fast IGP convergence. Presented at RIPE47, January 2004.]]",{},{"id":26,"text":2685,"url":26,"identifiers":2686},"10.1109\u002FMNET.2004.1276606",{"doi":2685},{"id":26,"text":2688,"url":26,"identifiers":2689},"D. W. Jacob. SSF Implementation of OSPFv2 v0.2.2. http:\u002F\u002Fssfnet.d-jacob.net\u002F.]]  D. W. Jacob. SSF Implementation of OSPFv2 v0.2.2. http:\u002F\u002Fssfnet.d-jacob.net\u002F.]]",{},{"id":26,"text":2691,"url":26,"identifiers":2692},"D. Katz and D. Ward . Bidirectional forwarding detection. Internet draft, draft-ietf-bfd-base-02.txt, work in progress , March 2005 .]] D. Katz and D. Ward. Bidirectional forwarding detection. Internet draft, draft-ietf-bfd-base-02.txt, work in progress, March 2005.]]",{},{"id":26,"text":2694,"url":26,"identifiers":2695},"10.1109\u002FIWQOS.2004.1309386",{"doi":2694},{"id":26,"text":2697,"url":26,"identifiers":2698},"10.1109\u002FINFCOM.2004.1354653",{"doi":2697},{"id":26,"text":2700,"url":26,"identifiers":2701},"A. Martey . IS-IS Network Design Solutions . Cisco Press , 2002 .]] A. Martey. IS-IS Network Design Solutions. Cisco Press, 2002.]]",{},{"id":26,"text":2703,"url":26,"identifiers":2704},"10.1145\u002F800092.802981",{"doi":2703},{"id":26,"text":2706,"url":26,"identifiers":2707},"D. Oran . OSI IS-IS intra-domain routing protocol. Request for Comments 1142 , Internet Engineering Task Force , Feb. 1990 .]] D. Oran. OSI IS-IS intra-domain routing protocol. Request for Comments 1142, Internet Engineering Task Force, Feb. 1990.]]",{},{"id":26,"text":2709,"url":26,"identifiers":2710},"J. Parker , D. McPherson , and C. Alaettinoglu . Short Adjacency Hold Times in IS-IS. Internet draft, draft-parker-short-isis-hold-times-01.txt,work in progress , July 2001 .]] J. Parker, D. McPherson, and C. Alaettinoglu. Short Adjacency Hold Times in IS-IS. Internet draft, draft-parker-short-isis-hold-times-01.txt,work in progress, July 2001.]]",{},{"id":26,"text":2712,"url":26,"identifiers":2713},"10.1109\u002FDSN.2003.1209929",{"doi":2712},{"id":26,"text":2715,"url":26,"identifiers":2716},"Renesys. SSFNet Scalable Simulation Framework for Network Models. http:\u002F\u002Fwww.ssfnet.org\u002F.]]  Renesys. SSFNet Scalable Simulation Framework for Network Models. http:\u002F\u002Fwww.ssfnet.org\u002F.]]",{},{"id":26,"text":2718,"url":26,"identifiers":2719},"10.1145\u002F505202.505218",{"doi":2718},{"id":26,"text":2721,"url":26,"identifiers":2722},"10.1145\u002F347057.347426",{"doi":2721},{"id":26,"text":2724,"url":26,"identifiers":2725},"J.-P. Vasseur , M. Pickavet , and P. Demeester . Network Recovery: Protection and Restoration of Optical , SONET-SDH , and MPLS. Morgan Kaufmann , 2004 .]] J.-P. Vasseur, M. Pickavet, and P. Demeester. Network Recovery: Protection and Restoration of Optical, SONET-SDH, and MPLS. Morgan Kaufmann, 2004.]]",{},{"id":26,"text":2727,"url":26,"identifiers":2728},"H. Villfor . Operator experience from isis convergence tuning . Presented at RIPE47 , January 2004 .]] H. Villfor. Operator experience from isis convergence tuning. Presented at RIPE47, January 2004.]]",{},{"id":26,"text":2730,"url":26,"identifiers":2731},"R. White and A. Retana . IS-IS: Deployment in IP networks . Addison-Wesley , 2003 .]] R. White and A. Retana. IS-IS: Deployment in IP networks. Addison-Wesley, 2003.]]",{},{"id":2733,"createTime":2734,"updateTime":2734,"relativeEntities":2735,"slug":2736,"properties":2737,"entityType":775,"verifyStatus":25,"verifyTime":2734,"verifyNote":777,"syncStatus":28,"languages":2749,"translateLanguages":26,"viewCount":36,"primaryUrl":2750,"fullTextUrl":26,"authors":2751,"publicationType":961,"publisherRelationship":2796,"citationCount":2828,"citationInfo":2829,"publishDate":2831,"publishYear":2832,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2833,"isForceReanalyzing":1100},"d2c385ec-7b21-4133-92dd-e7eb50547d4d","2024-12-10T13:22:52.824+00:00",[],"Algorithmic-Nuggets-in-Content-Delivery",{"mag":2738,"keywords":2740,"openalex":2741,"abstract":2743,"title":2745,"doi":2747},{"VOID":2739},"2406213739",{},{"VOID":2742},"W2406213739",{"EN":2744},"\u003Cjats:p>This paper \"peeks under the covers\" at the subsystems that provide the basic functionality of a leading content delivery network. Based on our experiences in building one of the largest distributed systems in the world, we illustrate how sophisticated algorithmic research has been adapted to balance the load between and within server clusters, manage the caches on servers, select paths through an overlay routing network, and elect leaders in various contexts. In each instance, we first explain the theory underlying the algorithms, then introduce practical considerations not captured by the theoretical models, and finally describe what is implemented in practice. Through these examples, we highlight the role of algorithmic research in the design of complex networked systems. The paper also illustrates the close synergy that exists between research and industry where research ideas cross over into products and product requirements drive future research.\u003C\u002Fjats:p>",{"EN":2746},"Algorithmic Nuggets in Content Delivery",{"VOID":2748},"10.1145\u002F2805789.2805800",[102],"https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F2805789.2805800",[2752,2774],{"id":2753,"sortIndex":115,"researcher":26,"roles":2754,"affiliations":2755,"properties":2767},"827a446d-af69-455f-b2d0-791f2a098ede",[],[2756],{"id":2757,"sortIndex":36,"affiliation":2758,"properties":26},"34d2eded-d694-4381-bede-feb8e388f0e8",{"id":2759,"createTime":2760,"updateTime":2761,"relativeEntities":2762,"slug":2763,"properties":2764,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"6389b522-96e5-4777-811b-a5e1735c2b39","2023-12-26T10:17:26.363+00:00","2024-12-10T13:22:52.839+00:00",[],"University-of-Massachusetts-Amherst-MA-USA",{"title":2765},{"VI":2766},"University of Massachusetts, Amherst, MA USA",{"openalex":2768,"orcid":2770,"title":2772},{"VOID":2769},"A5037538509",{"VOID":2771},"https:\u002F\u002Forcid.org\u002F0000-0003-0558-6875",{"EN":2773},"Ramesh K. Sitaraman",{"id":2775,"sortIndex":36,"researcher":26,"roles":2776,"affiliations":2777,"properties":2789},"b9db3772-a39b-4591-aa33-89355f332b8b",[],[2778],{"id":2779,"sortIndex":36,"affiliation":2780,"properties":26},"989ee677-cafb-4992-a2d8-712b797e42d1",{"id":2781,"createTime":2782,"updateTime":2783,"relativeEntities":2784,"slug":2785,"properties":2786,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b60365f9-0c0b-45f7-837b-087e4441b1b8","2024-01-03T04:08:03.735+00:00","2025-01-30T08:54:34.095+00:00",[],"Duke-University-Durham-NC-USA",{"title":2787},{"VI":2788},"Duke University, Durham, NC, USA",{"openalex":2790,"orcid":2792,"title":2794},{"VOID":2791},"A5046808993",{"VOID":2793},"https:\u002F\u002Forcid.org\u002F0000-0002-5692-7062",{"EN":2795},"Bruce M. Maggs",{"url":26,"publisher":2797,"properties":2822},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2798,"slug":663,"properties":2799,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2805,"manageAffiliations":2806,"indexDatabases":2807,"url":753,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"country":2800,"issn":2801,"introduce":2802,"eissn":2803,"title":2804},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},{"EN":674},[],[],[2808,2815],{"id":735,"indexDatabase":2809,"url":750,"indexYears":26,"academicFieldIds":2814,"indexDatabaseRanking":26},{"id":737,"createTime":738,"updateTime":739,"relativeEntities":2810,"label":2811,"description":2812,"key":746,"publicationTags":2813,"standard":26},[],{"EN":742,"VI":742},{"VI":744,"EN":745},[748,749],[752],{"id":715,"indexDatabase":2816,"url":728,"indexYears":729,"academicFieldIds":2821,"indexDatabaseRanking":733},{"id":717,"createTime":718,"updateTime":719,"relativeEntities":2817,"label":2818,"description":2819,"key":725,"publicationTags":2820,"standard":26},[],{"EN":722,"VI":722},{"EN":722,"VI":724},[727],[731,732],{"volume":2823,"pages":2825,"issue":2827},{"VOID":2824},"45",{"VOID":2826},"52-66",{"VOID":994},214,{"total":2828,"publishYear":26,"statisticByYear":2830},{"2015":59,"2016":52,"2017":240,"2018":285,"2019":287,"2020":125,"2021":241,"2022":124,"2023":336,"2024":356},"2015-07-13",2015,[2834,2837,2840,2843,2846,2849,2852,2855,2858,2861,2864,2867,2870,2873,2876,2879,2882,2885,2888,2891,2894,2897,2900,2903,2906,2909,2912,2915,2918,2921,2924],{"id":26,"text":2835,"url":26,"identifiers":2836},"iostat - linux man page. http:\u002F\u002Flinux.die.net\u002Fman\u002F1\u002Fiostat.  iostat - linux man page. http:\u002F\u002Flinux.die.net\u002Fman\u002F1\u002Fiostat.",{},{"id":26,"text":2838,"url":26,"identifiers":2839},"10.1257\u002F000282805774670167",{"doi":2838},{"id":26,"text":2841,"url":26,"identifiers":2842},"Ravindra K. Ahuja , Thomas L. Magnanti , and James B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice Hall , 1993 . Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.",{},{"id":26,"text":2844,"url":26,"identifiers":2845},"Konstantin Andreev , Bruce M. Maggs , Adam Meyerson , Jevan Saks , and Ramesh K. Sitaraman . Algorithms for constructing overlay networks for live streaming. arXiv preprint arXiv:1109.4114 , 2011 . Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, and Ramesh K. Sitaraman. Algorithms for constructing overlay networks for live streaming. arXiv preprint arXiv:1109.4114, 2011.",{},{"id":26,"text":2847,"url":26,"identifiers":2848},"10.1145\u002F777412.777437",{"doi":2847},{"id":26,"text":2850,"url":26,"identifiers":2851},"10.1016\u002FS0166-218X(99)00203-6",{"doi":2850},{"id":26,"text":2853,"url":26,"identifiers":2854},"10.1145\u002F362686.362692",{"doi":2853},{"id":26,"text":2856,"url":26,"identifiers":2857},"10.1080\u002F15427951.2004.10129096",{"doi":2856},{"id":26,"text":2859,"url":26,"identifiers":2860},"Fangfei Cheng , Ramesh K. Sitaraman , and Marcelo Torres . End-user mapping : Next generation request routing for content delivery . In Proceedings of the 2015 ACM Conference on SIGCOMM, SIGCOMM '15 , 2015 . Fangfei Cheng, Ramesh K. Sitaraman, and Marcelo Torres. End-user mapping: Next generation request routing for content delivery. In Proceedings of the 2015 ACM Conference on SIGCOMM, SIGCOMM '15, 2015.",{},{"id":26,"text":2862,"url":26,"identifiers":2863},"10.1109\u002FMIC.2002.1036038",{"doi":2862},{"id":26,"text":2865,"url":26,"identifiers":2866},"10.1109\u002F90.851975",{"doi":2865},{"id":26,"text":2868,"url":26,"identifiers":2869},"David Gale and Lloyd S . Shapley . College admissions and the stability of marriage. American Mathematical Monthly, pages 9--15, 1962. David Gale and Lloyd S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, pages 9--15, 1962.",{},{"id":26,"text":2871,"url":26,"identifiers":2872},"Michel Goemans . Load balancing in content delivery networks . IMA Annual Program Year Workshop: Network Management and Design , April 2003 . Michel Goemans. Load balancing in content delivery networks. IMA Annual Program Year Workshop: Network Management and Design, April 2003.",{},{"id":26,"text":2874,"url":26,"identifiers":2875},"Dan Gusfield and Robert W. Irving . The Stable Marriage Problem: Structure and Algorithms . MIT Press , Cambridge, MA , 1989 . Dan Gusfield and Robert W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, 1989.",{},{"id":26,"text":2877,"url":26,"identifiers":2878},"10.1109\u002FICKS.2008.7",{"doi":2877},{"id":26,"text":2880,"url":26,"identifiers":2881},"10.1016\u002FS1389-1286(99)00055-9",{"doi":2880},{"id":26,"text":2883,"url":26,"identifiers":2884},"10.1145\u002F258533.258660",{"doi":2883},{"id":26,"text":2886,"url":26,"identifiers":2887},"David Karger , Eric Lehman , Tom Leighton , Matthew Levine , Daniel Lewin , and Rina Panigrahy . U. S. patent number 8,458,259: Method and apparatus for distributing requests among a plurality of resources , August 2002 . David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. U.S. patent number 8,458,259: Method and apparatus for distributing requests among a plurality of resources, August 2002.",{},{"id":26,"text":2889,"url":26,"identifiers":2890},"10.1109\u002FJPROC.2004.832956",{"doi":2889},{"id":26,"text":2892,"url":26,"identifiers":2893},"Leslie Lamport . Paxos made simple . ACM SIGACT News , 32 ( 4 ): 18 -- 25 , 2001 . Leslie Lamport. Paxos made simple. ACM SIGACT News, 32(4):18--25, 2001.",{},{"id":26,"text":2895,"url":26,"identifiers":2896},"10.1145\u002F357172.357176",{"doi":2895},{"id":26,"text":2898,"url":26,"identifiers":2899},"Daniel M. Lewin . Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis , Massachusetts Institute of Technology , 1998 . Daniel M. Lewin. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, Massachusetts Institute of Technology, 1998.",{},{"id":26,"text":2901,"url":26,"identifiers":2902},"10.5555\u002F1076315",{"doi":2901},{"id":26,"text":2904,"url":26,"identifiers":2905},"10.1145\u002F1842733.1842736",{"doi":2904},{"id":26,"text":2907,"url":26,"identifiers":2908},"Diego Ongaro and John Ousterhout . In search of an understandable consensus algorithm . In Proceedings of the USENIX Annual Technical Conference , pages 305 -- 320 , 2014 . Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the USENIX Annual Technical Conference, pages 305--320, 2014.",{},{"id":26,"text":2910,"url":26,"identifiers":2911},"H. Rahul , M. Kasbekar , R. Sitaraman , and A. Berger . Towards realizing the performance and availability benefits of a global overlay network . In Proceedings of the Passive and Active Measurement Conference , 2006 . H. Rahul, M. Kasbekar, R. Sitaraman, and A. Berger. Towards realizing the performance and availability benefits of a global overlay network. In Proceedings of the Passive and Active Measurement Conference, 2006.",{},{"id":26,"text":2913,"url":26,"identifiers":2914},"Alvin E. Roth and Elliott Peranson. The redesign of the matching market for American physicians: Some engineering aspects of economic design. Technical report , National Bureau of Economic Research , 1999 . Alvin E. Roth and Elliott Peranson. The redesign of the matching market for American physicians: Some engineering aspects of economic design. Technical report, National Bureau of Economic Research, 1999.",{},{"id":26,"text":2916,"url":26,"identifiers":2917},"10.1162\u002F0033553041382157",{"doi":2916},{"id":26,"text":2919,"url":26,"identifiers":2920},"10.1016\u002FS0169-7552(98)00251-7",{"doi":2919},{"id":26,"text":2922,"url":26,"identifiers":2923},"Ramesh K. Sitaraman , Mangesh Kasbekar , Woody Lichtenstein , and Manish Jain . Overlay networks: An Akamai perspective . In Pathan, Sitaraman, and Robinson, editors, Advanced Content Delivery, Streaming, and Cloud Services . John Wiley & Sons , 2014 . Ramesh K. Sitaraman, Mangesh Kasbekar, Woody Lichtenstein, and Manish Jain. Overlay networks: An Akamai perspective. In Pathan, Sitaraman, and Robinson, editors, Advanced Content Delivery, Streaming, and Cloud Services. John Wiley & Sons, 2014.",{},{"id":26,"text":2925,"url":26,"identifiers":2926},"Donald E. Stokes . Pasteur's Quadrant: Basic Science and Technological Innovation . Brookings Institution Press , 1997 . Donald E. Stokes. Pasteur's Quadrant: Basic Science and Technological Innovation. Brookings Institution Press, 1997.",{}]