{"created":"2022-01-28T04:21:18.549510+00:00","id":2007398,"links":{},"metadata":{"_buckets":{"deposit":"be5068f1-e11d-4602-8a83-97c57e587ead"},"_deposit":{"id":"2007398","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2007398"},"status":"published"},"_oai":{"id":"oai:u-ryukyu.repo.nii.ac.jp:02007398","sets":["1642837622505:1642837722116:1642837725634","1642838403551:1642838406845"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"ループ電子計算機網のトラヒック特性に関する一考察","subitem_1551255648112":"ja"},{"subitem_1551255647225":"A Consideration of Traffic Characteristics in a Loop Computer Network","subitem_1551255648112":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"照屋, 健","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"Teruya, Ken","creatorNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_1522299639480":"open access","subitem_1600958577026":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"This paper reports the analysis of traffic characteristics of a loop computer network. The analysis is based on the assumption that: (1) a packet is transmitted to the unilateral direction; (2) in each station, waiting of messages in the form of packet in the queue is under full-load condition; (3) the packet has a constant length of M. In such a model of loop system, the flow condition of packet becomes jammed traffic and there would be no vacant slot on the main transmission line, therefore, chance to transmit a packet, for a particular station, comes only when the station\\nreceives a packet from the other station. Let pij (i≠j) be the proportion of flow (packet) emerging from station i and destined for station j. We define as symmetric case when pij is uniform regardless of the station, and as asymmetric case when pjj is not. In the symmetric case, if we regard the probability that (N-1)th type of packet exists on the slots between stations, after a transition of main line slot, as state vector, the state vector at one slot unit time is described by Markov chain. N denotes the number of data stations which are arranged around the loop-shaped main transmission line. The steady state vector is obtained by using the transition matrix. The information transmission factor of steady state is calculated by applying the steady state vector. As to the factor,  the symmetric case system assures the minimum value of 1/(N-1). The same technique of analysis as the symmetric case, being applied for the asymmetric case analysis, shows that the some sort of control is necessary in order to give fare chance of balanced usage of the main line slots for the stations arranged. The transient traffic characteristics of the symmetric case are analyzed for minor stations. The analysis shows that about twelve steps of transition are enough to be steady for the information transmission factor.","subitem_description_type":"Other"},{"subitem_description":"紀要論文","subitem_description_type":"Other"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_1522300295150":"ja","subitem_1522300316516":"琉球大学理工学部"},{"subitem_1522300295150":"en","subitem_1522300316516":"Science and Engineering Division, University of the Ryukyus"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_1551255818386":"jpn"}]},"item_1617186783814":{"attribute_name":"Identifier","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/20.500.12000/26295"}]},"item_1617186920753":{"attribute_name":"Source Identifier","attribute_value_mlt":[{"subitem_1522646500366":"ISSN","subitem_1522646572813":"0387-429X"},{"subitem_1522646500366":"NCID","subitem_1522646572813":"AN00250785"}]},"item_1617186941041":{"attribute_name":"Source Title","attribute_value_mlt":[{"subitem_1522650068558":"ja","subitem_1522650091861":"琉球大学理工学部紀要. 工学篇"},{"subitem_1522650068558":"en","subitem_1522650091861":"Bulletin of Science & Engineering Division, University of the Ryukyus. Engineering"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1975-01-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicPageEnd":"124","bibliographicPageStart":"113"}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_1522305645492":"VoR","subitem_1600292170262":"http://purl.org/coar/version/c_970fb48d4fbd8a85"}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","filename":"NO8P113.pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://u-ryukyu.repo.nii.ac.jp/record/2007398/files/NO8P113.pdf"},"version_id":"f2efe9c8-3d6a-4dd5-b6af-ff91bb1e9e9b"}]},"item_title":"ループ電子計算機網のトラヒック特性に関する一考察","item_type_id":"15","owner":"1","path":["1642837725634","1642838406845"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2013-06-10"},"publish_date":"2013-06-10","publish_status":"0","recid":"2007398","relation_version_is_last":true,"title":["ループ電子計算機網のトラヒック特性に関する一考察"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-10-31T03:20:15.296385+00:00"}