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

2007 International Symposium on Applications and the Internet Workshops最新文献

筛选
英文 中文
Smart Parking: An Application of Optical Wireless Sensor Network 智能停车:光无线传感器网络的应用
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.98
J. Chinrungrueng, U. Sunantachaikul, S. Triamlumlerd
{"title":"Smart Parking: An Application of Optical Wireless Sensor Network","authors":"J. Chinrungrueng, U. Sunantachaikul, S. Triamlumlerd","doi":"10.1109/SAINT-W.2007.98","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.98","url":null,"abstract":"Parking problems are commonplace in most major cities. The limited availability of parking results in traffic congestion, air pollution as well as driver frustration. The price for parking expansion is usually prohibitive or extremely high. Recently researchers turned to applying technologies for efficient parking management. In our previous work, we have developed an optical wireless sensor network (WSN) for traffic monitoring. We have demonstrated our system to the public in several exhibitions. It is realized that this simple invention could be applied to monitor vehicles in a parking garage. The system can then inform drivers of the number of available parking spaces and in which area should they be directed to. This kind of system should avoid driver's frustration in trying endlessly to find a parking space in a crowded parking garage. This paper describes our work to modify our original WSN and applies it to parking garages. Problems associated to applying our original WSN to parking garage are explained, and solutions are proposed","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114984501","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}
引用次数: 149
Data Management on Grid Filesystem for Data-Intensive Computing 面向数据密集型计算的网格文件系统数据管理
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.38
Hitoshi Sato, S. Matsuoka
{"title":"Data Management on Grid Filesystem for Data-Intensive Computing","authors":"Hitoshi Sato, S. Matsuoka","doi":"10.1109/SAINT-W.2007.38","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.38","url":null,"abstract":"In parallel computing environments such as HPC clusters and the grid, data-intensive applications involve large overhead costs due to a concentration of access to the files on common nodes. To avoid this problem in traditional distributed file systems, users have to distribute the file access manually. However, such solution has some difficulties for users in the grid environment. We propose a data management mechanism for data-intensive computing on grid filesystem. Our technique improves the file access performance by automatically scheduling the file access and the data management on the filesystem. The filesystem is based on dynamically configured node groups corresponding to the network topology. Utilizing the configuration, it monitors file access to detect concentrated situations, creates the file replica, and schedules its placement and access. We applied the proposal technique to the Gfarm, a filesystem that scales to the grid. We emulate real application workloads using a job scheduler and confirmed a speedup of factor 3.7 compared with a filesystem without automatic file access distribution techniques","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130909165","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
Application of Content-Based Network for Sensor Data Distribution System 基于内容的网络在传感器数据分发系统中的应用
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.27
H. Ochiai, Zhiyong Wang, Ryo Oguchi, Tetsuhiro Sugiyama, Yusuke Sakamoto, S. Ishida, H. Esaki
{"title":"Application of Content-Based Network for Sensor Data Distribution System","authors":"H. Ochiai, Zhiyong Wang, Ryo Oguchi, Tetsuhiro Sugiyama, Yusuke Sakamoto, S. Ishida, H. Esaki","doi":"10.1109/SAINT-W.2007.27","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.27","url":null,"abstract":"This paper proposes and evaluates a new sensor data distribution system, based on the content based network technology. This system is an overlay XML-based content-based routing system over the plain unicast IP network. As the application of the prototype system, we have selected Live E! project, whose object is collecting the weather information from various weather stations and distributing these digital data to the appropriate receiver nodes using the XML-based content-based multicast service. We have designed (1) the representation format of sensor information with XML, (2) content-based multicast routing algorithm using XPath. We have implemented the proposed system for its technical and functional validation","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133014961","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
N-TAP: A Platform of Large-Scale Distributed Measurement for Overlay Network Applications N-TAP:覆盖网络应用的大规模分布式测量平台
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.81
K. Masui, Y. Kadobayashi
{"title":"N-TAP: A Platform of Large-Scale Distributed Measurement for Overlay Network Applications","authors":"K. Masui, Y. Kadobayashi","doi":"10.1109/SAINT-W.2007.81","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.81","url":null,"abstract":"To sustain a large-scale overlay network, knowledge about network characteristics is indispensable. However, the collection of such information is often a burden on the developers: why should they struggle to obtain the information even though it is not their intended purpose? As one solution to this problem, this paper presents N-TAP, a distributed measurement infrastructure. N-TAP is an independent service for overlay network applications that provides network characteristics. N-TAP itself forms the measurement overlay network on which measurement nodes can cooperate in measurement activity. Consequently, overlay network applications can take full advantage of novel measurement methodologies. Through a discussion on the problems of distributed measurement, in this paper we explore the capabilities and the future direction of N-TAP","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114432539","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
ANEMONE: A Pan-European Testbed to Validate IPv6 Mobility Technologies ANEMONE:验证IPv6移动技术的泛欧测试平台
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.25
L. Bokor, N. Montavont, Paolo Di Francesco, T. Ernst, T. Hof, J. Korva
{"title":"ANEMONE: A Pan-European Testbed to Validate IPv6 Mobility Technologies","authors":"L. Bokor, N. Montavont, Paolo Di Francesco, T. Ernst, T. Hof, J. Korva","doi":"10.1109/SAINT-W.2007.25","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.25","url":null,"abstract":"The paper reports on an ongoing European Commission funded R&D project called ANEMONE, which aims at realizing a large-scale testbed for mobility technologies. This testbed will provide support of mobile users and devices, as well as enhanced services by integrating cutting edge IPv6 node and network mobility solutions. Among the key features of this deployment will be multihoming initiatives through the use of the current and emerging wireless access technologies. We review our progress of integrating existing testbeds and extensions covering campus and metropolitan areas with large spectrum of real end users, and discuss the conditions of creating this architecture","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891090","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}
引用次数: 12
Peer-to-Peer Scheduling System with Scalable Information Sharing Protocol 具有可扩展信息共享协议的点对点调度系统
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.85
Norihiro Umeda, H. Nakada, S. Matsuoka
{"title":"Peer-to-Peer Scheduling System with Scalable Information Sharing Protocol","authors":"Norihiro Umeda, H. Nakada, S. Matsuoka","doi":"10.1109/SAINT-W.2007.85","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.85","url":null,"abstract":"In traditional job scheduling systems for the grid, a single or a few machines handle information of all computing resources and scheduling tasks. This centralized approach is not scalable, since it introduces single point of failure and bottleneck. Some decentralized scheduling systems have been proposed to improve scalability. They avoid concentration of scheduling costs by broadcasting job execution requests in a peer-to-peer style. However, resource utilization tends to be low, because most of them are not aware of the dynamic states of computing resources before throwing execution requests. This paper introduces a decentralized scheduling system that improves resource utilization by using a Gossip-based multicast protocol. With this protocol, peers can gather information of each other efficiently and schedule jobs individually. The simulation shows that our system is scalable and it handles many jobs efficiently in large scale grid environments","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116160007","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
Bandwidth Adjustable DVTS on the Heterogeneous Internet Environments for Distance Learning 异构网络环境下宽带可调DVTS的远程学习
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.31
Yasuo Tsuchimoto, M. Awal, P. Saengudomlert, T. Sanguankotchakorn, K. Kanchanasut
{"title":"Bandwidth Adjustable DVTS on the Heterogeneous Internet Environments for Distance Learning","authors":"Yasuo Tsuchimoto, M. Awal, P. Saengudomlert, T. Sanguankotchakorn, K. Kanchanasut","doi":"10.1109/SAINT-W.2007.31","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.31","url":null,"abstract":"We propose a new schematic design for sending and receiving a digital video stream on the heterogeneous Internet environment such as a Gigabit Ethernet and a narrow bandwidth satellite link. On such network, a sender can send the full 30fps digital video stream, but not all sites can receive a full quality video. In our proposed scheme, a DVTS repeater named Dvrelay is introduced to reduce frame rate of a DVTS stream going through it. To receive site-aware quality of DVTS stream, Dvrelay can be set up at the nearest point to the receiver site and it can thin out frames to adjust the transmission rate for the narrow bandwidth environment. With this scheme, it is not necessary to modify DVTS sender and receiver. Therefore, it can apply to any DVTS environments and adjust traffic according to capacity of the network links available to recipients. Consequently, all sites in the Internet can receive the site-aware best quality of digital video stream. Then all sites in the Internet can receive the lecture with the quality of the digital video","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"508 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116170572","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
CHOP6: A DHT Routing Mechanism Considering Proximity 一种考虑邻近性的DHT路由机制
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.32
Shouta Morimoto, F. Teraoka
{"title":"CHOP6: A DHT Routing Mechanism Considering Proximity","authors":"Shouta Morimoto, F. Teraoka","doi":"10.1109/SAINT-W.2007.32","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.32","url":null,"abstract":"This paper proposes a DHT routing mechanism called CHOP6. CHOP6 takes proximity into account by using the properties of the IPv6 address format. CHOP6 introduces the 64-bit node ID, in which the lower part is the IPv6 global routing prefix. By examining the node ID, it is possible to roughly estimate the proximity to the node. Similar to Chord, CHOP6 uses the finger table. In CHOP6, the finger table entry holds more than one candidate nodes. When sending a query, the source node estimates the proximity to the candidate nodes by examining the node IDs if the RTT to the nodes is unknown. CHOP6 was implemented in Java on FreeBSD. The measured results showed that the time to get data in CHOP6 is less than that in Chord and the number of the messages necessary to maintain routing information in CHOP6 is also less than that in Chord","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125856751","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
Inferring Original Traffic Pattern from Sampled Flow Statistics 从抽样流量统计推断原始流量模式
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.51
Tatsuya Mori, R. Kawahara, N. Kamiyama, Shigeaki Harada
{"title":"Inferring Original Traffic Pattern from Sampled Flow Statistics","authors":"Tatsuya Mori, R. Kawahara, N. Kamiyama, Shigeaki Harada","doi":"10.1109/SAINT-W.2007.51","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.51","url":null,"abstract":"Packet sampling has become a practical and indispensable means to measure flow statistics. Recent studies have demonstrated that analyzing traffic patterns is crucial in detecting network anomalies. We may not be able to infer the original traffic patterns correctly from the sampled flow statistics because sampling process wipes out a lot of information about small flows, which play a vital role in determining the characteristics of traffic patterns. In this paper, we first show an example of how the sampling process wipes out the original statistics using measured data. Then, we show empirical examples indicating that the original traffic pattern cannot be inferred correctly even if we use a statistical inference method for incomplete data, i.e., the EM algorithm, for sampled flow statistics. Finally, we show that additional information about the original flow statistics, the number of unsampled flows, is helpful in tracking the change in original traffic patterns using sampled flow statistics","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127950703","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
Simple and Secure Authentication Escrow for Rights Trading Protocol 简单和安全的认证托管权利交易协议
2007 International Symposium on Applications and the Internet Workshops Pub Date : 2007-01-15 DOI: 10.1109/SAINT-W.2007.96
K. Hirota, N. Sonehara
{"title":"Simple and Secure Authentication Escrow for Rights Trading Protocol","authors":"K. Hirota, N. Sonehara","doi":"10.1109/SAINT-W.2007.96","DOIUrl":"https://doi.org/10.1109/SAINT-W.2007.96","url":null,"abstract":"Considering electronic rights trading, especially P2P trading of rights among users, high usability is necessary for protocols as well as strong safety. However, in some protocols, they need several synchronous bi-directional transactions to achieve strong safety, but it offers low usability. We propose a novel rights trading protocol which enables simple and secure authentication escrow with asynchronous two transactions. In our protocol, the authentication information of the owner is hidden into trade declaration with the identifier of the right and trading conditions like price the owner requires, and the declaration is dispersed into a pair of shares using polynomial function. These shares include all the information and anyone can reconstruct a part of trade declaration, but no one except rights manager and the owner himself can reconstruct the authentication information. In this paper we describe detailed outline of the protocol and discuss the safety and usability of it","PeriodicalId":254195,"journal":{"name":"2007 International Symposium on Applications and the Internet Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130015345","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
首页 上一页 下一页 尾页
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学术官方微信