Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00100
Makoto Nakagami, J. Kon, Gil Jae Lee, J. Fortes, Saneyasu Yamaguchi
Hadoop is a popular platform based on the MapReduce model for processing big data. For I/O performance improvement in Hadoop, this paper uses realistic workloads to conduct in-depth evaluations of a method that optimally places file in storage. This method places files in the outer zones of hard disk drives because sequential access in the outer zones is generally faster than in the inner zones. The research reported in this paper goes beyond using an I/O-intensive job example (e.g., TeraSort) to use realistic workloads generated by Statistical Workload Injector for MapReduce (SWIM). First, the CPU and I/O resource usage by SWIM jobs is explored in various settings and then it is shown that a shuffle-heavy workload is I/O bounded. Second, I/O patterns of some SWIM jobs are investigated and it is shown that their accesses are performed sequentially. Third, the proposed method is applied to a shuffle-heavy SWIM job and evaluated, the results demonstrating that the method can improve performance by 14%.
{"title":"File Placing Location Optimization on Hadoop SWIM","authors":"Makoto Nakagami, J. Kon, Gil Jae Lee, J. Fortes, Saneyasu Yamaguchi","doi":"10.1109/CANDARW.2018.00100","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00100","url":null,"abstract":"Hadoop is a popular platform based on the MapReduce model for processing big data. For I/O performance improvement in Hadoop, this paper uses realistic workloads to conduct in-depth evaluations of a method that optimally places file in storage. This method places files in the outer zones of hard disk drives because sequential access in the outer zones is generally faster than in the inner zones. The research reported in this paper goes beyond using an I/O-intensive job example (e.g., TeraSort) to use realistic workloads generated by Statistical Workload Injector for MapReduce (SWIM). First, the CPU and I/O resource usage by SWIM jobs is explored in various settings and then it is shown that a shuffle-heavy workload is I/O bounded. Second, I/O patterns of some SWIM jobs are investigated and it is shown that their accesses are performed sequentially. Third, the proposed method is applied to a shuffle-heavy SWIM job and evaluated, the results demonstrating that the method can improve performance by 14%.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130393780","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00068
Mahdillah Mahdillah, Shinya Nakayama, Qian Zhao, Takaichi Yoshida
The execution environment of a real-world distributed system can change dramatically in terms of CPU workload, memory utilization, network traffic, etc. Therefore, an object-oriented distributed environment called Juice was developed in our previous research. Applications developed with Juice have the capability of reconfiguring itself during runtime in order to adapt changes of the execution environment. In this work, we propose a base level adaptable scheduling for the execution of self-reconfigurable objects in Juice. The adaptable scheduler can dynamically change the scheduling policy to meet the user's performance target when the execution environment changed. Evaluation results show that in a low CPU workload environment, FCFS (First Come First Serve) policy has a similar performance with SJF (Shortest Job First) policy and LJF (Longest Job First) policy with lower scheduling overhead. However, when the CPU workload becomes heavy, SJF or LJF has a better response time depending on the ratio of long jobs and the number of worker threads of Juice.
{"title":"An Adaptable Scheduling for Self-Reconfigurable Objects","authors":"Mahdillah Mahdillah, Shinya Nakayama, Qian Zhao, Takaichi Yoshida","doi":"10.1109/CANDARW.2018.00068","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00068","url":null,"abstract":"The execution environment of a real-world distributed system can change dramatically in terms of CPU workload, memory utilization, network traffic, etc. Therefore, an object-oriented distributed environment called Juice was developed in our previous research. Applications developed with Juice have the capability of reconfiguring itself during runtime in order to adapt changes of the execution environment. In this work, we propose a base level adaptable scheduling for the execution of self-reconfigurable objects in Juice. The adaptable scheduler can dynamically change the scheduling policy to meet the user's performance target when the execution environment changed. Evaluation results show that in a low CPU workload environment, FCFS (First Come First Serve) policy has a similar performance with SJF (Shortest Job First) policy and LJF (Longest Job First) policy with lower scheduling overhead. However, when the CPU workload becomes heavy, SJF or LJF has a better response time depending on the ratio of long jobs and the number of worker threads of Juice.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122003720","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00013
Luidnel Maignan, Jean-Baptiste Yunès
Maignan and Yunes have already investigated solutions to the generalized firing squad synchronization problem for square tilings with both Moore and Von Neumann neighborhoods, and then shown that the same concepts could be used to handle hexagonal tilings. The communication grids for these cellular space are all very regular in a precise formal sense: they are Cayley graphs. In this paper we investigate the triangular tiling because it is very related to the hexagonal one but is not a Cayley graph. We also consider another tiling of triangles obtained by dividing every square of a square tiling into four triangles. We show that the same concepts still apply, therefore showing that the previous solutions can be extended to a broader class of spaces included in what we may call Cayley Graphs on Groupoïd.
{"title":"Generalized FSSP on Two Triangular Tilings","authors":"Luidnel Maignan, Jean-Baptiste Yunès","doi":"10.1109/CANDARW.2018.00013","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00013","url":null,"abstract":"Maignan and Yunes have already investigated solutions to the generalized firing squad synchronization problem for square tilings with both Moore and Von Neumann neighborhoods, and then shown that the same concepts could be used to handle hexagonal tilings. The communication grids for these cellular space are all very regular in a precise formal sense: they are Cayley graphs. In this paper we investigate the triangular tiling because it is very related to the hexagonal one but is not a Cayley graph. We also consider another tiling of triangles obtained by dividing every square of a square tiling into four triangles. We show that the same concepts still apply, therefore showing that the previous solutions can be extended to a broader class of spaces included in what we may call Cayley Graphs on Groupoïd.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128264306","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00107
C. Chao, Wei-Che Lee, Cong Wang, Shin-Chung Huang, Yu-Chich Yang
In cognitive radio networks (CRNs), secondary users (SUs) are vulnerable to malicious attacks because an SU node's opportunistic access cannot be protected from adversaries. How to design a channel hopping scheme to protect SU nodes from jamming attacks is thus an important issue in CRNs. Existing anti-jamming channel hopping schemes have some limitations: Some require SU nodes to exchange secrets in advance; some require an SU node to be either a receiver or a sender, and some are not flexible enough. Another issue for existing anti-jamming channel hopping schemes is that they do not consider different nodes may have different traffic loads. In this paper, we propose an anti-jamming channel hopping protocol, Load Awareness Anti-jamming channel hopping (LAA) scheme. Nodes running LAA are able to change their channel hopping sequences based on their sending and receiving traffic. Simulation results verify that LAA outperforms existing anti-jamming schemes.
{"title":"A Flexible Anti-Jamming Channel Hopping for Cognitive Radio Networks","authors":"C. Chao, Wei-Che Lee, Cong Wang, Shin-Chung Huang, Yu-Chich Yang","doi":"10.1109/CANDARW.2018.00107","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00107","url":null,"abstract":"In cognitive radio networks (CRNs), secondary users (SUs) are vulnerable to malicious attacks because an SU node's opportunistic access cannot be protected from adversaries. How to design a channel hopping scheme to protect SU nodes from jamming attacks is thus an important issue in CRNs. Existing anti-jamming channel hopping schemes have some limitations: Some require SU nodes to exchange secrets in advance; some require an SU node to be either a receiver or a sender, and some are not flexible enough. Another issue for existing anti-jamming channel hopping schemes is that they do not consider different nodes may have different traffic loads. In this paper, we propose an anti-jamming channel hopping protocol, Load Awareness Anti-jamming channel hopping (LAA) scheme. Nodes running LAA are able to change their channel hopping sequences based on their sending and receiving traffic. Simulation results verify that LAA outperforms existing anti-jamming schemes.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125970226","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00072
Hideki Shimura, Hiroyuki Noda, H. Amano
PCI Express (PCIe) has been widely used as an I/O bus connecting CPU and GPUs. In order to resolve the limitation of the number of PCIe ports, NEC Corporation developed ExpEther for expanding PCIe to Ethernet. Since Ethernet often becomes a bottleneck of communication, a conventional research proposed to implement a compression/decompression mechanism by using existing data compression mechanisms to reduce the size of data transferring on Ethernet. However, data compression mechanisms used in the research were only efficient for a limited input data pattern. In this paper, we proposed a novel data compression algorithm called C4, and implemented it on Xilinx Virtex-7 FPGA as an experimental environment of ExpEther. As a result, the proposed method can reduce the transfer time by 52.5%, superior to 49.7% with the conventional method. According to the evaluation of the hardware resource utilization rate, we showed that the proposed algorithm can be implemented in the FPGA used in the ExpEther NIC.
{"title":"C4: An FPGA-based Compression Algorithm for ExpEther","authors":"Hideki Shimura, Hiroyuki Noda, H. Amano","doi":"10.1109/CANDARW.2018.00072","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00072","url":null,"abstract":"PCI Express (PCIe) has been widely used as an I/O bus connecting CPU and GPUs. In order to resolve the limitation of the number of PCIe ports, NEC Corporation developed ExpEther for expanding PCIe to Ethernet. Since Ethernet often becomes a bottleneck of communication, a conventional research proposed to implement a compression/decompression mechanism by using existing data compression mechanisms to reduce the size of data transferring on Ethernet. However, data compression mechanisms used in the research were only efficient for a limited input data pattern. In this paper, we proposed a novel data compression algorithm called C4, and implemented it on Xilinx Virtex-7 FPGA as an experimental environment of ExpEther. As a result, the proposed method can reduce the transfer time by 52.5%, superior to 49.7% with the conventional method. According to the evaluation of the hardware resource utilization rate, we showed that the proposed algorithm can be implemented in the FPGA used in the ExpEther NIC.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121650846","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00017
Atsushi Takei, S. Kimura
In recent years, the demand for multimedia services that can handle voice and/or videos on mobile terminals has increased. Many handover algorithms have been proposed for switching the connection between different networks while maintaining QoE (Quality of Experience), which is a metric that is a meas-ure of users' satisfaction when using a certain service or ap-plication. The QoE-driven VHO algorithm is one of such al-gorithms using a prediction model of QoE for movies streamed over wireless networks. Since the algorithm may not provide an acceptable level of quality when network perfor-mance temporarily decreases, the authors also proposed an algorithm (hereinafter referred to as the "previous algo-rithm") to improve the problem. However, since these algo-rithms cannot predict QoE of candidate networks before switching, the connection may be switched to a network with much lower QoE. In order to solve the problem, this paper proposes a new handover algorithm for video communications by sharing communication quality information of access points between terminals. In this algorithm, each mobile ter-minal creates a list specifying the communication quality of the connected access point and shares it with other terminals. The simulation results show that terminals in the proposed method can connect to the access points with better QoE for longer durations than the QoE-driven VHO algorithm and the previous algorithm.
{"title":"Handover Algorithm for Video Communications by Sharing Communication Quality Information of Access Points between Terminals","authors":"Atsushi Takei, S. Kimura","doi":"10.1109/CANDARW.2018.00017","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00017","url":null,"abstract":"In recent years, the demand for multimedia services that can handle voice and/or videos on mobile terminals has increased. Many handover algorithms have been proposed for switching the connection between different networks while maintaining QoE (Quality of Experience), which is a metric that is a meas-ure of users' satisfaction when using a certain service or ap-plication. The QoE-driven VHO algorithm is one of such al-gorithms using a prediction model of QoE for movies streamed over wireless networks. Since the algorithm may not provide an acceptable level of quality when network perfor-mance temporarily decreases, the authors also proposed an algorithm (hereinafter referred to as the \"previous algo-rithm\") to improve the problem. However, since these algo-rithms cannot predict QoE of candidate networks before switching, the connection may be switched to a network with much lower QoE. In order to solve the problem, this paper proposes a new handover algorithm for video communications by sharing communication quality information of access points between terminals. In this algorithm, each mobile ter-minal creates a list specifying the communication quality of the connected access point and shares it with other terminals. The simulation results show that terminals in the proposed method can connect to the access points with better QoE for longer durations than the QoE-driven VHO algorithm and the previous algorithm.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127366423","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00071
Daiki Ojima, M. Uehara, T. Mihara
Delivering packages door-to-door is convenient because of its accuracy and speed. Recently, such delivery services have become widely used for online shopping. However, package delivery may sometimes fail to be completed in the specified time window because of the large number of packages. Therefore, it is important to optimize the delivery distance. This distance depends on the location of customers and whether they are absent. In this paper, we examine several cases of loading packages by considering redelivery, and evaluate delivery distance using the branch and bound method and the genetic algorithm. From the results, we conclude that the delivery distance depends on the probability of redelivery, and that the optimum order for visiting customers depends on their locations.
{"title":"Optimization of Delivery Considering Redelivery and Loading Methods","authors":"Daiki Ojima, M. Uehara, T. Mihara","doi":"10.1109/CANDARW.2018.00071","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00071","url":null,"abstract":"Delivering packages door-to-door is convenient because of its accuracy and speed. Recently, such delivery services have become widely used for online shopping. However, package delivery may sometimes fail to be completed in the specified time window because of the large number of packages. Therefore, it is important to optimize the delivery distance. This distance depends on the location of customers and whether they are absent. In this paper, we examine several cases of loading packages by considering redelivery, and evaluate delivery distance using the branch and bound method and the genetic algorithm. From the results, we conclude that the delivery distance depends on the probability of redelivery, and that the optimum order for visiting customers depends on their locations.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133184908","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00034
Tomoaki Ukezono
To reduce power consumption, approximate computing is an efficient approach for error-tolerant applications such as image processing. Approximate arithmetic adders can be used for the approximate computing, and can trade off accuracy for power. CMA, a dynamically accuracy-configurable approximate adder, had been proposed. CMA can sharply reduce power consumption compared with other accuracy-configurable approximate adders, while allowing it to change accuracy-setting at run-time. In this paper, we propose a tiny error corrector for CMA that needs to only two gates for each digit. By consuming 1.4% extra power, the proposed value corrector can improve accuracy for CMA by up to 29.3% on average.
{"title":"An Error Corrector for Dynamically Accuracy-Configurable Approximate Adder","authors":"Tomoaki Ukezono","doi":"10.1109/CANDARW.2018.00034","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00034","url":null,"abstract":"To reduce power consumption, approximate computing is an efficient approach for error-tolerant applications such as image processing. Approximate arithmetic adders can be used for the approximate computing, and can trade off accuracy for power. CMA, a dynamically accuracy-configurable approximate adder, had been proposed. CMA can sharply reduce power consumption compared with other accuracy-configurable approximate adders, while allowing it to change accuracy-setting at run-time. In this paper, we propose a tiny error corrector for CMA that needs to only two gates for each digit. By consuming 1.4% extra power, the proposed value corrector can improve accuracy for CMA by up to 29.3% on average.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131568605","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}
Moving Target Defense (MTD) concept has been a feasible idea for reducing the possibility of attack happening through alternation attack surfaces or diversification the attribute or parameters of a protected system. As a result of applying MTD techniques to the system, an attacker would have more difficulties in exploiting a vulnerabilities of the target system. This study proposes an evaluation method of MTD systems combined with several different MTD techniques. The proposed method is a primary step in designing an evaluation model for the effectiveness of MTD. The main goal is to estimate the attack success ratio on the MTD systems mitigating from threats of executable binary file or malware injection. With the proposed evaluation method, we expect to prove that the MTD technology can enhance the security of a web server, and can be applied in a real-world information system. As our preliminary work done, we set up a prototype framework to validate the proposed work in a pseudo-experimental environment.
{"title":"A New Design for Evaluating Moving Target Defense System","authors":"Wai Kyi Kyi Oo, Hiroshi Koide, Danilo Vasconcellos Vargas, K. Sakurai","doi":"10.1109/CANDARW.2018.00111","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00111","url":null,"abstract":"Moving Target Defense (MTD) concept has been a feasible idea for reducing the possibility of attack happening through alternation attack surfaces or diversification the attribute or parameters of a protected system. As a result of applying MTD techniques to the system, an attacker would have more difficulties in exploiting a vulnerabilities of the target system. This study proposes an evaluation method of MTD systems combined with several different MTD techniques. The proposed method is a primary step in designing an evaluation model for the effectiveness of MTD. The main goal is to estimate the attack success ratio on the MTD systems mitigating from threats of executable binary file or malware injection. With the proposed evaluation method, we expect to prove that the MTD technology can enhance the security of a web server, and can be applied in a real-world information system. As our preliminary work done, we set up a prototype framework to validate the proposed work in a pseudo-experimental environment.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667186","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00074
Weibin Wang, M. Uehara, H. Ozaki
Traffic jams are a serious issue in urban life. Conventional car navigation systems are based on user equilibrium (UE) traffic assignment, in which a driver always chooses the best route. System optimal (SO) traffic assignment is better than UE traffic assignment. However, it is difficult to realize SO because of a lack of complete traffic information. In the near future, almost all cars will be connected to the cloud. This means that complete traffic information can be collected by connected cars. In this paper, we describe an SO-based navigation method. In our method, the cloud detects SO traffic assignment using collected traffic information. We also evaluate the proposed method for several cases.
{"title":"System Optimum Traffic Assignment for Connected Cars","authors":"Weibin Wang, M. Uehara, H. Ozaki","doi":"10.1109/CANDARW.2018.00074","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00074","url":null,"abstract":"Traffic jams are a serious issue in urban life. Conventional car navigation systems are based on user equilibrium (UE) traffic assignment, in which a driver always chooses the best route. System optimal (SO) traffic assignment is better than UE traffic assignment. However, it is difficult to realize SO because of a lack of complete traffic information. In the near future, almost all cars will be connected to the cloud. This means that complete traffic information can be collected by connected cars. In this paper, we describe an SO-based navigation method. In our method, the cloud detects SO traffic assignment using collected traffic information. We also evaluate the proposed method for several cases.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667739","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
扫码关注我们
求助内容：
应助结果提醒方式：