Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献

筛选
英文 中文
Improving H.264 video transmission in 802.11e EDCA 改进802.11e EDCA中H.264视频传输
A. Ksentini, A. Guéroui, M. Naimi
{"title":"Improving H.264 video transmission in 802.11e EDCA","authors":"A. Ksentini, A. Guéroui, M. Naimi","doi":"10.1109/ICCCN.2005.1523891","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523891","url":null,"abstract":"Multimedia streaming over wired network, such as the Internet, has been popular now for quite some time. Further, as the bandwidth of wireless technologies have increased, consideration has only recently turned to delivering video over wireless networks. Meanwhile, an emerging new video compression standard namely H.264 is widely accepted. The H.264 standard outperforms all previous video compression, and can deliver high video quality at low rate. However, due to wireless channel characteristics, it is insufficient to merely deliver video data; instead delivery must consider also an adaptation of the video data to the networks specific and particularly network friendliness. In this paper, we address H.264 wireless video transmission over IEEE 802.11 wireless LAN by proposing a robust cross layer architecture which exploits: (i) the new standard IEEE 802.11e MAC protocol; (ii) the H.264 error resilience tools, namely data partitioning. The performances of the proposed architecture are extensively investigated by simulations. Results obtained indicate that our architecture can reliably transport the H.264 video stream, while the actual IEEE 802.11 standard in the same conditions, degrades considerably the transmitted video.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114723845","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}
引用次数: 14
A localization algorithm with learning-based distances 一种基于学习距离的定位算法
DuyBach Bui, Daeyoung Kim
{"title":"A localization algorithm with learning-based distances","authors":"DuyBach Bui, Daeyoung Kim","doi":"10.1109/ICCCN.2005.1523940","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523940","url":null,"abstract":"Existing range-based localization algorithms are superior only when a high accuracy node-to-node measured distance exists. This assumption is actually difficult to satisfy with current ranging techniques used in tiny sensor nodes. Meanwhile, range-free localization algorithms work independently of ranging error but can only produce limited node accuracy. In this paper, we propose a novel localization scheme that uses a learning-based distance function to estimate distances. The adaptation of distance function to ranging error and other network conditions, i.e., network density, number of anchor, results in better estimated distances. This leads to more accurate position calculation comparing to existing works, especially when ranging error is high.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129407793","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
A VoIP emergency services architecture and prototype VoIP紧急服务架构和原型
Matthew Mintz-Habib, A. Rawat, H. Schulzrinne, Xiaotao Wu
{"title":"A VoIP emergency services architecture and prototype","authors":"Matthew Mintz-Habib, A. Rawat, H. Schulzrinne, Xiaotao Wu","doi":"10.1109/ICCCN.2005.1523929","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523929","url":null,"abstract":"Providing emergency services in VoIP networks are vital to the success of VoIP. It not only presents design and implementation challenges, but also gives an opportunity to enhance the existing emergency call handling infrastructure. We propose an architecture to deliver emergency services in SIP-based VoIP networks, which can accommodate PSTN calls through PSTN to SIP gateways. Our architecture addresses the issues of identifying emergency calls, determining callers' locations, routing emergency calls to appropriate public safety answering points (PSAPs), and presenting required information to emergency call takers. We have developed a prototype implementation to prove our architecture's feasibility and scalability. We expect to undertake a pilot project at a working PSAP with our implementation once it is thoroughly tested.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129416252","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}
引用次数: 21
CA-RTO: a contention-adaptive retransmission timeout CA-RTO:竞争自适应重传超时
I. Psaras, V. Tsaoussidis, L. Mamatas
{"title":"CA-RTO: a contention-adaptive retransmission timeout","authors":"I. Psaras, V. Tsaoussidis, L. Mamatas","doi":"10.1109/ICCCN.2005.1523838","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523838","url":null,"abstract":"We show that TCP timers, based solely on RTT estimations and measurements, cannot capture with precision the level of flow contention. We notice that increased contention may stabilize RTT variation, minimize the deviation and, in turn, shorten the timeout. We show that this behavior is undesirable indeed, since it leads to unfair resource utilization. We propose CA-RTO, an algorithm that incorporates a contention parameter and a randomization technique into the retransmission timeout. We report significant improvement in fairness, great reduction of retransmitted packets and slight improvements in application goodput.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115812555","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
Real-time video over wireless ad-hoc networks 实时视频通过无线自组织网络
J. Karlsson, Haibo Li, J. Eriksson
{"title":"Real-time video over wireless ad-hoc networks","authors":"J. Karlsson, Haibo Li, J. Eriksson","doi":"10.1109/ICCCN.2005.1523953","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523953","url":null,"abstract":"In this paper we investigate important issue for real-time video over wireless ad-hoc networks on different layers. Many error control methods for this approach use multiple streams and multipath routing. Thus the new proactive, link-state routing protocol have been developed, where the protocol finds the available route in the network and also it will not cause any interruption in the video traffic between the source and the destination. The open source MPEG-4 is also implemented to get the efficient video quality for the picture.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131957669","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}
引用次数: 26
Web services management and selection: applied performance mechanisms Web服务管理和选择:应用的性能机制
Ruth G. Lennon, John Murphy
{"title":"Web services management and selection: applied performance mechanisms","authors":"Ruth G. Lennon, John Murphy","doi":"10.1109/ICCCN.2005.1523952","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523952","url":null,"abstract":"Research to date on composite Web services (CWS) has focused on selection of servers and precedence between requests as opposed to the requirements of the clients. This paper proposes that CWSs should have greater emphasis on both the individual customer requirements and the resultant impact on the performance of the overall system. The system described here employs the use of Web service level agreements and hard-and-soft criteria to develop an efficient Web service manager.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134104279","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
Packet delay estimation for ad hoc networks 自组织网络的包延迟估计
Heberto del Rio, D. Sarkar, Luisa D. Stelling
{"title":"Packet delay estimation for ad hoc networks","authors":"Heberto del Rio, D. Sarkar, Luisa D. Stelling","doi":"10.1109/ICCCN.2005.1523870","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523870","url":null,"abstract":"Network throughput and end-to-end delay time are two important parameters in the design and the evaluation of routing protocols for wireless ad hoc networks. Network throughput and routing protocols have been studied for some time. To be able to estimate the end-to-end delay time, the process induced by the random position of every node has to be known, that is, a mobility model for the nodes has to be specified. It has been proved that if a mobility model for the nodes is based on a Brownian motion on a flat 2-torus the expected end-to-end delay time has logarithmic growth. In this paper we propose a different, although related, mobility model for the nodes based on a discrete-time Markov chain on a flat 2-torus: a standard symmetric random walk. We prove that under this mobility model the end-to-end delay time of a wireless ad hoc network with k user is /spl otimes/(klogk).","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505079","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
On the effect of router buffer sizes on low-rate denial of service attacks 路由器缓冲区大小对低速率拒绝服务攻击的影响
S. Sarat, A. Terzis
{"title":"On the effect of router buffer sizes on low-rate denial of service attacks","authors":"S. Sarat, A. Terzis","doi":"10.1109/ICCCN.2005.1523867","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523867","url":null,"abstract":"Router queues buffer packets during congestion epochs. A recent result by Appenzeller et al. showed that the size of FIFO queues can be reduced considerably without sacrificing utilization. While Appenzeller showed that link utilization is not affected, the impact of this reduction on other aspects of queue management such as fairness, is unclear. Recently, a new class of low-rate DoS attacks called shrews was shown to throttle TCP connections by causing periodic packet drops. Unfortunately, smaller buffer sizes make shrew attacks more effective and harder to detect since shrews need to overflow a smaller buffer to cause drops. In this paper, we investigate the relation between buffer size and the shrew sending rate required to cause damage. Using a simple mathematical model, we show that a relatively small increase in the buffer size over the value proposed by Appenzeller is sufficient to render the shrew attack ineffective. Intuitively, bigger buffers require the shrews to transmit at much higher rates to fill the router queue. However, by doing so, shrews are no longer low-rate attacks and can be detected by active queue management (AQM) techniques such as RED-PD. We verified our analysis through simulations showing that a moderate increase in the buffer size, coupled with an AQM mechanism is adequate to achieve high link utilization while protecting TCP flows from shrew attacks.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129306535","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}
引用次数: 49
Design and analysis of connected dominating set formation for topology control in wireless ad hoc networks 无线自组网拓扑控制中连通支配集的设计与分析
B. Han, W. Jia
{"title":"Design and analysis of connected dominating set formation for topology control in wireless ad hoc networks","authors":"B. Han, W. Jia","doi":"10.1109/ICCCN.2005.1523797","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523797","url":null,"abstract":"To efficiently manage ad hoc networks, this paper proposes a novel distributed algorithm for connected dominating set (CDS) formation in wireless ad hoc networks with time and message complexity O(n). This Area algorithm partitions the nodes into different areas and selectively connects two dominators that are two or three hops away. Compared with previous well-known algorithms, we confirm the effectiveness of this algorithm through analysis and comprehensive simulation study. The number of nodes in the CDS formed by this Area algorithm is up to around 55% less than that constructed by others.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115180072","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}
引用次数: 11
A handover management scheme for mobile IPv6 networks 一种移动IPv6网络的切换管理方案
A. Hossain, K. Kanchanasut
{"title":"A handover management scheme for mobile IPv6 networks","authors":"A. Hossain, K. Kanchanasut","doi":"10.1109/ICCCN.2005.1523805","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523805","url":null,"abstract":"Mobile IPv6 provides IP layer mobility management for IPv6 networks. Despite many advantages it offers in comparison to Mobile IPv4, handover management still remains an issue for Mobile IPv6. For real-time connections, the handover latency and signaling overhead incurred by the protocol may become significant. This paper presents a new method named crossover MAP based hierarchical mobile IPv6 (XMAP-HMIPv6), which inherits the advantage of hierarchical mobile IPv6 of reducing signaling load for inter-domain mobility and incorporates an analytical model for the performance analysis of this new scheme along with other existing handover management proposals. Finally, we present analytical results in different environments and compare our scheme with other existing proposals. The analytical model results show that, our scheme performs almost similar to [F+H] MIPv6 in terms of reducing handover latency and outperforms both HMIPv6 and MIPv6.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116445368","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
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学术官方微信