{"title":"Peer-assisted Content Delivery Network for Live Streaming: Architecture and Practice","authors":"Yu Liu, H. Yin, Guangxi Zhu, Xuening Liu","doi":"10.1109/NAS.2008.9","DOIUrl":"https://doi.org/10.1109/NAS.2008.9","url":null,"abstract":"This paper presents a hierarchical peer-assisted CDN architecture for live streaming, concerning the scalability of Content Delivery Networks (CDNs) and quality of the prosperous live streaming services. The meaning of Peer-assisted in our design is twofold: 1) a Peer-to-Peer(P2P) overlay on CDN data centers to accelerate stream piping among servers; and 2) P2P extended client regions conducted by corresponding edge servers for scalable streaming to clients. A system built according to this architecture has been deployed on ChinaCache, our partnering CDN. Results of practicing performance prove our design is able to achieve unprecedented scalability and high QoS for live streaming services of commercial CDNs.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"17 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":"134351287","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":"On the Security of Group Signature Scheme and Designated Verifier Signature Scheme","authors":"Jianhong Zhang, Qin Geng","doi":"10.1109/NAS.2008.21","DOIUrl":"https://doi.org/10.1109/NAS.2008.21","url":null,"abstract":"As two special digital signatures, group signature and designatedverifier signature play very important roles in the e-commerce. A group signature scheme allows a group member to anonymously sign message on behalf of the group, In case of a dispute, the group manager can reveal the actual identity of signer. Group signature is widely used in e-cash, e-voting, e-bid and so on. In a designated verifier signature scheme, only the designated verifier can verify the validity of a signature. Thus, the designated verifier signature is widely applied in the copyright-protect. Recently, Zhou et.al presented a dynamicgroup signature scheme with forward security, and Zhang et.al gave an efficient ID-based designated verifiersignature scheme. Unfortunately, in this work we show that Zhou et.al's group signature is universally forgeable, Namely, any one can forge a group signature on another message by a given signature, then an improved vision is presented; And we also show that Zhang et.al's scheme is delegatable, namely, a third party can produce a signature on message m by the revealed side information. Finally, we give the corresponding attack on the two signature schemes.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"28 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":"133242837","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":"Revocation in an Attribute-Based Delegation Model","authors":"Chunxiao Ye, Zhongfu Wu, Jiang Zhong, Yong Feng","doi":"10.1109/NAS.2008.39","DOIUrl":"https://doi.org/10.1109/NAS.2008.39","url":null,"abstract":"Attribute-based delegation model (ABDM) is a secured and flexible delegation model with an extended delegation constraint. Delegation attribute expressions can be changed in delegation, which induces an automatic revocation in ABDM. In this revocation, delegated permissions can be removed from users automatically according to dominance relation among DAEs of users and delegated permissions. Automatic revocation thus relieves the administrative efforts of delegator or system administrator in revocation. For a better flexibility, ABDM also supports revocation by delegator or system administrator. This paper also discusses some revocation modes of automatic revocation.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"17 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":"116773280","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":"Event-based Trust Framework Model in Wireless Sensor Networks","authors":"Haiguang Chen, Huafeng Wu, Jinchu Hu, Chuanshan Gao","doi":"10.1109/NAS.2008.33","DOIUrl":"https://doi.org/10.1109/NAS.2008.33","url":null,"abstract":"The security of wireless sensor networks is ever more important nowadays. Most of the proposed security protocols in wireless sensor networks are based on authentication and encryption. But all of them only address part of the problem of security in wireless sensor networks. Recently, the use of reputation and trust systems has become an important secure mechanism in wireless sensor networks. In this paper we propose a new protocol ETSN to construct a trust framework model in wireless sensor networks. The ETSN will be more suitable than ATSN and RFSN in wireless sensor networks. The simulation results and analysis show that our scheme not only can fast detect the malicious nodes and scale well for wireless sensor networks, but also can distinguish trust rating with different event.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"13 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":"122250154","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}
D. Dong, Jianzhong Zhang, Ying Wu, Hongbo Lu, G. Wu
{"title":"A Spam Filter System Based on P2P Architecture","authors":"D. Dong, Jianzhong Zhang, Ying Wu, Hongbo Lu, G. Wu","doi":"10.1109/NAS.2008.32","DOIUrl":"https://doi.org/10.1109/NAS.2008.32","url":null,"abstract":"Nilsimsa algorithm plays an important part in the anti-spam technique. In the paper, we design a P2P based Anti-spam system using CAN Overlay, and demonstrate the effectiveness of our mechanism by simulation at last.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"42 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":"115278870","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":"Applications of Bloom Filters in Peer-to-peer Systems: Issues and Questions","authors":"Hailong Cai, Ping Ge, Jun Wang","doi":"10.1109/NAS.2008.52","DOIUrl":"https://doi.org/10.1109/NAS.2008.52","url":null,"abstract":"Bloom filter is a widely-used data structure that concisely represents a large set of contents for approximate membership queries. Due to its good space efficiency, Bloom filter has been applied or customized in a variety of P2P system designs. Although the basic idea of Bloom filter is explained each time it is used, elaborative details are ignored. However, we argue that it is no.t always a trivial task to make a good decision on specific design aspects when applying Bloom filters in P2P systems. If not well deployed, the overhead and side effects of Bloom filters may outweigh their benefits. In this paper we study Bloom filter in the context of P2P systems, and explore its design space on several important issues. Our goal is to provide an in-depth understanding on Bloom filter's strength and weakness, and gain an insight into its usagein P2P systems. In addition, we raise some open questions that deserve further discussion among theP2P community.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"20 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":"115251366","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":"An Ontology-based Virtual Storage System","authors":"Zhaobin Liu, Haitao Li","doi":"10.1109/NAS.2008.47","DOIUrl":"https://doi.org/10.1109/NAS.2008.47","url":null,"abstract":"The number of storage subsystems deployed on the data centre has been increasing continually. These systems consist of heterogeneous storage nodes of diverse architectures and storage quality of service (QoS). Meanwhile, various application requirements with different QoS aspirations have been forced to share the data centre. Virtualization of storage helps achieve location independence by abstracting the physical location of the data. This paper presents an ontology-driven model for virtual storage system, and shows how a Publisher Module identifies ontology repository and a Subscriber Module specifies a statement in requesters. Using a Matchmaker Module, we find it allows service providers to differentiate QoS offered to their customers.","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":"129442678","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":"Fibre Channel Arbitrated Loop - Performance Analysis of Loop Tenancy Overhead","authors":"Mikkel Hagen, Elizabeth Varki","doi":"10.1109/NAS.2008.18","DOIUrl":"https://doi.org/10.1109/NAS.2008.18","url":null,"abstract":"The performance analysis of high-speed storage networks is a challenge due to the inability of most disk based targets to completely utilize a channel. We use a RAM drive to maximize the bandwidth of a 4G fibre channel network and use standard performance metrics to analyze the bottlenecks of the system. We experimentally show the effects of increasing the number of initiators and targets on the performance of an arbitrated loop. We also analyze the impact of increasing the length of the loop beyond the standard. Finally, we conclude how the performance of a device on the loop can plummet when there is another device with higher priority not using fairness.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"14 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":"121615055","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 Novel Embedded Accelerator for Online Detection of Shrew DDoS Attacks","authors":"Hao Chen, Yu Chen","doi":"10.1109/NAS.2008.13","DOIUrl":"https://doi.org/10.1109/NAS.2008.13","url":null,"abstract":"As one type of stealthy and hard-to-detect attack, low-rate TCP-targeted DDoS attack can seriously throttle the throughput of normal TCP flows for a long time without being noticed. The Power Spectral Density (PSD) analysis in frequency domain can detect this type of attack accurately. However, computational complexity of PSD analysis makes it impossible for software implementation at high speed network. Taking advantages of powerful computing capability and software-like flexibility, an embedded accelerator using FPGA for PSD analysis has been proposed. Optimized design in autocorrelation calculation algorithm and DFT processing distinguishes our scheme more meaningful for high speed real-time processing with limited resources. Simulation verifies that even working at very low system clock frequency, our design can still provide quality-service for malicious detection in multi-gigabyte rate network.","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":"124394310","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":"An EPN-based Method for Web Service Composition","authors":"Min Gao, Lily Sun, Zhongfu Wu, Feng Jiang","doi":"10.1109/NAS.2008.70","DOIUrl":"https://doi.org/10.1109/NAS.2008.70","url":null,"abstract":"Web service composition can be facilitated by an automatic process which consists of rules, conditions and actions. This research has adapted ElementaryPetri Net (EPN) to analyze and model the web services and their composition. This paper describes a set of techniques for representing transition rules, algorithm and workflow that web service composition can be automatically carried out.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"10 8 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":"126212638","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}