2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)最新文献_第5页

A New Intrusion Detection Method Based on Artificial Immune System 基于人工免疫系统的入侵检测新方法

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.117

Baoyi Wang, Shaomin Zhang

引用次数: 11

An Algorithm of Similarity Mining in Time Series Data on the Basis of Grey Markov Scgm(1,1) Model 基于灰色马尔可夫Scgm(1,1)模型的时间序列数据相似性挖掘算法

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.118

Guoqiang Xiong, Qingjing Gao

引用次数: 2

Processing Optimization for Injection Plastic Molding on Mold Design Grid 基于模具设计网格的注射塑料成型工艺优化

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.115

Cui Zhendong, Wang Xicheng, L. Zhijie

引用次数: 0

An Efficient Sensor Observation Data Registration based on Asynchronous Service Middleware 基于异步服务中间件的传感器观测数据高效配准

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.25

Nengcheng Chen, Zhong Zheng, Zeqiang Chen

{"title":"An Efficient Sensor Observation Data Registration based on Asynchronous Service Middleware","authors":"Nengcheng Chen, Zhong Zheng, Zeqiang Chen","doi":"10.1109/NPC.2007.25","DOIUrl":"https://doi.org/10.1109/NPC.2007.25","url":null,"abstract":"Recent advances in sensor web geospatial data capture, such as high resolution satellite images as well as corresponding web ready data processing and modeling technologies, have led to the generation of large amounts of datasets on real-time or near realtime observation and measurement. The quality of observation data register has become a 'bottleneck' of sensor web-based applications. In order to improve the quality of sensor data register, Sensor Observation Service (SOS) register middleware is put forward, which includes geospatial sensor observation service (SOS), geospatial catalogue service based on ebRIM, SOS register mediator service, sensor data granule information extraction service, and sensor data granule record generation service. The content and sequence of SOS observation 'synchronous' and 'asynchronous' data register strategy based on service middleware is described. The prototype system is designed and implemented by OGC CSW specification and SWE SOS standard. The EO-1 SOS register is tested, including 2420 WCSLayer observation records in a specified time, and the performance is evaluated. The experimental result shows the efficiency of the 'asynchronous' strategy proposed in this paper is 0.3- 0.4 times fast than that of the 'synchronous'.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"564 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133847299","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

On the Effectiveness of Flexible Deterministic Packet Marking for DDoS Defense 柔性确定性报文标记在DDoS防御中的有效性研究

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.57

Y. Xiang, Wanlei Zhou, Zhongwen Li, Qun Zeng

{"title":"On the Effectiveness of Flexible Deterministic Packet Marking for DDoS Defense","authors":"Y. Xiang, Wanlei Zhou, Zhongwen Li, Qun Zeng","doi":"10.1109/NPC.2007.57","DOIUrl":"https://doi.org/10.1109/NPC.2007.57","url":null,"abstract":"IP traceback is one of the defense mechanisms for distributed denial of service (DDoS) attacks. However, most traceback schemes consume extensive resources such as CPU, memory, disk storage and bandwidth and require a large amount of IP packets to reconstruct sources, which makes them impractical and ineffective. In this paper, we present a new flexible IP traceback scheme called flexible deterministic packet marking (FDPM). The flexibilities of FDPM are in two ways, one is that it can adjust the length of marking field according to the network protocols deployed, thus it can work well even in an environment with different network protocols; the other is that it can adjust the marking rate according to the load of participating router, while it still can maintain the marking function. In order to verify the effectiveness of FDPM for DDoS defense in terms of marking efficiency, maximum forwarding rate, and number of packets for reconstruction, we tested FDPM by both simulation and Linux router implementation with an emphasis on the latter. The experiments demonstrate that the built-in overload prevention mechanism, flow-based marking, can isolate and mark the most possible DDoS attack packets, while keeping the load of the participating router in a reasonably low degree. The real hardware implementation confirms that this flexible capability is important when traceback mechanisms are used in a real DDoS defense scenario.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115835123","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

Web and Mobile Data Management Web和移动数据管理

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.155

Xiaofeng Meng, Wei Liu

引用次数: 1

Design and Realization of CGI in Embedded Dynamic Web Technology 嵌入式动态Web技术中CGI的设计与实现

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.39

Chen Tian-huang, Huang Jia-xi

引用次数: 7

A Novel Approach of Available Bandwidth Estimation for Heterogeneous Networks 异构网络可用带宽估计的一种新方法

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.95

Yuhua Liu, Hao Huang, Kaihua Xu

引用次数: 1

A Rapid Algorithm to Find Replacement Services for K-Shortest Path Problem with QoS Constraints 具有QoS约束的k -最短路径问题替换服务的快速算法

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.135

Jianqiang Hu, Xingzhi Feng, Zhiwei Zhang, Quanyuan Wu

{"title":"A Rapid Algorithm to Find Replacement Services for K-Shortest Path Problem with QoS Constraints","authors":"Jianqiang Hu, Xingzhi Feng, Zhiwei Zhang, Quanyuan Wu","doi":"10.1109/NPC.2007.135","DOIUrl":"https://doi.org/10.1109/NPC.2007.135","url":null,"abstract":"During the execution of composite service, if one service component in critical path fails, or becomes overloaded not to be accessed, a mechanism is needed to ensure that the whole running process isn't interrupted. The failed service needs be replaced quickly and efficiently by switching to a new path. Recent researches on this problem don't consider the influence of the QoS criteria of service candidates or the connection state of the overlay network, so the algorithms are easily disabled. In this paper, we solve the maximum utility path problem that is motivated by recent interest in k-shortest path problem. A new algorithm WSC_KUPB (web service composition k-maximum utility path backup) is described to enumerate the k maximum utility of simple loopless paths in a digraph. We construct utility path tree by using the utility function as the evaluation standard. And we enumerate every edge in cut edge set across two utility path trees; compute the utility value of the new path. Finally the optimal path with the maximum total utility is chosen as a backup path. The test result shows the algorithm performs very well in the efficiency and availability as compared to other relevant algorithms.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129694549","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

Experimental Views on Neighbor Selection in BitTorrent BitTorrent中邻居选择的实验研究

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI: 10.1109/NPC.2007.122

Yingchun Lei, L. Yang, Qi Jiang, Chanle Wu

引用次数: 6