Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical.
{"title":"Optimal Data Scheduling for P2P VoD Streaming Systems","authors":"Qifeng Yu, Daoxu Chen","doi":"10.1109/ICPADS.2010.55","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.55","url":null,"abstract":"Media streaming services have been much more popular nowadays, and these services consume lots of network bandwidth. Peer-to-Peer(P2P) technology has been employed in the streaming systems to save the server bandwidth consumption and enhance the system scalability. In a P2P streaming system, the quality of the data scheduling scheme will largely affect the server stress that being saved. In this paper, we present our optimal data scheduling scheme to achieve both server stress minimization and fairness among users when the playback continuities of the users are guaranteed. The data scheduling scheme we proposed is based on the maximum network flow problem, and it is proved to be polynomial. Simulations also show that the time consumption for the computation of the optimal scheduling is acceptable, and the result of the scheduling also achieves small node degree bound which makes it practical.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116084056","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}
Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual Computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. This paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study.
{"title":"A Policy-Based Framework for Automated SLA Negotiation for Internet-Based Virtual Computing Environment","authors":"Z. Xiao, Donggang Cao","doi":"10.1109/ICPADS.2010.104","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.104","url":null,"abstract":"Service Level Agreements (SLAs) play an important role in guaranteeing successful collaborations among autonomous entities in Internet-based Virtual Computing Environment (iVCE). However, traditional static and predefined SLAs are not suitable for the open and dynamic iVCE. This paper proposes a policy-based framework for supporting dynamic and automated SLA negotiations between autonomous entities in iVCE. Requirements or constraints on SLA attributes as well as negotiation strategies of negotiating parties are both specified in policy specifications using a simple but expressive policy language that extends the WS-Policy framework. According to these policies, a negotiation agent will be dynamically created for each negotiation party, which is responsible for SLA negotiations on behalf of its owner party. We have implemented a prototype of our framework and demonstrated our approach through a case study.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121407158","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}
there are many approaches proposed to provide anonymous peer-to-peer communications. Data sent via peer-to-peer communications is vulnerable to traffic analysis. Traffic analysis is the process of intercepting and analysing messages in order to compromise information from patterns in communications. An intruder can get information about the content of the data, the requester's and provider's identities. Anonymous approaches are designed with the following three goals: to protect the identity of provider, to protect the identity of requester and to protect the contents of transferred data between them. This article presents a new peer-to-peer approach to achieve anonymity between a requester and a provider in a hybrid peer-to-peer information-sharing environment with trusted servers called supper node so that the provider will not be able to identify the requester and no other peers can identify the two communicating parties with certainty. This article shows that the proposed approaches improved reliability and has more security. This approach, based on onion routing and randomization, protects transferring data against traffic analysis attack. The ultimate goal of this anonymous communications approach is to allow a requester to communicate with a provider in such a manner that nobody can determine the requester’s identity and the content of transferred data.
{"title":"Dual-Path Peer-to-Peer Anonymous Approach","authors":"Ehsan Saboori, M. Abbaspour","doi":"10.1109/ICPADS.2010.111","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.111","url":null,"abstract":"there are many approaches proposed to provide anonymous peer-to-peer communications. Data sent via peer-to-peer communications is vulnerable to traffic analysis. Traffic analysis is the process of intercepting and analysing messages in order to compromise information from patterns in communications. An intruder can get information about the content of the data, the requester's and provider's identities. Anonymous approaches are designed with the following three goals: to protect the identity of provider, to protect the identity of requester and to protect the contents of transferred data between them. This article presents a new peer-to-peer approach to achieve anonymity between a requester and a provider in a hybrid peer-to-peer information-sharing environment with trusted servers called supper node so that the provider will not be able to identify the requester and no other peers can identify the two communicating parties with certainty. This article shows that the proposed approaches improved reliability and has more security. This approach, based on onion routing and randomization, protects transferring data against traffic analysis attack. The ultimate goal of this anonymous communications approach is to allow a requester to communicate with a provider in such a manner that nobody can determine the requester’s identity and the content of transferred data.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128483958","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}
Liang Zhong, Junbin Kang, Chunming Hu, Tianyu Wo, Haibing Zheng, B. Li
In recent years, the Software as a Service, largely enabled by the Internet, has become an innovative software delivery model. During the streaming execution of virtualization software, the execution will wait until the missing data was downloaded, which greatly influences the user experience. In this paper, we present a block-level prefetching framework for streaming delivery of software based on N-Gram prediction model and an incremental data mining algorithm. The prefetching framework uses the historical block access logs for data mining, then dynamically updates and polishes the prefetching rules. The experimental results show that this prefetching framework achieves a launch time reduced by 10% to 50%, as well as hit rate between 81% and 97%.
{"title":"A Prefetching Framework for the Streaming Loading of Virtual Software","authors":"Liang Zhong, Junbin Kang, Chunming Hu, Tianyu Wo, Haibing Zheng, B. Li","doi":"10.1109/ICPADS.2010.25","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.25","url":null,"abstract":"In recent years, the Software as a Service, largely enabled by the Internet, has become an innovative software delivery model. During the streaming execution of virtualization software, the execution will wait until the missing data was downloaded, which greatly influences the user experience. In this paper, we present a block-level prefetching framework for streaming delivery of software based on N-Gram prediction model and an incremental data mining algorithm. The prefetching framework uses the historical block access logs for data mining, then dynamically updates and polishes the prefetching rules. The experimental results show that this prefetching framework achieves a launch time reduced by 10% to 50%, as well as hit rate between 81% and 97%.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124772764","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}
In this paper we develop a SCADA key management system to provide better security, performance, and scalability. Conventional symmetric key based approaches have several problems. We adopt public key based approaches due to its flexibility in authentication and access control and efficiency in rekeying. However, existing public key based approaches are not scalable. Simple replication of CAs (certificate authorities) raises security concerns. We consider several novel designs to bridge the gaps in existing approaches. First, a master key based semi-autonomous key refreshing scheme has been developed to shift the rekeying burdens from CAs to individual SCADA node. Then, we design a CA-grid approach, which combines the threshold scheme and replication of CAs to achieve better protection of the master keys, improved availability, and enhanced performance by load sharing. Analyses show that our scheme has many advantages than the existing SCADA key management systems.
{"title":"Scalable Authentication and Key Management in SCADA","authors":"Liangliang Xiao, I. Yen, F. Bastani","doi":"10.1109/ICPADS.2010.66","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.66","url":null,"abstract":"In this paper we develop a SCADA key management system to provide better security, performance, and scalability. Conventional symmetric key based approaches have several problems. We adopt public key based approaches due to its flexibility in authentication and access control and efficiency in rekeying. However, existing public key based approaches are not scalable. Simple replication of CAs (certificate authorities) raises security concerns. We consider several novel designs to bridge the gaps in existing approaches. First, a master key based semi-autonomous key refreshing scheme has been developed to shift the rekeying burdens from CAs to individual SCADA node. Then, we design a CA-grid approach, which combines the threshold scheme and replication of CAs to achieve better protection of the master keys, improved availability, and enhanced performance by load sharing. Analyses show that our scheme has many advantages than the existing SCADA key management systems.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125053191","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}
Wireless Audio Sensor Networks (WASNs) can provide event detection, object tracking and emergency response through cooperative audio sensor nodes. Effective collaboration of audio sensors requires precise synchronization among audio streams. Some researches have been done on the timestamp mechanism based on time synchronization ignoring propagation delay and many other researches have focused on the synchronization of simple gunshot or scream. However, for the synchronization of intermittent and fluctuating audio stream, there still exists many challenges. In this paper, we propose an effective audio synchronization scheme which can synchronize the intermittent audio streams adaptively while maintain low energy cost. On one hand, we obtain audio synchronization without global clock which save energy tremendously. On the other hand, by introducing a feedback loop mechanism, we can keep a high audio synchronization fidelity even when the audio source moves around and the sound strength varies with time. Furthermore, we discuss the extension for flexibility and scalability of this scheme when there exist several sound sources simultaneously or the audio source moves among clusters. Through experiments on a WASNs platform and simulations, we show that the proposed scheme is desirable to guarantee the accuracy of audio synchronization in practical environment with low energy cost.
{"title":"Adaptive Audio Synchronization Scheme Based on Feedback Loop with Local Clock in Wireless Audio Sensor Networks","authors":"Guotao Zhao, Huadong Ma, Hong Luo, Y. Sun","doi":"10.1109/ICPADS.2010.21","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.21","url":null,"abstract":"Wireless Audio Sensor Networks (WASNs) can provide event detection, object tracking and emergency response through cooperative audio sensor nodes. Effective collaboration of audio sensors requires precise synchronization among audio streams. Some researches have been done on the timestamp mechanism based on time synchronization ignoring propagation delay and many other researches have focused on the synchronization of simple gunshot or scream. However, for the synchronization of intermittent and fluctuating audio stream, there still exists many challenges. In this paper, we propose an effective audio synchronization scheme which can synchronize the intermittent audio streams adaptively while maintain low energy cost. On one hand, we obtain audio synchronization without global clock which save energy tremendously. On the other hand, by introducing a feedback loop mechanism, we can keep a high audio synchronization fidelity even when the audio source moves around and the sound strength varies with time. Furthermore, we discuss the extension for flexibility and scalability of this scheme when there exist several sound sources simultaneously or the audio source moves among clusters. Through experiments on a WASNs platform and simulations, we show that the proposed scheme is desirable to guarantee the accuracy of audio synchronization in practical environment with low energy cost.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126908561","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}
In peacekeeping, domestic or combat operations, unanticipated crowd confrontations can occur. As a highly dynamic social group, human crowd in confrontation is a fascinating phenomenon. This study proposes a novel method based on the concept of vector field to formulate the way in which external stimuli may affect the behaviors of individuals in a crowd. Our approach represents each individual as an autonomous agent whose actions are guided by the vector field model. Furthermore, the concept of information entropy has been adopted to describe the connection between individuals’ behaviors and the potential of disorder of the whole crowd. A quantitative analysis on intangible dynamics of a crowd in confrontation is then enabled, which is significant in designing crowd control tactics.
{"title":"Velocity Field Based Modelling and Simulation of Crowd in Confrontation Operations","authors":"Congcong Bian, Dan Chen, Shuaiting Wang","doi":"10.1109/ICPADS.2010.95","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.95","url":null,"abstract":"In peacekeeping, domestic or combat operations, unanticipated crowd confrontations can occur. As a highly dynamic social group, human crowd in confrontation is a fascinating phenomenon. This study proposes a novel method based on the concept of vector field to formulate the way in which external stimuli may affect the behaviors of individuals in a crowd. Our approach represents each individual as an autonomous agent whose actions are guided by the vector field model. Furthermore, the concept of information entropy has been adopted to describe the connection between individuals’ behaviors and the potential of disorder of the whole crowd. A quantitative analysis on intangible dynamics of a crowd in confrontation is then enabled, which is significant in designing crowd control tactics.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669890","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}
In mechanical engineering and aerospace, gas turbine blades are taken as the crucial components, and need special treatment for protection and long-turn service. Therefore, ceramic Thermal Barrier Coating (TBC), acting as the insulation between gas and the alloying bodies of blades, is utilized to guarantee that the gas turbine blades are able to work in the high-temperature and high-stress environment. It is imperative to non-destructively evaluate TBC systems of blades, since the TBC with thin thickness or delimitation will lead to catastrophic accidents of gas turbines. In this paper, Tri-frequency Eddy Current inspection (TFEC) is proposed for quantitative evaluation of TBC systems, which involves assessment of: (1) TBC thickness to identify possible thinning, and (2) thickness and conductivity of bond coating to detect delimitation and degradation. The Levenberg-Marquardt Algorithm is adopted in the inversion for the parameters, which need to be quantified. In the inverse process, the closed-form expressions of the Jacobian Matrix, which is conventionally obtained by using interpolation functions, are derived based on an analytical modeling. The inversion method is verified by a hybrid numerical modeling, which indicates that the proposed TFEC for quantitative evaluation of TBC is valid and applicable.
{"title":"Quantitative Evaluation of TBC Systems of Gas Turbine Blades Using TFEC","authors":"Yong Li, Y. Mao, Zhenmao Chen","doi":"10.1109/ICPADS.2010.121","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.121","url":null,"abstract":"In mechanical engineering and aerospace, gas turbine blades are taken as the crucial components, and need special treatment for protection and long-turn service. Therefore, ceramic Thermal Barrier Coating (TBC), acting as the insulation between gas and the alloying bodies of blades, is utilized to guarantee that the gas turbine blades are able to work in the high-temperature and high-stress environment. It is imperative to non-destructively evaluate TBC systems of blades, since the TBC with thin thickness or delimitation will lead to catastrophic accidents of gas turbines. In this paper, Tri-frequency Eddy Current inspection (TFEC) is proposed for quantitative evaluation of TBC systems, which involves assessment of: (1) TBC thickness to identify possible thinning, and (2) thickness and conductivity of bond coating to detect delimitation and degradation. The Levenberg-Marquardt Algorithm is adopted in the inversion for the parameters, which need to be quantified. In the inverse process, the closed-form expressions of the Jacobian Matrix, which is conventionally obtained by using interpolation functions, are derived based on an analytical modeling. The inversion method is verified by a hybrid numerical modeling, which indicates that the proposed TFEC for quantitative evaluation of TBC is valid and applicable.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125284187","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}
Sensor deployment is one fundamental task in sensor network implementation. We generalize and investigate the problem of deploying a minimum set of wireless sensors at candidate locations in constrained 3D space of interest to achieve k-coverage of given target areas such that each point in the target areas is covered by at least k sensors. Based on different constraints on sensor locations and target areas, we formulate four sensor deployment problems: Discrete / Continuous sensor Locations (D/CL) with Discrete / Continuous Target areas (D/CT). We propose an approximate algorithm for DLDT and reduce DLCT and CLDT to DLDT by discretizing continuous sensor locations or target areas into a number of divisions without loss of sensing precision. We further consider the connected version of these four sensor deployment problems where deployed sensors must form a connected network, and propose an approximate algorithm for each of these connected deployment problems.
{"title":"Approximate Algorithms for Sensor Deployment with k-coverage in Constrained 3D Space","authors":"Yunyue Lin, C. Wu","doi":"10.1109/ICPADS.2010.40","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.40","url":null,"abstract":"Sensor deployment is one fundamental task in sensor network implementation. We generalize and investigate the problem of deploying a minimum set of wireless sensors at candidate locations in constrained 3D space of interest to achieve k-coverage of given target areas such that each point in the target areas is covered by at least k sensors. Based on different constraints on sensor locations and target areas, we formulate four sensor deployment problems: Discrete / Continuous sensor Locations (D/CL) with Discrete / Continuous Target areas (D/CT). We propose an approximate algorithm for DLDT and reduce DLCT and CLDT to DLDT by discretizing continuous sensor locations or target areas into a number of divisions without loss of sensing precision. We further consider the connected version of these four sensor deployment problems where deployed sensors must form a connected network, and propose an approximate algorithm for each of these connected deployment problems.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121436523","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}
We analyze the problem of downlink resource allocation in a non-cooperative multi-level tree topology structured wireless mesh network in which a selfish mesh router (MR) may refuse to relay other MRs' traffic so as to improve its own performance at the cost of overall system performance. Based on game theory, we propose an auction framework, where the parent MR serves as the auctioneer while its children MRs act as bidders and compete for time-slots. We derive a payment function from radio resource used for relaying traffic instead of money, so as to simplify the implementation and avoid the possible security problems from monetary payment. We prove the existence and uniqueness of Nash Equilibrium and propose a stochastic best response updating algorithm to allow the bids to iteratively converge to NE in a practical distributed fashion. Simulation results show the proposed auction algorithm greatly outperforms traditional algorithms in non-cooperative environments.
{"title":"Downlink Resource Auction in a Tree Topology Structured Wireless Mesh Network","authors":"Z. Kong, Chengzhong Xu, Yu-Kwong Kwok","doi":"10.1109/ICPADS.2010.115","DOIUrl":"https://doi.org/10.1109/ICPADS.2010.115","url":null,"abstract":"We analyze the problem of downlink resource allocation in a non-cooperative multi-level tree topology structured wireless mesh network in which a selfish mesh router (MR) may refuse to relay other MRs' traffic so as to improve its own performance at the cost of overall system performance. Based on game theory, we propose an auction framework, where the parent MR serves as the auctioneer while its children MRs act as bidders and compete for time-slots. We derive a payment function from radio resource used for relaying traffic instead of money, so as to simplify the implementation and avoid the possible security problems from monetary payment. We prove the existence and uniqueness of Nash Equilibrium and propose a stochastic best response updating algorithm to allow the bids to iteratively converge to NE in a practical distributed fashion. Simulation results show the proposed auction algorithm greatly outperforms traditional algorithms in non-cooperative environments.","PeriodicalId":365914,"journal":{"name":"2010 IEEE 16th International Conference on Parallel and Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467207","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
扫码关注我们
求助内容：
应助结果提醒方式：