21st International Conference on Advanced Information Networking and Applications (AINA '07)最新文献

筛选
英文 中文
Markov Chain Model for Performance Analysis of Transmitter Power Control in Wireless MAC Protocol: Towards Delay Minimization in Power-network Control 无线MAC协议中发射机功率控制性能分析的马尔可夫链模型——面向电网控制中的时延最小化
M. Tahir, S. Mazumder
{"title":"Markov Chain Model for Performance Analysis of Transmitter Power Control in Wireless MAC Protocol: Towards Delay Minimization in Power-network Control","authors":"M. Tahir, S. Mazumder","doi":"10.1109/AINA.2007.88","DOIUrl":"https://doi.org/10.1109/AINA.2007.88","url":null,"abstract":"Delay, one of the most important parameters in the wireless control networks, is largely dependent on the packet length when using contention based medium access control (MAC) protocol in single hop networks. In this paper, we have developed a three-state discrete time Markov-chain based model for the performance evaluation of MAC protocol. Using this Markov-chain model, we analyze the carrier sense multiple access (CSMA) MAC protocol for its delay and throughput characteristics in the presence of transmitter power control. Using simulations, we measure the probability of capture (which gives a measure of the effectiveness of transmitter power control due to the capture effect.) and validate these simulated data experimentally. To analyze the effect of transmitter power variation, the Markov- chain model is modified by incorporating the probability of capture. Numerical results are obtained to measure the performance improvement.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134448067","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
SIP extensions to support (micro)payments 支持(微)支付的SIP扩展
A. Ruiz-Martínez, Juan A. Sánchez-Laguna, A. Gómez-Skarmeta
{"title":"SIP extensions to support (micro)payments","authors":"A. Ruiz-Martínez, Juan A. Sánchez-Laguna, A. Gómez-Skarmeta","doi":"10.1109/AINA.2007.128","DOIUrl":"https://doi.org/10.1109/AINA.2007.128","url":null,"abstract":"SIP is a protocol designed to create and manage multimedia sessions such as telephone calls over the Internet, distributed conferences, or, in general, every kind of communication between two or more peers. The introduction of payment in SIP is an interesting idea in order to charge for this media services. This payment services have been proposed in several scenarios such as charging for accessing to services, microbilling or as a solution to SPAM in VoIP systems. In this context, there is a proposal for making payments on SIP that is based on SAML. However, this proposal is not good enough to make low payments or micropayments because involves that the payment service provider participates in every payment. This implies that the transaction costs are high and therefore it is not suitable for this kind of payments. Additionally, this proposal only deals with the scenario in which the payment covers the whole session. Finally, this proposal does not take into account that streams with different quality could be used in the session, and therefore the amount to pay could be different. In response to these limitations we propose a new extension for supporting payments on SIP which, being payment-independent protocol, solves interoperability problems and links payment information to requests. For this purpose, we have extended both SDP and SIP to facilitate the access to SIP services based on payment. The extension supports an offer/answer model that allows the choice of the quality of the streams as well as the payment method to use. Furthermore, it is extensible and not only supports payment but also more complex business models such as loyalty models, credentials and subscriptions. Thus, we facilitate the incorporation of new payment methods and business models in the vendor's software. This paper describes this extension as well as some scenarios where it can be applied.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000348","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}
引用次数: 8
Stochastic Modeling and Analysis of GRED-I Congestion Control for Differentiated Bursty Traffic 差分突发交通GRED-I拥塞控制的随机建模与分析
Lan Wang, G. Min, I. Awan
{"title":"Stochastic Modeling and Analysis of GRED-I Congestion Control for Differentiated Bursty Traffic","authors":"Lan Wang, G. Min, I. Awan","doi":"10.1109/AINA.2007.132","DOIUrl":"https://doi.org/10.1109/AINA.2007.132","url":null,"abstract":"This paper develops an analytical performance model for a finite capacity queueing system with an enhanced random early detection (RED) congestion control scheme in the presence of differentiated classes of bursty traffic. The aggregate traffic is captured by the superposition of 2-state Markov modulated Poisson processes (MMPP). Two individual thresholds are assigned to each traffic class in order to differentially control traffic injection rate. The accuracy of this model is verified by comparing the analytical results against those obtained from simulation. The model is adopted to investigate the effects of traffic burstiness and system capacity on the performance of the congestion control scheme.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121420844","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}
引用次数: 8
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks 空间网络规则路径查询的网格感知评估
Zhuo Miao, D. Stefanescu, Alex Thomo
{"title":"Grid-Aware Evaluation of Regular Path Queries on Spatial Networks","authors":"Zhuo Miao, D. Stefanescu, Alex Thomo","doi":"10.1109/AINA.2007.75","DOIUrl":"https://doi.org/10.1109/AINA.2007.75","url":null,"abstract":"Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenient to use, RPQs are notorious for their high computational demand. In this paper, we present a grid- aware, fault tolerant distributed algorithm for answering RPQs on spatial networks. We engineer each part of the algorithm to account for the assumed computational-grid setting. We experimentally evaluate our algorithm, and show that for typical user queries, our algorithm satisfies the desiderata for distributed computing in general, and computational-grids in particular.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117302284","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
Implementing a Peer-to-Peer Web Browser for Publishing and Searching Web Pages on Internet 实现一种在Internet上发布和搜索网页的对等网络浏览器
H. B. Ribeiro, L. Lung, A. Santin, Neander Larsen Brisola
{"title":"Implementing a Peer-to-Peer Web Browser for Publishing and Searching Web Pages on Internet","authors":"H. B. Ribeiro, L. Lung, A. Santin, Neander Larsen Brisola","doi":"10.1109/AINA.2007.79","DOIUrl":"https://doi.org/10.1109/AINA.2007.79","url":null,"abstract":"This paper presents an implementation of a P2P Web browser, called Web2Peer', for publishing web pages on Internet through peer-to-peer networks. The present proposal overcomes the problems involving entities dependency and content availability, by the user side, changing the conventional way used to publish Web pages on Internet. The proposed solution allows anyone who has a computer connected to the Internet, even through domestic ADSL connection, to publish Web pages on their own machines. By using a peer-to-peer Web browser another mechanism for searching Web pages is offered based on DHT (Distributed Hash Tables). The user interface, provided by Web2Peer, carries all functions needed for creating, editing, publishing, searching, downloading and replicating the web pages on the peer-to-peer network.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114658111","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}
引用次数: 8
A Cost-Sensitive Model for Preemptive Intrusion Response Systems 先发制人式入侵响应系统的成本敏感模型
Natalia Stakhanova, Samik Basu, Johnny S. K. Wong
{"title":"A Cost-Sensitive Model for Preemptive Intrusion Response Systems","authors":"Natalia Stakhanova, Samik Basu, Johnny S. K. Wong","doi":"10.1109/AINA.2007.9","DOIUrl":"https://doi.org/10.1109/AINA.2007.9","url":null,"abstract":"The proliferation of complex and fast-spreading intrusions not only requires advances in intrusion detection mechanisms but also demands development of sophisticated and automated intrusion response systems. In this paper we present a novel cost-sensitive model for intrusion response that incorporates preemptive deployment of the response actions. Specifically, our technique relies on comparing the cost of deploying a response against the cost of damage caused by an \"'un-attended\" intrusion and decides to preemptively deploy a response with maximum benefit. Our technique further allows adaptation of responses to the changing environment through evaluation of success and failure of previously triggered responses. We demonstrate the advantages of the approach and evaluate it using a damage reduction metric.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442265","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}
引用次数: 98
Efficient Query Processing for Large XML Data in Distributed Environments 分布式环境下大型XML数据的高效查询处理
Hiroto Kurita, K. Hatano, Jun Miyazaki, Shunsuke Uemura
{"title":"Efficient Query Processing for Large XML Data in Distributed Environments","authors":"Hiroto Kurita, K. Hatano, Jun Miyazaki, Shunsuke Uemura","doi":"10.1109/AINA.2007.64","DOIUrl":"https://doi.org/10.1109/AINA.2007.64","url":null,"abstract":"We propose an efficient distributed query processing method for large XML data by partitioning and distributing XML data to multiple computation nodes. There are several steps involved in this method; however, we focused particularly on XML data partitioning and dynamic relocation of partitioned XML data in our research. Since the efficiency of query processing depends on both XML data size and its structure, these factors should be considered when XML data is partitioned. Each partitioned XML data is distributed to computation nodes so that the CPU load can be balanced. In addition, it is important to take account of the query workload among each of the computation nodes because it is closely related to the query processing cost in distributed environments. In case of load skew among computation nodes, partitioned XML data should be relocated to balance the CPU load. Thus, we implemented an algorithm for relocating partitioned XML data based on the CPU load of query processing. From our experiments, we found that there is a performance advantage in our approach for executing distributed query processing of large XML data.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"57 56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131422687","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}
引用次数: 29
Symbiotic Audio Communication on Interactive Transport 交互式传输中的共生音频通信
J. Khan, Olufunke I. Olaleye
{"title":"Symbiotic Audio Communication on Interactive Transport","authors":"J. Khan, Olufunke I. Olaleye","doi":"10.1109/AINA.2007.133","DOIUrl":"https://doi.org/10.1109/AINA.2007.133","url":null,"abstract":"Congestion control for compressed audio is a nontrivial pursuit. Audio perception is highly susceptible to disturbance in temporal quality. We recently proposed and implemented a novel symbiotic perceptual audio streaming mechanism, which receives fast feedback from network and responds to impending congestion with advanced auditory perception based adaptation techniques and supports near flawless sound. The design is based on recently proposed iTCP. It enables a new principle where encoder trade-off fidelity for accurate audio temporal quality using fast network event feedback. We have tested it live over the Internet. In this paper, we share the performance of this system and report observed improvements in time-bounded streaming audio.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130510786","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
Integrated TDM in Single-Hop Slotted All-Optical OPS Networks 单跳槽全光OPS网络中的集成TDM
A. Rahbar, O. Yang
{"title":"Integrated TDM in Single-Hop Slotted All-Optical OPS Networks","authors":"A. Rahbar, O. Yang","doi":"10.1109/AINA.2007.83","DOIUrl":"https://doi.org/10.1109/AINA.2007.83","url":null,"abstract":"We study and evaluate the performance of three potential candidates of resource-sharing algorithms in agile single-hop slotted buffer-less all-optical packet switched metro networks. Both reservation-based (centralized) and collision-based (distributed) schemes are considered. In the centralized scheme, all decisions are made at the core switch and loss can be avoided through reservations. On the other hand, decisions are made at the edge switches in the distributed scheme, and we need to retransmit the dropped traffic. We also implement an integrated architecture that combines the good attributes of both schemes and characterize this architecture by various measures such as delay and loss probabilities at the edge switches.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115011189","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
Uniformity and Efficiency of a Wireless Sensor Network's Coverage 无线传感器网络覆盖的均匀性和效率
Md. Ashiqur Rahman, S. Hussain
{"title":"Uniformity and Efficiency of a Wireless Sensor Network's Coverage","authors":"Md. Ashiqur Rahman, S. Hussain","doi":"10.1109/AINA.2007.144","DOIUrl":"https://doi.org/10.1109/AINA.2007.144","url":null,"abstract":"The primary contribution of this paper is in a wireless sensor network's coverage analysis method, which focuses on both the coverage itself and its uniformity and efficiency. Sensor death is typical in the life cycle of a wireless sensor network. Hence it is important to take note of what portion of the target region is monitored by the sensor network both initially and eventually. This paper proposes a useful wireless sensor networks' coverage analysis method, which not only focuses on the coverage itself, but also on its uniformity and efficiency. In the process, several questions such as whether the monitored region is uniformly distributed throughout the target region, or whether there are locations in the target region that are overmonitored, are answered. The paper also specifies for which type of applications the proposed coverage analysis method will be most suitable.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125708674","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
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学术官方微信