{"created":"2024-04-23T05:08:58.545569+00:00","id":2000150,"links":{},"metadata":{"_buckets":{"deposit":"07794766-861b-478d-930f-372b1a47b26d"},"_deposit":{"created_by":34,"id":"2000150","owner":"34","owners":[34],"pid":{"revision_id":0,"type":"depid","value":"2000150"},"status":"published"},"_oai":{"id":"oai:repo.lib.tut.ac.jp:02000150","sets":["9"]},"author_link":[],"control_number":"2000150","item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2024-04-04"},"bibliographicPageEnd":"5","bibliographicPageStart":"1","bibliographic_titles":[{"bibliographic_title":"IEEE Networking Letters","bibliographic_titleLang":"en"}]}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"This letter proposes a delay-sensitive network design scheme, DSND, for multi-service slice networks. DSND contributes to a virtual processing system where users can share the same application space regardless of distance-related delays. DSND introduces the service slice and service virtual time concepts. A service slice is a virtual network comprising user and server nodes. A service virtual time is a time for eliminating the difference in delay caused by distance, and the user’s events are reordered in occurrence order. The difference between the current time and the service virtual time is the end-to-end delay shared by all users within the same service slice. We formulate DSND as an integer linear programming problem and compare the delays between DSND to a benchmark scheme where each user selects the closest server. Numerical results indicate that DSND can reduce the delay by 4–38 ercent compared to the benchmark scheme.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10001_description_6":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Date of Publication: 04 April 2024","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_10001_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEEE","subitem_publisher_language":"en"}]},"item_10001_relation_14":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"10.1109/LNET.2024.3385008","subitem_relation_type_select":"DOI"}}]},"item_10001_relation_17":{"attribute_name":"関連サイト","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"IEEExplore"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://ieeexplore.ieee.org/document/10492455","subitem_relation_type_select":"URI"}}]},"item_10001_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"“© 2024 IEEE.  Personal use of this material is permitted.  Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”","subitem_rights_language":"en"}]},"item_10001_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2576-3156","subitem_source_identifier_type":"ISSN"}]},"item_10001_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"川端,明生","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"Bijoy, Chand Chatterjee","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"大木,英司","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"Kawabata,Akio","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Oki,Eiji","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2024-04-23"}],"displaytype":"detail","filename":"i25763156-xxxx-001.pdf","filesize":[{"value":"1.7 MB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"url":"https://repo.lib.tut.ac.jp/record/2000150/files/i25763156-xxxx-001.pdf"},"version_id":"2aa957e8-1d12-49a3-a1c9-ced5cfbc91b9"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Distributed processing","subitem_subject_language":"en"},{"subitem_subject":"network delay","subitem_subject_language":"en"},{"subitem_subject":"conservative synchronous algorithm","subitem_subject_language":"en"},{"subitem_subject":"service slice","subitem_subject_language":"en"},{"subitem_subject":"network design","subitem_subject_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"34","path":["9"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-04-23"},"publish_date":"2024-04-23","publish_status":"0","recid":"2000150","relation_version_is_last":true,"title":["DSND: Delay-Sensitive Network Design Scheme for Multi-Service Slice Networks"],"weko_creator_id":"34","weko_shared_id":-1},"updated":"2024-04-23T06:00:25.184922+00:00"}