{"title":"The Mobile Router Forwarding Scheme for Multicast in the NEMO","authors":"Long-Sheng Li, Yong-Yu Yang, Jhu-Shyuan Mei","doi":"10.1109/NAS.2008.7","DOIUrl":"https://doi.org/10.1109/NAS.2008.7","url":null,"abstract":"Multicast is an efficient method to transmit datagrams in the Internet. In this paper, we provide a multicast algorithm in a network mobility (NEMO) environment. We propose the mobile router forwarding scheme (MRFS) algorithm. There are two advantages in the MRFS algorithm. First, MRFS reduces the storages in every MR especially in the TLMR (top level MR). Second, MRFS transmits multicast datagrams more efficiently that because MRFS transmit multicast datagrams not only by TLMR but also by every MR. The above of two advantages are achieved using MRFS tables. In this paper, MRFS algorithm is analyzed. MRFS algorithm is more efficient than other multicast protocols in the NEMO according to the evaluation.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122365301","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}
{"title":"Efficient and Locality-aware Resource Management in Wide-area Distributed Systems","authors":"Haiying Shen, Yingwu Zhu, W. Li","doi":"10.1109/NAS.2008.17","DOIUrl":"https://doi.org/10.1109/NAS.2008.17","url":null,"abstract":"Wide-area distributed systems such as data sharing, computational grids, and multimedia are increasingly being deployed in a large-scale, heterogeneous and dynamic distributed environment with geographically scattered resources. However, most current resource management approaches are unable to simultaneously deal with the characteristics of such an environment. This paper presents an efficient DHT-based locality-aware resource management mechanism. Taking advantage of a DHTpsilas hierarchical structure, it uses a single DHT to achieve multi-resource management with low overhead. Moreover, it has high capability to handle the characteristics of distributed systems. Simulation results demonstrate the effectiveness of the mechanism in comparison with other resource management algorithms. The mechanism performs no worse than existing locality-aware approaches and exhibits high resilience to dynamism. It also reduces the overhead of the locality-aware algorithms due to the elimination of unnecessary communications by shrinking probing scope. In addition, it yields significant improvements in the efficiency of resource discovery.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127713277","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}
{"title":"Design of a Secure Network Mirroring System for Data Sharing","authors":"Hu Jianzhong, Xie Changsheng, Zhong Haifeng","doi":"10.1109/NAS.2008.10","DOIUrl":"https://doi.org/10.1109/NAS.2008.10","url":null,"abstract":"Mirroring system separates the reading from storing of CD information, enabling user to share CD resource with high speed. To satisfy the increasing requirement of security and sharing, we design an iSCSI-based secure network mirroring system (short for iSNMS). Aiming at the emerging security threats, we introduce an adaptation to CHAP in iSNMS. The qualitative analysis and quantitative result indicate that iSNMS can achieve higher security and support more concurrent requests respectively.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126693204","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}
{"title":"EBEM: An Event-driven Bandwidth Estimation Method for Mobile Ad Hoc Network","authors":"Heming Cui, Cong Lin, Yong Xiang","doi":"10.1109/NAS.2008.34","DOIUrl":"https://doi.org/10.1109/NAS.2008.34","url":null,"abstract":"Quality of Service (QoS) support has been well studied as a hotspot in mobile ad hoc network. However, since interference range is much larger than transmission range, estimating available bandwidth at each node remains a challenge. To address this problem, a novel Event-driven Bandwidth Estimation Method (EBEM) is proposed in this paper. By incorporating a comprehensive intra-flow interference predicting approach and an event-driven inter-flow collision detecting strategy, EBEM could estimate nodal available bandwidth substantially, preventing the network from being overloaded. Results from simulation verify that EBEM not only surpasses typical AODV protocol in both end-to-end delay and packet delivery rate, but it also outperforms latest QAR method in both total throughput and packet delivery rate. As such, EBEM can be applied to various QoS routing protocols to estimate nodal available bandwidth.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126403785","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}
{"title":"Formation and Network Chain Control in Sparse Robot ad hoc Networks based on Potential Field","authors":"Hong Jiang, Y. Huang, G. Yang","doi":"10.1109/NAS.2008.14","DOIUrl":"https://doi.org/10.1109/NAS.2008.14","url":null,"abstract":"In this paper, we propose a scheme to maintain a communication link through the use of a communication relay chain in sparse mobile robot ad hoc networks. The scheme consists of three kinds of robots: a task robot, following robots and communication relay robots. The task robot performs predefined tasks; the following robots follow the task robot in a line formation; and the relay robots stop at given locations to form the relay chain. In addition traditional potential field, all robots are subject to an excess force caused by communication quality for formation and chain maintenance. If there appears a shortcut to previous relay, the unnecessary relay, subject to only forces created by the shortcut position and obstacles, will move by relay motion to the shortcut position. Our simulations show that the proposed scheme is very effective in sparse robot ad hoc network.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125675725","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}
{"title":"A Trace-Driven Simulation Study of Load Balancing on Distributed NIDS","authors":"F. Gu, Zhibin Zhang, Lihong Wang","doi":"10.1109/NAS.2008.45","DOIUrl":"https://doi.org/10.1109/NAS.2008.45","url":null,"abstract":"Load balancing algorithm plays a key role in distributed NIDS. In this paper, seven load balancing algorithms on flow-level are simulated with real network traffic trace. We compare these algorithms, and provide some rules on choosing load balancing algorithm for distributed NIDS oriented applications.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133899447","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}
Yong Sun, Zhibin Zhang, Li Guo, Shuo Bai, Jianlong Tan
{"title":"A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter","authors":"Yong Sun, Zhibin Zhang, Li Guo, Shuo Bai, Jianlong Tan","doi":"10.1109/NAS.2008.19","DOIUrl":"https://doi.org/10.1109/NAS.2008.19","url":null,"abstract":"Network traffic analysis based on flows plays an important role in network monitoring and P2P identification. They are all grounded in flow counting and differ in how to count. Timeout detecting is a major strategy to identify termination of flows and can influence the validity of flow counting. The algorithms for counting flow based on Hash method can't deal with timeout problems perfectly. In this paper, a novel algorithm based on loop bloom filter is proposed. It can estimate active flow with timeout detection on high speed links more accurately. Experiment results show that this algorithm can ensure accuracy while only consuming minimum time and memories.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128901205","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}
{"title":"Performance Characterization of a Dual Quad-Core Based Application Oriented Networking System","authors":"A. Waheed, J. Ding, Jingnan Yao, L. Bhuyan","doi":"10.1109/NAS.2008.53","DOIUrl":"https://doi.org/10.1109/NAS.2008.53","url":null,"abstract":"In this paper, we investigate performance characteristics of an Application Oriented Networking (AON) system based on Intelpsilas dual quad-core Xeon E5335 processors. This dual quad-core based AON system has unique hierarchical cache architecture, mainly local, neighboring, and remote L2 caches. Using on-chip processor counters, we observe that shared memory based communication latency between a pair of threads is non-uniform depending on theircore affinities, which may vary by more than an order of magnitude. In addition, we show that CPU-intensive applications scale better than I/O-intensive applications as the number of processor cores increases.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132589076","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}
{"title":"MemoryIO: An Extended I/O Technology in Embedded Systems","authors":"Xiaojun Yang, Taoying Liu, Fei Chen, Hailiang Cheng","doi":"10.1109/NAS.2008.23","DOIUrl":"https://doi.org/10.1109/NAS.2008.23","url":null,"abstract":"MemoryIO, a sort of extended I/O in embedded systems, is presented in this paper. MemoryIO makes it powerful for embedded systems to achieve the high-performance interconnect. In view of the facts that the main memory system is absolutely necessary in any embedded system, and not all embedded systems integrate HyperTransport (HT), PCI Express or RapidIO interface, the MemoryIO based interconnect in embedded systems has more universalities compared with that based on HT, PCI Express or RapidIO. MemoryIO can not only thoroughly compensates for the lack of high performance data transfer channel, but also efficiently utilizes the memory bus bandwidth and the direct memory access (DMA) engine to reduce the latency for data transfer in embedded systems. This paper discusses some key technologies of MemoryIO, and presents its application in DCNet and the implementation of MemoryIO IP core. The MemoryIO technology can be used in various systems, but not limited to embedded systems.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130423376","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}
{"title":"A Pollution Alleviative L2 Cache Replacement Policy for Chip Multiprocessor Architecture","authors":"Jun Zhang, Xiaoming Fan, Song-He Liu","doi":"10.1109/NAS.2008.30","DOIUrl":"https://doi.org/10.1109/NAS.2008.30","url":null,"abstract":"Chip multi-processor exploits both instruction-level and thread-level parallelism effectively. In a typical chip multi-processor architecture, L2 cache is shared by multiple cores. Sharing the L2 cache allows high cache utilization and avoids duplicating cache hardware resources. Unfortunately, the mis-predictions of any processor core could lead the load miss from the wrong path to write some useless data into the shared L2 cache, and cause L2 cache pollution. This may increase additional cache misses and lessen performance of other threads for failing to occupy sufficient L2 cache space, and even cause threads starvation. This paper proposes a light pollution replacement policy for shared L2 cache, called LPR, which priorities swapping of wrong path data to eliminate the pollution caused by the execution of the wrong path load instructions as soon as possible. Under the configuration of dual-core CMP architecture, 32KB private data/instruction L1 cache, 512KB shared L2 cache, simulation results show that LPR improves the IPC from 1.83% to 7.57% averagely, 11.1% mostly, and increases the L2 cache hit rate from 0.47% to 0.85% averagely, 1.91% mostly, due to the pollution alleviation of the shared L2 cache.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127317009","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}