2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)最新文献

筛选
英文 中文
An analytical study of FairOM: a fair overlay multicast protocol for Internet-scale distributed systems 互联网规模分布式系统公平覆盖组播协议FairOM的分析研究
Yijun Lu, Xueming Li
{"title":"An analytical study of FairOM: a fair overlay multicast protocol for Internet-scale distributed systems","authors":"Yijun Lu, Xueming Li","doi":"10.1109/IWNAS.2006.15","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.15","url":null,"abstract":"Fairness emerges as an important research issue in overlay multicast because spreading the multicasting load evenly among participants can eliminate potential traffic hot spots, thus improving the system's quality of service (QoS). In this paper, we analyze FairOM and compare it with non-FairOM approaches from two aspects: tree height and number of sessions that can be supported, which measure FairOM from a single-session's and multiple-session's point of view, respectively","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128791483","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
TEA: transmission error approximation for distance estimation between two Zigbee devices 两个Zigbee设备之间距离估计的传输误差近似
2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06) Pub Date : 2006-08-01 DOI: 10.1504/IJHPCN.2010.037800
Weijun Xiao, Y. Sun, Yinan Liu, Qing Yang
{"title":"TEA: transmission error approximation for distance estimation between two Zigbee devices","authors":"Weijun Xiao, Y. Sun, Yinan Liu, Qing Yang","doi":"10.1504/IJHPCN.2010.037800","DOIUrl":"https://doi.org/10.1504/IJHPCN.2010.037800","url":null,"abstract":"This paper proposes a simple and cost-effective method named transmission error approximation (TEA) for estimating the distance between two Zigbee devices. The idea is to measure and analyze statistically packet loss rates for approximate distance estimation. We have implemented an experimental prototype for the TEA using Zigbee protocol. The prototype is built on FreeScale's MCF5208 evaluation boards that have a built-in MC13192 ZigBee transceiver chip. Field experiments have been carried out at the lacrosse field on URI campus. Measurement results show that TEA is a cost-effective way of distance estimation and provides much better resolution than other methods based on signal strength when the distance is greater than 60 feet","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127345931","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}
引用次数: 15
Creation of a Java-based interactive modeling environment with tape library model example 创建了一个基于java的交互式建模环境,带有磁带库模型示例
Lingfang Zeng, D. Feng, F. Wang, Zhuo Cheng, Qiang Zou
{"title":"Creation of a Java-based interactive modeling environment with tape library model example","authors":"Lingfang Zeng, D. Feng, F. Wang, Zhuo Cheng, Qiang Zou","doi":"10.1109/IWNAS.2006.23","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.23","url":null,"abstract":"Within high performance backup/restore environment there are cases that require the retrieval of massive data with huge size from tape storage to disks. The data retrieval time affects the system utilization or the system recovering speed. Some schemes were/will be proposed to place data across tape drives for minimized data retrieval latency. SimTape, a Java-based tape library simulator, is built to compare above mentioned allocation schemes which minimize data seek time and tape switch time respectively. This paper describes the development and application of SimTape's software simulation model, also, for the design and optimization of the record, readout and data recovery processes common to all existing tape library processes. The simulation model provides an accurate statistical report from which each scenario can be evaluated","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128798407","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
A Domain-Based Storage Management Framework for the WAN 广域网基于域的存储管理框架
Ke Zhou, Ze Deng
{"title":"A Domain-Based Storage Management Framework for the WAN","authors":"Ke Zhou, Ze Deng","doi":"10.1109/IWNAS.2006.6","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.6","url":null,"abstract":"In this paper, we present the design of a domain-based storage management framework for the wide area network (WAN) toward catering for the large-scale and heterogeneous storage environment. In our design, we include the framework architecture, the registration mechanism based on the use of session initiation protocol (SIP), and the storage management initiative specifications (SMI-S) based storage management scheme. Finally, a prototype implementation is shown","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123546646","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
Mobility Control with Local Views of Neighborhood in Mobile Networks 基于邻域局部视图的移动网络移动控制
Zhen Jiang, Jie Wu, Robert Kline
{"title":"Mobility Control with Local Views of Neighborhood in Mobile Networks","authors":"Zhen Jiang, Jie Wu, Robert Kline","doi":"10.1109/IWNAS.2006.33","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.33","url":null,"abstract":"Recent work in mobile ad hoc networks, simply MANETs, has drawn attention to the mobility capability of each node. In the work of Goldenberg et al. (2004), it is proved that the optimal positions of the relay nodes along a single active flow must lie entirely on the line between the source and destination with each node spaced evenly along such a line. Based on this, we propose two distributed schemes to control the relay nodes in MANETs to approach their optimal positions in the local relative coordinate system, one using one-hop neighborhood and the other using two-hop neighborhood. Unlike the one presented by Goldenberg et al. (2004) using only one-hop neighborhood, our methods have no oscillation problem and converge more quickly. To reduce the overhead in synchronization, outdated neighborhood (lagging by one round of information exchange and update) is used in our two-hop neighborhood based approach. The simulation results show the substantial improvement on the speed of achieving the optimal configuration and the total moving distance of nodes","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695785","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}
引用次数: 5
Call Routing Algorithm for NGN Multimedia Communication Based on Quasi-homo-administrative Domain 基于准同质管理域的NGN多媒体通信呼叫路由算法
Zhanwu Yu, Rui Li, S. Pan
{"title":"Call Routing Algorithm for NGN Multimedia Communication Based on Quasi-homo-administrative Domain","authors":"Zhanwu Yu, Rui Li, S. Pan","doi":"10.1109/IWNAS.2006.21","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.21","url":null,"abstract":"Aimed at the lower access efficiency between administrative domains (AD) in NGN multimedia communication, we adopted the coding pattern for telephone number based on ITU-T E.164 protocol and the method in resolving process of DNS, and put forward a routing addressing algorithm for inter-domain communication. This algorithm was based on quasi-homo-administrative domain (QUAD). It used H.225 Annex G protocol messages to exchange address templates between superior level and lower level ADs. Therefore, they could get real-time address information. And all level ADs could keep a routing table of all ancestors. When it initiated a call, it applied for resolving an address to the furthest quasi-homo-level ancestor directly. So the resolving process could be done in a comparatively smaller domain. By analyzing the algorithm performance and simulating the algorithm model, we find it can reduce the response delay of routing greatly. It can also decrease the using and traffic of communication channels. In addition, it has the same coding pattern for telephone number like PSTN. So it can realize the intercommunication between PSTN network and Internet easily","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133563777","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
A two-way selective encryption algorithm for MPEG video 一种用于MPEG视频的双向选择性加密算法
Liu Jun, Zou Lingling, Xie Changsheng, Huang Hao
{"title":"A two-way selective encryption algorithm for MPEG video","authors":"Liu Jun, Zou Lingling, Xie Changsheng, Huang Hao","doi":"10.1109/IWNAS.2006.13","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.13","url":null,"abstract":"The security of multimedia data in digital network is commonly provided by encryption. Nevertheless, most current modern encryption algorithms, which only transform a plaintext message that is the simplest form of multimedia data into unintelligible ciphertext, are not appropriate for higher forms such as images and video with very large file sizes. Selective encryption of MPEG video streams has been proposed to reduce encryption requirements, saving in complexity and facilitating new system functionality. In this paper, a two-way selective encryption algorithm (TWAEA) for MPEG video is proposed to compromise the security and speed in the process of encryption","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114949533","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}
引用次数: 17
NVD: the network virtual device for HA-SonD NVD: ha - sd的网络虚拟设备
Hai-Ying Tang, Feng Shuo, Zhang Huan, Y. Yang, X. Lu
{"title":"NVD: the network virtual device for HA-SonD","authors":"Hai-Ying Tang, Feng Shuo, Zhang Huan, Y. Yang, X. Lu","doi":"10.1109/IWNAS.2006.34","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.34","url":null,"abstract":"Service on demand (SonD) system is a service deployment system based on network storage. Current SonD system has single point of failure issue. To provide 24/7 continuous services, we develop high-availability SonD (HA-SonD) system. This paper describes the design, implementation and performance of network virtual device (NVD), the key data transfer protocol in HA-SonD system. NVD is developed on top of remote procedure call (RPC) interface, focusing on the availability and performance of network storage service. Our experiments show that NVD tolerates server failure and enables client machine unaware to service recovery. The experiments also present that NVD prototype delivers comparable performance with NBD for write operations and outperforms NBD for read operations","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628174","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
Resilient P2P anonymous routing by using redundancy 利用冗余实现弹性P2P匿名路由
2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06) Pub Date : 2006-08-01 DOI: 10.1504/IJHPCN.2010.037793
Yingwu Zhu
{"title":"Resilient P2P anonymous routing by using redundancy","authors":"Yingwu Zhu","doi":"10.1504/IJHPCN.2010.037793","DOIUrl":"https://doi.org/10.1504/IJHPCN.2010.037793","url":null,"abstract":"One hurdle to using peer-to-peer networks as anonymizing networks is churn. Node churn makes anonymous paths fragile and short-lived: failures of a relay node disrupt the path, resulting in message loss and communication failures. To make anonymous routing resilient to node failures, we use a simple yet powerful idea based on message redundancy by erasure coding and path redundancy to mask node failures. We present an allocation of erasure-coded message segments among multiple paths that provides a guideline on how to maximize routing resilience upon different node availabilities in real-world systems. Our approach allows a tradeoff between routing resilience and bandwidth usage. We show that our approach greatly improves routing resilience while only incurring a moderate bandwidth overhead","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131590774","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
Hierarchical mesh architecture: toward practical applications 分层网格体系结构:走向实际应用
Xiaoxin Wu
{"title":"Hierarchical mesh architecture: toward practical applications","authors":"Xiaoxin Wu","doi":"10.1109/IWNAS.2006.28","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.28","url":null,"abstract":"Wireless mesh network is considered to be one of the candidates for solving the last mile problem in high speed network services. Traditional mesh network faces the challenge of scalability due to the features of self-organization and multi-hop connection. In this short paper, we propose a hierarchical architecture for large size mesh networks. A mesh network is divided into small networks, which are operated independently and are connected through a reliable backbone network. We present the architecture and address routing/security issues","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132081264","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书