发布求助
文献互助 智能选刊 最新文献

2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献

筛选
英文 中文
Efficient scheduling for WiMAX Mesh network, with multiple egress 多出口WiMAX Mesh网络的高效调度
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342198
Zhao-wen Huang, Sui-li Feng, Ye Wu, Hong-cheng Zhuang
{"title":"Efficient scheduling for WiMAX Mesh network, with multiple egress","authors":"Zhao-wen Huang, Sui-li Feng, Ye Wu, Hong-cheng Zhuang","doi":"10.1109/CYBERC.2009.5342198","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342198","url":null,"abstract":"Since the WiMAX Mesh network can guarantee the QoS, it is possible to be deployed as backhaul network. And we need to consider the scheduling efficiency, throughput and robustness for it. In this paper, we analyze the scheduling mechanism of the WiMAX Mesh network and point out the problem of current backhaul network structure. We proposed a new WiMAX Mesh network structure with multiple BS as egress, and propose an efficient optimal scheduling algorithm for this new network structure. The detailed procedure for deploying this algorithm is described as well. We developed a simulation platform to verify this algorithm in WiMAX Mesh network with 20 and 50 MESH SS nodes respectively. The simulation result shows that our algorithm improves the efficiency varying from 53 percent to 70 percent. We also illustrate that our scheduling algorithm can solve the bottleneck problem of the backhaul network.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117066627","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}
引用次数: 1
On shortest path routing algorithm in crossed cube-connected ring networks 交叉立方体连接环形网络中最短路径路由算法研究
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342184
Xin Yu, Taoshen Li
{"title":"On shortest path routing algorithm in crossed cube-connected ring networks","authors":"Xin Yu, Taoshen Li","doi":"10.1109/CYBERC.2009.5342184","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342184","url":null,"abstract":"Crossed cube is a variation of hypercube, but some properties of the former are superior to those of the latter. However, it is difficult to extend the scale of crossed cube networks. For example, it is necessary to double the number of nodes to extend the scale of crossed cube networks. As a kind of hierarchical ring interconnection networks HRN, crossed cube-connected ring interconnection network CRN can effectively overcome the disadvantage. When extended, it only needs to be added a crossed cube. hence, it is a good topology for interconnection networks. Routing algorithm decides the performance of parallel computer system. In this paper, we first introduce the sufficient and necessary conditions for each link of one node in crossed cube to be a candidate link of a shortest path, and then present a shortest path adaptive routing algorithm with time complexity of O(n2) for CRN. At each routing step, it always choose a link in a good state to route from all the candidate links that belong to the shortest paths. Theoretical analysis show that the algorithm can output any shortest path.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285135","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}
引用次数: 4
Dependable and flexible planning messages scheduling on CAN with MPS techniques 利用MPS技术在CAN上可靠、灵活地规划消息调度
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342160
Shu-ju Wang, Tianxia Zhang, Guosheng Zhang
{"title":"Dependable and flexible planning messages scheduling on CAN with MPS techniques","authors":"Shu-ju Wang, Tianxia Zhang, Guosheng Zhang","doi":"10.1109/CYBERC.2009.5342160","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342160","url":null,"abstract":"Controller Area Network has been widely used as an embedded network in real time industry systems, e.g. real time in-vehicle control applications and driverless vehicles. However, with the increasing criticality of real time mobile control systems, requirements of the embedded network have changed and emphasis on dependability and bandwidth limitations. Flexible time-triggered CAN (FTTCAN) supports CAN to fulfill current dependability requirements and supports both periodic and sporadic real-time message, FTTCAN integrates dependability and flexibility of scheduling messages. To achieve higher bus utilization and avoid lower priority messages in asynchronous traffic suffering from starvation, a dynamic mixed planning-based scheduling (MPS) policy is presented in this paper. Through a case study, its performance is evaluated for scheduling messages on CAN for real time mobile systems.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132488469","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}
引用次数: 0
An improved staged event driven architecture for Master-Worker network computing 一种改进的主工网络计算阶段事件驱动架构
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342202
Biao Han, Zhongzhi Luan, Danfeng Zhu, Yinan Ren, Ting Chen, Yongjian Wang, Zhongxin Wu
{"title":"An improved staged event driven architecture for Master-Worker network computing","authors":"Biao Han, Zhongzhi Luan, Danfeng Zhu, Yinan Ren, Ting Chen, Yongjian Wang, Zhongxin Wu","doi":"10.1109/CYBERC.2009.5342202","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342202","url":null,"abstract":"We propose a new design for Master-Worker network computing systems, called the Master-Worker event driven architecture (MEDA). MEDA is an extension of staged event driven architecture and designed for the goal to meet the dynamic demand of Master-Worker model network computing systems, with support for high concurrency, adaptive resources management and modular construction. In MEDA, applications consist of a network of event-driven stages connected by queues. MEDA makes use of a set of dynamic control mechanisms for automatic tuning and load conditioning. Queuing theory is used for thread management mechanism. Application field extends from stand-alone environment to the wide area network environment through the introduction of network queue. Delay event queue realizes the balance of performance and resource consumption. Priority queue expands the availability of job scheduling strategy and improves system efficiency. From experiments of Drug Discovery Grid, these results show that MEDA systems exhibit higher performance, better reliability than Master-Worker network computing system developed using traditional design.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150764","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}
引用次数: 3
Threshold key management protocol in mobile ad hoc networks using an ID-based signcryption scheme 使用基于id的签名加密方案的移动自组织网络中的阈值密钥管理协议
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342189
Zhang Chuanrong, Xiao Hong
{"title":"Threshold key management protocol in mobile ad hoc networks using an ID-based signcryption scheme","authors":"Zhang Chuanrong, Xiao Hong","doi":"10.1109/CYBERC.2009.5342189","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342189","url":null,"abstract":"Threshold key management as a notable key management in a mobile ad hoc network is facing considerable technical challenges now. For design secure and efficient key management protocol in a mobile ad hoc network, in this paper, we give a new ID-based signcryption scheme which is efficienct in terms of both the communication overhead and the computational requirement. Furthermore, we apply our ID-based signcryption scheme into threshold key management. As a result, a system private key share refreshing protocol in threshold key management of a mobile ad hoc network is proposed. This protocol improves the security and efficiency of the previous protocols in a mobile ad hoc network owing to our ID-based signcryption scheme.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"12 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131505485","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}
引用次数: 2
Synchronized update over distributed and parallel database 对分布式和并行数据库进行同步更新
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342146
Jian-ying Chen, Xin-song Liu, Tao Li, Jianhua Zhang, Yan Wang
{"title":"Synchronized update over distributed and parallel database","authors":"Jian-ying Chen, Xin-song Liu, Tao Li, Jianhua Zhang, Yan Wang","doi":"10.1109/CYBERC.2009.5342146","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342146","url":null,"abstract":"To achieve synchronized update, two-phase commit protocol (2PC) has been broadly used for distributed databases. However, this is not enough for distributed and parallel database system (DPDBS), which has a distributed and parallel I/O interface and absolute peer to peer management among server nodes. Therefore, a distributed and parallel commit protocol (DP2PC) is proposed to improve the 2PC effectiveness. Transactions in inconsistent environment are successfully filtered. The performance is improved by taking consistency check of correlative data-catalog items into voting message, differentiating read-only-transaction from write-transaction and selecting the optimal service nodes. Further, our analysis and experiments indicate its adaptability to data environment with desirable performance.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"72 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116394850","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}
引用次数: 1
Improved channel order determination and its influence on delay estimation 改进的信道顺序确定及其对时延估计的影响
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342149
Li Yu
{"title":"Improved channel order determination and its influence on delay estimation","authors":"Li Yu","doi":"10.1109/CYBERC.2009.5342149","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342149","url":null,"abstract":"Channel order determination and delay estimation are important contents in parametric channel estimation. In this paper, an improved approach based on constant false alarm rate (CFAR) to detect the order of multipath channel is presented first. Then, delay estimation based on the estimation of signal parameters via rotational invariance techniques (ESPRIT) after order determination is conducted. Finally, the performance of delay estimation is analyzed in detail.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129493529","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}
引用次数: 0
Handoff mechanism in Mobile IP 移动IP中的切换机制
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342167
Mohamed Alnas, I. Awan, D. Holton
{"title":"Handoff mechanism in Mobile IP","authors":"Mohamed Alnas, I. Awan, D. Holton","doi":"10.1109/CYBERC.2009.5342167","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342167","url":null,"abstract":"Among the characteristics of the future wireless networks is the desire to support a wide range of wireless users and a diverse set of services from many different types of networks. A unifying technology for diverse wireless networking is Mobile IP, a protocol established by the Internet Engineering Task Force (IETF) that allows mobile nodes (MN) to change their point of attachment to the Internet while still being able to maintain a connection to the network Mobile IP is designed to support the mobility of a user, it is the only current means for offering seamless roaming to mobile computers in the Internet. In this paper, we give a brief survey of Mobile IP operation and functions, as well as proposed Pi-Calculus algorithm of Enhancement Mobile IP (E-Mobile IP) handoff mechanism using Link Layer Information to enhance the performance in term of packet loss and handoff latency.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130008093","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}
引用次数: 10
Agent platform-based directory facilitator for efficient service discovery 基于代理平台的目录促进器，用于高效的服务发现
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342177
Beoum-Su Kim, B. Son, S. Han, Hee-Sang Youn
{"title":"Agent platform-based directory facilitator for efficient service discovery","authors":"Beoum-Su Kim, B. Son, S. Han, Hee-Sang Youn","doi":"10.1109/CYBERC.2009.5342177","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342177","url":null,"abstract":"Today, multi-agent technologies are important in realizing upcoming ubiquitous environment, in which service discovery is a critical task for finding a particular service instance. While JADE is the most popular system for multi-agent applications, its directory facilitator (DF) employs the sequential search method causing inefficiency in various aspects. This paper proposes a new DF scheme which is registered as an agent and employs category database. The DFs are compared with regards to query response time and memory space requirement using the test agent we implemented. The results demonstrate that the proposed DF requires much smaller memory space requirement and allows faster query processing than JADE-DF, especially for large number of services and queries of multiple parameters.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130737948","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}
引用次数: 6
A bit-split byte-parallel string matching architecture 位分割字节并行字符串匹配体系结构
2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2009-12-01 DOI: 10.1109/CYBERC.2009.5342207
Chuanpeng Chen, Zhongping Qin
{"title":"A bit-split byte-parallel string matching architecture","authors":"Chuanpeng Chen, Zhongping Qin","doi":"10.1109/CYBERC.2009.5342207","DOIUrl":"https://doi.org/10.1109/CYBERC.2009.5342207","url":null,"abstract":"String matching is one of hot spots in computer science. Many algorithms for string matching have been proposed, but designing an efficient and practical string matching architecture to satisfy high-speed data streaming is difficult and needs further study. In this paper we propose a high throughput configurable string matching architecture based on Aho-Corasick algorithm. The architecture can be realized by random-access memory (RAM) and basic logic elements instead of designing new dedicated chips. The bit-split technique is used to reduce the RAM size, and the byte-parallel technique is used to boost the throughput of the architecture. By the particular design and comprehensive experiments with 100MHz RAM chips, one piece of the architecture can achieve a throughput of up to 1.6Gbps by 2-byte-parallel input, and we can further boost the throughput by using multiple parallel architectures.","PeriodicalId":222874,"journal":{"name":"2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974579","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}
引用次数: 4
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信