2009 Ninth Annual International Symposium on Applications and the Internet最新文献

筛选
英文 中文
A Traffic Monitoring Method for High Speed Networks 一种高速网络流量监控方法
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.25
Y. Shomura, Yoshinori Watanabe, N. Ikeda
{"title":"A Traffic Monitoring Method for High Speed Networks","authors":"Y. Shomura, Yoshinori Watanabe, N. Ikeda","doi":"10.1109/SAINT.2009.25","DOIUrl":"https://doi.org/10.1109/SAINT.2009.25","url":null,"abstract":"Abnormal traffic that causes various problems on the Internet, such as P2P flows, DDoS attacks, and Internet worms, is increasing; therefore, the importance of methods that identify and control abnormal traffic is also increasing. Though the application of frequent-itemset-mining techniques is a promising way to analyze Internet traffic, the huge amount of data on the Internet prevents such techniques from being effective. The limitation of DRAM memory access speed makes this problem further difficult. To overcome this problem, we have developed a simple frequent-itemset-mining method that uses only a small amount of memory but is effective even with the large volumes of data associated with broadband Internet traffic. We show that our method can analyze host's behavior and find P2P software, spams, and scans in Internet traffic. In this paper, a hash-based packet aggregation method and a multi-thread cardinality analysis method are proposed to achieve real-time analyzing ability for 13-Gbps networks.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114645079","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
Path Selection Metrics for Performance-Improved Onion Routing 性能改进洋葱路由的路径选择指标
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.26
A. Panchenko, J. Renner
{"title":"Path Selection Metrics for Performance-Improved Onion Routing","authors":"A. Panchenko, J. Renner","doi":"10.1109/SAINT.2009.26","DOIUrl":"https://doi.org/10.1109/SAINT.2009.26","url":null,"abstract":"Providing anonymity for users on the Internet is a very challenging and difficult task. Currently there are only a few systems that are of practical relevance for the provision of low-latency anonymity. One of the most important to mention is Tor which is based on onion routing. Practical client usage of Tor often leads to delays that are not tolerated by the average end-user, which, in return, discourages many of them from using the system. In this paper we propose new methods of path selection that allow performance-improved onion routing. These are based on actively measured latencies and estimations of available link-wise capacities using passive observations of throughput. We evaluate the proposed methods in the public Tor network and present a practical approach to empirically analyze the strength of anonymity certain methods of path selection provide in comparison to each other.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123014664","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}
引用次数: 36
Proposal of an Initial Route Establishment Method in Wireless Mesh Networks 一种无线网状网络初始路由建立方法的提出
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.42
Kazunori Ueda, K. Baba
{"title":"Proposal of an Initial Route Establishment Method in Wireless Mesh Networks","authors":"Kazunori Ueda, K. Baba","doi":"10.1109/SAINT.2009.42","DOIUrl":"https://doi.org/10.1109/SAINT.2009.42","url":null,"abstract":"Hybrid wireless mesh protocol (HWMP) is consists of on demand routing protocol RM-AODV and pro-active routing based on tree-base routing. When a mesh portal exists as a gateway of a wireless mesh network, tree-based routing is very efficient in fixed mesh deployments. However, with the distance vector routing method, all mesh points need route metrics based on the network topology and many packets are consumed to build the topology. To solve these problems, we define a new address space based on the link state and propose an initial route establishment method with greedy forwarding by using addresses as positional information. From simulations results, we confirmed that the proposed routing method can build the routing topology before the entire wireless mesh network is constructed and reduce the number of control packets for routing, and it also has scalability.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129178597","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}
引用次数: 9
An Infocard-Based Proposal for Unified Single Sign on 基于infcard的统一单点登录方案
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.54
Enrique de la Hoz, Antonio García, Ivan Marsá-Maestre, Miguel A. López-Carmona, B. Alarcos
{"title":"An Infocard-Based Proposal for Unified Single Sign on","authors":"Enrique de la Hoz, Antonio García, Ivan Marsá-Maestre, Miguel A. López-Carmona, B. Alarcos","doi":"10.1109/SAINT.2009.54","DOIUrl":"https://doi.org/10.1109/SAINT.2009.54","url":null,"abstract":"During last years, service federation has been a hot topic for researchers all along the world. In that context, single sign on (SSO) access to services has risen as a major concern for this kind of environments and many proposals suited to several scenarios have been stated. We can think of eduroam an eduGAIN as two major examples of this, the former as a federated initiative to provide access to network and the latter as a confederated proposal to provide secure access to web (and non-web as grid) resources. Given that both architectures usually are deployed in a common security domain, it could be interesting to explore ways to bring both worlds together, that is, to find a way to get access as we get access to the network services. Currently, there are two disjoint actions: first get access to network, with its own authentication process, and second get access to other resources through eduGAIN. The process could be greatly simplified if a way is devised to unify both accesses what has been called unified Single Sing On (uSSO). In this work, we propose a novel framework to provide uSSO in that environment with minor modifications to existing deployments employing Infocard Technology.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115880262","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
Congestion Propagation in Multihop Wireless Networks 多跳无线网络中的拥塞传播
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.74
Yoichi Yamasaki, H. Koga, Y. Fukuda, M. Shimamura, Y. Oie
{"title":"Congestion Propagation in Multihop Wireless Networks","authors":"Yoichi Yamasaki, H. Koga, Y. Fukuda, M. Shimamura, Y. Oie","doi":"10.1109/SAINT.2009.74","DOIUrl":"https://doi.org/10.1109/SAINT.2009.74","url":null,"abstract":"Multihop Wireless Networks (MWNs) are expected to expand the area of wireless access networks, which consist of multiple access points in the area of a wireless LAN and connect these access points with wireless links. However, the MWNs still have many issues to provide good quality of service. For example, it is not clear about traffic characteristics over the MWNs. In this paper, therefore, we investigate the characteristics of MWNs based on the congestion propagation between wireless routers reported in wired networks.Furthermore, we show the impact of the congestion propagation on the network performance in various network parameters by means of simulations.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132479920","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}
引用次数: 1
Anshin as Emotional Trust: A Comparison Study between U.S. and Japanese Non-computer-science Students 安信作为情感信任:美国与日本非计算机专业学生的比较研究
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.32
Y. Murayama, Yasuhiro Fujihara, Dai Nishioka, C. Hauser, Atushi Inoue
{"title":"Anshin as Emotional Trust: A Comparison Study between U.S. and Japanese Non-computer-science Students","authors":"Y. Murayama, Yasuhiro Fujihara, Dai Nishioka, C. Hauser, Atushi Inoue","doi":"10.1109/SAINT.2009.32","DOIUrl":"https://doi.org/10.1109/SAINT.2009.32","url":null,"abstract":"Traditional research on security and safety has been based on the assumption that a user feels secure and safe when using objectively secure and safe systems and services. In this research we investigate users’ subjective sense of security, which we call Anshin in Japanese. This paper reports our empirical comparison of factors contributing to non-computer-science students’ sense of security between the US and Japan based on a questionnaire survey. Using exploratory factor analysis (EFA) we identified two common factors contributing to the sense of security for students in Japan and the US: cognitive trust in terms of the integrity and competence of the service providers, and user interface usability of the systems and services. The EFA also identified two additional, different, factors in each of the populations. The third factor with US students is Cognitive Trust in terms of competence of the systems and services and the feeling of benevolence about systems and service without any reason, whereas with Japanese students it is the users’ assessment of risks. US students have knowledge as the fourth factor whereas the students in Japan have experience as the fourth factor.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115393531","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
Using Call Patterns to Detect Unwanted Communication Callers 使用呼叫模式检测不需要的通信调用者
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.19
T. Kusumoto, E. Chen, M. Itoh
{"title":"Using Call Patterns to Detect Unwanted Communication Callers","authors":"T. Kusumoto, E. Chen, M. Itoh","doi":"10.1109/SAINT.2009.19","DOIUrl":"https://doi.org/10.1109/SAINT.2009.19","url":null,"abstract":"Unwanted communications such as SPIT (SPam over Internet Telephony) and number harvesting are expected to become serious problems as the use of VoIP (Voice over Internet Protocol) grows. Having call rates that are approaching zero, VoIP is becoming an attractive alternative media for delivering spam. Existing solutions to detect unwanted communications have problems, such as the requirement of modifying the SIP (Session Initiation Protocol) server, significant inconvenience to users, and the possibility of the unwanted communication avoiding detection. We propose a novel detection method using call pattern analysis. We express call patterns with parameters such as user relationships, average call duration, and the rate of unsuccessful calls.The proposed method does not require any SIP server modification and can be deployed in a non-intrusive manner to users. Furthermore, we have made detection avoidance difficult for malicious users. We also describe in detail an evaluation of our proposed method and comparative methods and the favorable results we have obtained in various experiment scenarios.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115083798","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}
引用次数: 22
Managing Trusted Keys in Internet-Scale Systems 管理互联网规模系统中的可信密钥
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.38
E. Osterweil, D. Massey, Lixia Zhang
{"title":"Managing Trusted Keys in Internet-Scale Systems","authors":"E. Osterweil, D. Massey, Lixia Zhang","doi":"10.1109/SAINT.2009.38","DOIUrl":"https://doi.org/10.1109/SAINT.2009.38","url":null,"abstract":"In this paper we examine open issues in deploying cryptographic protections for Internet scale systems, and explore a new direction dubbed Public Space to address the challenge of distributing and maintaining trusted keys.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130600127","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}
引用次数: 10
A Bloom Filter-Based User Search Method Based on Movement Records for P2P Network 基于Bloom过滤器的P2P网络移动记录用户搜索方法
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.41
T. Shiraki, Y. Teranishi, Susumu Takeuchi, K. Harumoto, S. Nishio
{"title":"A Bloom Filter-Based User Search Method Based on Movement Records for P2P Network","authors":"T. Shiraki, Y. Teranishi, Susumu Takeuchi, K. Harumoto, S. Nishio","doi":"10.1109/SAINT.2009.41","DOIUrl":"https://doi.org/10.1109/SAINT.2009.41","url":null,"abstract":"In this paper, we propose a P2P user search method based on movement records that can be automatically obtained by location detection devices. We assume movement records are treated as a sequence of pairs of spot-ID and time and they are stored in a peer for each user. In our proposal, a Bloom Filter is applied to each spotID and time to combine all movement records for one user as a fixed length bit array. To search a user who followed specified course, we propose a AND/OR search method based on Bloom Finger Table (BFT), which extends a routing table of a Chord DHT system to retrieve elements using Bloom Filter. By this method, user searches based on a sequence of locations with or without time can be realized efficiently. Additionally, in order to reduce the number of messages for a user search, we propose a peer-ID assignment for BFT based on user's geographical foothold. The number of messages for a user search can be reduced by this peer-ID assignment since users who visit same places are located closer to each other on the routing table. Evaluation results of simulations show that our proposal reduces the number of messages compared to a naive implementation using existing P2P retrieval method.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"803 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123289066","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
Information Sharing System for Maintenance of Sewage Facilities 污水设施维修信息共享系统
2009 Ninth Annual International Symposium on Applications and the Internet Pub Date : 2009-07-20 DOI: 10.1109/SAINT.2009.48
T. Okamoto
{"title":"Information Sharing System for Maintenance of Sewage Facilities","authors":"T. Okamoto","doi":"10.1109/SAINT.2009.48","DOIUrl":"https://doi.org/10.1109/SAINT.2009.48","url":null,"abstract":"There are many cases which entrust the operation and maintenance of public facilities to private sectors or organizations in recent years. The main purpose of the consignment is cost reduction. The sewage facilities are the representatives of such consignment. Although such consignment lowers expense in the short term by reduction of labor cost, there would be a risk of increasing expense of the public service from a long-term viewpoint. That is, this comprehensive private consignment has an agency problem. This paper points out the effectiveness of information sharing systems for improving asymmetry of information, and the necessity for standardization of information and widening the area. This paper proposed the one direction of the systems, that is, utilizing Web2.0 technologies.","PeriodicalId":413160,"journal":{"name":"2009 Ninth Annual International Symposium on Applications and the Internet","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126255947","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学术官方微信
小红书