Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010053
Noriki Uchida, Tomoki Okutake, Noriyasu Yamamoto
With the recent growth of the Drone's market, the first person view (FPV) by drones are spreading in various usages such as the promotions or TV programs. However, it is considered that the drone's accidents are getting serious problems because of the failures of the operations or malfunctions. Therefore, this paper proposes the collaborative security control systems by multiple drones for the FPV systems, and the image recognition methods of the prototype system are presented. Then, the prototype system used in the open campus events, and the reports of the field usages are discussed for the future studies.
{"title":"Image recognitions of collaborative drones' security controls for FPV systems","authors":"Noriki Uchida, Tomoki Okutake, Noriyasu Yamamoto","doi":"10.1504/IJSSC.2017.10010053","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010053","url":null,"abstract":"With the recent growth of the Drone's market, the first person view (FPV) by drones are spreading in various usages such as the promotions or TV programs. However, it is considered that the drone's accidents are getting serious problems because of the failures of the operations or malfunctions. Therefore, this paper proposes the collaborative security control systems by multiple drones for the FPV systems, and the image recognition methods of the prototype system are presented. Then, the prototype system used in the open campus events, and the reports of the field usages are discussed for the future studies.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"73 1","pages":"129-135"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80467216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010827
Masashi Tomimori, S. Sugawara
Recently, various content sharing methods that are available on peer-to-peer (P2P) networks, have been actively researched; a P2P network generally consists of a number of peers and evenly connected to each other. In most of previous studies, shared content items are supposed to be kept only in the storages of the peers, and effective ways of content sharing under the environment where not only the storages of peers, but also ones of a cloud system are available have not sufficiently researched yet. In this paper, we propose an efficient content sharing method in which an appropriate content acquisition rate can be set preliminarily according to the payable storage cost, and actually the rate can be maintained by keeping sufficient number of content replicas under the environment where storages of both peers and a cloud system are available.
{"title":"Content sharing method using expected acquisition rate in hybrid peer-to-peer networks with cloud storages","authors":"Masashi Tomimori, S. Sugawara","doi":"10.1504/IJSSC.2017.10010827","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010827","url":null,"abstract":"Recently, various content sharing methods that are available on peer-to-peer (P2P) networks, have been actively researched; a P2P network generally consists of a number of peers and evenly connected to each other. In most of previous studies, shared content items are supposed to be kept only in the storages of the peers, and effective ways of content sharing under the environment where not only the storages of peers, but also ones of a cloud system are available have not sufficiently researched yet. In this paper, we propose an efficient content sharing method in which an appropriate content acquisition rate can be set preliminarily according to the payable storage cost, and actually the rate can be maintained by keeping sufficient number of content replicas under the environment where storages of both peers and a cloud system are available.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"17 1","pages":"187-196"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78898595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010059
Kevin Bylykbashi, Evjola Spaho, L. Barolli, F. Xhafa
In this work, we evaluate the performance of different routing protocols in vehicular delay tolerant networks (VDTNs). We study the impact of vehicles density and TTL on the network performance. The simulations are conducted with the opportunistic network environment (ONE) simulator. The performance is analysed using delivery probability, overhead ratio, average latency and average number of hops metrics. The simulation results show that the increase of node density improves the network performance. In dense network scenario, the performance of epidemic and maxprop routing protocols is better because the number of opportunistic contacts between nodes increases. For spray and wait, the performance is not improved since it uses a maximum of two hops to deliver bundles. Hence, in dense networks, a bundle may have a significant delay because it can only be delivered when a relay or source node have an opportunistic contact with the destination. The increase of ttl from 30 to 120 min does not improve the performance of three routing protocols in both scenarios. Multiple-copy protocols perform better in terms of delivery probability compared with single-copy protocol. The single-copy protocol uses the highest average number of hops and higher average latency compared with multiple-copy protocols.
{"title":"Impact of node density and TTL in vehicular delay tolerant networks: performance comparison of different routing protocols","authors":"Kevin Bylykbashi, Evjola Spaho, L. Barolli, F. Xhafa","doi":"10.1504/IJSSC.2017.10010059","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010059","url":null,"abstract":"In this work, we evaluate the performance of different routing protocols in vehicular delay tolerant networks (VDTNs). We study the impact of vehicles density and TTL on the network performance. The simulations are conducted with the opportunistic network environment (ONE) simulator. The performance is analysed using delivery probability, overhead ratio, average latency and average number of hops metrics. The simulation results show that the increase of node density improves the network performance. In dense network scenario, the performance of epidemic and maxprop routing protocols is better because the number of opportunistic contacts between nodes increases. For spray and wait, the performance is not improved since it uses a maximum of two hops to deliver bundles. Hence, in dense networks, a bundle may have a significant delay because it can only be delivered when a relay or source node have an opportunistic contact with the destination. The increase of ttl from 30 to 120 min does not improve the performance of three routing protocols in both scenarios. Multiple-copy protocols perform better in terms of delivery probability compared with single-copy protocol. The single-copy protocol uses the highest average number of hops and higher average latency compared with multiple-copy protocols.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"97 1","pages":"136-144"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85678171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010063
Satoru Miura, Hiroaki Nishino
Colour scheme design is an important process when designing artwork such as illustrations and graphics. Appropriate colouring maximises the functional and emotional effects of the work. However, there is no unique solution for properly designing the layout of multiple colours. A designer must have enough skills and experiences for accurately presenting his/her targeting impressive quality of the work. This paper proposes a method for automatically creating and presenting a set of candidate colour layouts by adjusting a few carefully selected colour parameters with harmony. It enables designers to readily explore various colour scheme candidates while considering colour harmony of the work. We implement a colour design support system based on the proposed method and conduct thorough experiments for verifying the effectiveness of the system. We show that the proposed method is useful and practical both for experienced and novice users.
{"title":"A practical colour scheme explorer for designers","authors":"Satoru Miura, Hiroaki Nishino","doi":"10.1504/IJSSC.2017.10010063","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010063","url":null,"abstract":"Colour scheme design is an important process when designing artwork such as illustrations and graphics. Appropriate colouring maximises the functional and emotional effects of the work. However, there is no unique solution for properly designing the layout of multiple colours. A designer must have enough skills and experiences for accurately presenting his/her targeting impressive quality of the work. This paper proposes a method for automatically creating and presenting a set of candidate colour layouts by adjusting a few carefully selected colour parameters with harmony. It enables designers to readily explore various colour scheme candidates while considering colour harmony of the work. We implement a colour design support system based on the proposed method and conduct thorough experiments for verifying the effectiveness of the system. We show that the proposed method is useful and practical both for experienced and novice users.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"32 1","pages":"155-165"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85182759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010828
Ryota Yoichi, S. Sugawara
Various consistency maintenance strategies of content sharing in pure peer-to-peer (P2P) networks have been researched recently. However, the ones applied in hybrid P2P networks have not been investigated enough. In hybrid P2P networks, when an update of a content item happens on a peer, it is necessary to propagate the update to all the peers which have obsolete replicas of the same content item. In this paper, we propose a method which maintains consistency among the replicas of content items in a practical way when a content item is updated. In this method, the peers which have the replicas of frequently accessed content items are previously selected, and when an update occurs, the updating data is propagated to the peers on a priority basis. Furthermore, we discuss the effectiveness of the proposal by using computer simulations.
{"title":"Consistency preservation of replicas based on access frequency for content sharing in hybrid peer-to-peer networks","authors":"Ryota Yoichi, S. Sugawara","doi":"10.1504/IJSSC.2017.10010828","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010828","url":null,"abstract":"Various consistency maintenance strategies of content sharing in pure peer-to-peer (P2P) networks have been researched recently. However, the ones applied in hybrid P2P networks have not been investigated enough. In hybrid P2P networks, when an update of a content item happens on a peer, it is necessary to propagate the update to all the peers which have obsolete replicas of the same content item. In this paper, we propose a method which maintains consistency among the replicas of content items in a practical way when a content item is updated. In this method, the peers which have the replicas of frequently accessed content items are previously selected, and when an update occurs, the updating data is propagated to the peers on a priority basis. Furthermore, we discuss the effectiveness of the proposal by using computer simulations.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"21 1","pages":"197-206"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86480509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010840
Akira Sakuraba, Y. Shibata, Tomoyuki Ishida, K. Hashimoto
In case of large scale disaster, it is very important to collect disaster information and understand them to make decision at counter disaster headquarter (CDH). Existing disaster information gathering and sharing system based on geographic information system (GIS) cannot respond to deal with large scale disaster from the points of the scalability and operability. This paper introduces a new design of disaster state presentation system using large size and ultra definition displaying system in order to collect and share disaster state information to make decision for officers at the CDH. The proposed method displays both GIS based location information and multimedia information in parallel on the same display. These displayed disaster information are interactively controlled using workspace controller to display on tiled display wall (TDW). We designed and implemented our system as a prototype. Through performance evaluation, the effects and future works of our proposed system are discussed.
{"title":"Design and implementation of disaster management GIS system based on ultra high definition display environment","authors":"Akira Sakuraba, Y. Shibata, Tomoyuki Ishida, K. Hashimoto","doi":"10.1504/IJSSC.2017.10010840","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010840","url":null,"abstract":"In case of large scale disaster, it is very important to collect disaster information and understand them to make decision at counter disaster headquarter (CDH). Existing disaster information gathering and sharing system based on geographic information system (GIS) cannot respond to deal with large scale disaster from the points of the scalability and operability. This paper introduces a new design of disaster state presentation system using large size and ultra definition displaying system in order to collect and share disaster state information to make decision for officers at the CDH. The proposed method displays both GIS based location information and multimedia information in parallel on the same display. These displayed disaster information are interactively controlled using workspace controller to display on tiled display wall (TDW). We designed and implemented our system as a prototype. Through performance evaluation, the effects and future works of our proposed system are discussed.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"21 1","pages":"239-251"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87720165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010064
Kosuke Ozera, Shinji Sakamoto, Donald Elmazi, Kevin Bylykbashi, Makoto Ikeda, L. Barolli
A mobile ad hoc network (MANET) is a multi-hop wireless network in which the mobile nodes are dynamic in nature and has a limited bandwidth and minimum battery power. Due to this challenging environment, the mobile nodes can be grouped into clusters to achieve better stability and scalability. Grouping the mobile nodes is called clustering, in which a leader node is elected to manage the entire network. In this paper, first we introduce various approaches for clustering focused on different performance metrics. Then, we show some clustering schemes. Finally, we present and compare two Fuzzy based systems (called F2SMC1 and F2SMC2) for clustering nodes in MANETs. We consider different parameters for clustering such as: number of nodes in a cluster, node spent power, node security and distance of the node from cluster centre. We compare the performance of F2SMC1 and F2SMC2 and show that the F2SMC2 is more complex than F2SMC1, but the F2SMC2 can manage the nodes in the cluster better than F2SMC1. The evaluation results show that by selecting nodes with small distance and high security values, the nodes are closer to cluster centre and more secure, so they will remain in the cluster. In the case when NNC is 0.9, SP is 0.3, SC is 0.9 and DS is 0.1, the proposed F2SMC2 scheme outperforms the F2SMC1 scheme by 15% in terms of number of remained nodes in a cluster.
{"title":"A fuzzy approach for clustering in MANETs: performance evaluation for different parameters","authors":"Kosuke Ozera, Shinji Sakamoto, Donald Elmazi, Kevin Bylykbashi, Makoto Ikeda, L. Barolli","doi":"10.1504/IJSSC.2017.10010064","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010064","url":null,"abstract":"A mobile ad hoc network (MANET) is a multi-hop wireless network in which the mobile nodes are dynamic in nature and has a limited bandwidth and minimum battery power. Due to this challenging environment, the mobile nodes can be grouped into clusters to achieve better stability and scalability. Grouping the mobile nodes is called clustering, in which a leader node is elected to manage the entire network. In this paper, first we introduce various approaches for clustering focused on different performance metrics. Then, we show some clustering schemes. Finally, we present and compare two Fuzzy based systems (called F2SMC1 and F2SMC2) for clustering nodes in MANETs. We consider different parameters for clustering such as: number of nodes in a cluster, node spent power, node security and distance of the node from cluster centre. We compare the performance of F2SMC1 and F2SMC2 and show that the F2SMC2 is more complex than F2SMC1, but the F2SMC2 can manage the nodes in the cluster better than F2SMC1. The evaluation results show that by selecting nodes with small distance and high security values, the nodes are closer to cluster centre and more secure, so they will remain in the cluster. In the case when NNC is 0.9, SP is 0.3, SC is 0.9 and DS is 0.1, the proposed F2SMC2 scheme outperforms the F2SMC1 scheme by 15% in terms of number of remained nodes in a cluster.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"166-176"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90971220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010065
Pragya Kuchhal, S. K. Dhurandher, S. J. Borah, I. Woungang, Satbir Jain, Sahil Gupta
Opportunistic network (oppnet) is one of the challenging fields of wireless network. It is an intermittently connected mobile network where nodes are mobile and no end-to-end path exists. Connectivity among nodes is established when they are within the transmission range of each other. If a node has message to communicate and no intermediate node is available, then the message is stored in the node's buffer till an appropriate communication opportunity arises which is known as store-carry-forward paradigm. This paradigm has given Oppnets a new direction in the field of research. In any network, efficient and effective routing is very crucial. In this paper, a novel routing technique has been proposed for Oppnets named as A* based opportunistic routing (A*OR) which uses the A* searching technique to select the best forwarders towards the destination. The proposed protocol is compared with prophet, PRoWait and EDR as a benchmark protocols and is found to perform 19%, 11% and 32% better than prophet, PRoWait and EDR, respectively in terms of delivery probability.
{"title":"A* search based next hop selection for routing in opportunistic networks","authors":"Pragya Kuchhal, S. K. Dhurandher, S. J. Borah, I. Woungang, Satbir Jain, Sahil Gupta","doi":"10.1504/IJSSC.2017.10010065","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010065","url":null,"abstract":"Opportunistic network (oppnet) is one of the challenging fields of wireless network. It is an intermittently connected mobile network where nodes are mobile and no end-to-end path exists. Connectivity among nodes is established when they are within the transmission range of each other. If a node has message to communicate and no intermediate node is available, then the message is stored in the node's buffer till an appropriate communication opportunity arises which is known as store-carry-forward paradigm. This paradigm has given Oppnets a new direction in the field of research. In any network, efficient and effective routing is very crucial. In this paper, a novel routing technique has been proposed for Oppnets named as A* based opportunistic routing (A*OR) which uses the A* searching technique to select the best forwarders towards the destination. The proposed protocol is compared with prophet, PRoWait and EDR as a benchmark protocols and is found to perform 19%, 11% and 32% better than prophet, PRoWait and EDR, respectively in terms of delivery probability.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"54 1","pages":"177-186"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73907400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-01-01DOI: 10.1504/IJSSC.2017.10010050
Amirah Alomari
Nowadays, videos are extensively used in different aspects of our lives, thus, it is important to measure the quality of services offered by cloud providers. Therefore, we aim to study the impact of distance on the quality of video streaming services based on response time, packet end to end delay, and throughput. This study is conducted using simulation methodology and distance is specified by the propagation delay in public cloud environment. The results show that distance has significant impact on response time and packet end to end variation. However, throughput is not affected by long distances. In addition to that, the impact percentage varies for each kilometre from one application to another, as well for the same application. This study helps cloud providers to offer their services based on targeted consumers geographical locations in order to ensure high quality of service.
{"title":"Distance impact on quality of video streaming services in cloud environments","authors":"Amirah Alomari","doi":"10.1504/IJSSC.2017.10010050","DOIUrl":"https://doi.org/10.1504/IJSSC.2017.10010050","url":null,"abstract":"Nowadays, videos are extensively used in different aspects of our lives, thus, it is important to measure the quality of services offered by cloud providers. Therefore, we aim to study the impact of distance on the quality of video streaming services based on response time, packet end to end delay, and throughput. This study is conducted using simulation methodology and distance is specified by the propagation delay in public cloud environment. The results show that distance has significant impact on response time and packet end to end variation. However, throughput is not affected by long distances. In addition to that, the impact percentage varies for each kilometre from one application to another, as well for the same application. This study helps cloud providers to offer their services based on targeted consumers geographical locations in order to ensure high quality of service.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"49 1","pages":"119-128"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78386157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-11-13DOI: 10.1504/IJSSC.2016.10001161
H. Noguchi, Yasuhiro Ohtaki, M. Kamada
We present an information system designed for a university on the basis of its experiences with the 2011 East Japan earthquake. This system has two levels of security: 1) The website for public relations and the e-mail systems for communications that will work continuously even in the case of commercial power failure. 2) The personal computer systems that will be down during power failure but will restart working without any loss of data as soon as the power supply is back. The former has been implemented by employing a private cloud computing platform and a public one in combination. The latter is implemented by a file storage system that keeps the original copy on-premise in a campus and its backup copy in one of the other campuses. Its operations have shown that the communication traffic among the campuses increased only by half in order to keep the data safe against natural disasters.
{"title":"A university information system made robust against natural disasters by taking advantage of remotely distributed campuses","authors":"H. Noguchi, Yasuhiro Ohtaki, M. Kamada","doi":"10.1504/IJSSC.2016.10001161","DOIUrl":"https://doi.org/10.1504/IJSSC.2016.10001161","url":null,"abstract":"We present an information system designed for a university on the basis of its experiences with the 2011 East Japan earthquake. This system has two levels of security: 1) The website for public relations and the e-mail systems for communications that will work continuously even in the case of commercial power failure. 2) The personal computer systems that will be down during power failure but will restart working without any loss of data as soon as the power supply is back. The former has been implemented by employing a private cloud computing platform and a public one in combination. The latter is implemented by a file storage system that keeps the original copy on-premise in a campus and its backup copy in one of the other campuses. Its operations have shown that the communication traffic among the campuses increased only by half in order to keep the data safe against natural disasters.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"1 1","pages":"147-154"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90549388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：