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

The 11th IEEE International Conference on Networks, 2003. ICON2003.最新文献

筛选
英文 中文
Performance analysis of IEEE 802.11e enhanced distributed coordination function IEEE 802.11e增强分布式协调功能的性能分析
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266252
Yunli Chen, Qing-An Zeng, D. Agrawal
{"title":"Performance analysis of IEEE 802.11e enhanced distributed coordination function","authors":"Yunli Chen, Qing-An Zeng, D. Agrawal","doi":"10.1109/ICON.2003.1266252","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266252","url":null,"abstract":"The IEEE 802.11e working group aims to enhance the current 802.11 MAC to support the integrated data and voice (or video) communications. Till now a draft of the IEEE 802.11e EDCF has been proposed. In this paper, we evaluate the performance of the EDCF by dividing the traffic into two categories, namely real-time packets and non real-time packets, and use an analytical model to quantify the performance of both IFS priority and CW priority in the EDCF. We also propose a new priority scheme, which allows the user to continuously send real-time packets. We define the maximum number of real-time packets that a user can continuously send to get a good balance between the fairness and the priority. Our proposed scheme is shown to provide much better results than IEEE 802.11e EDCF.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695536","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}
引用次数: 16
Fast scoped rerouting for BGP BGP快速范围重路由
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266162
R. Bless, Götz Lichtwald, Markus Schmidt, M. Zitterbart
{"title":"Fast scoped rerouting for BGP","authors":"R. Bless, Götz Lichtwald, Markus Schmidt, M. Zitterbart","doi":"10.1109/ICON.2003.1266162","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266162","url":null,"abstract":"This paper presents an approach to improve inter-domain connectivity in the Internet. This novel concept deploys inter-domain routing functions on two different time scales. The innovative fast scoped rerouting approach operates on a fine granular time scale while regular BGP is used on a coarse granular time scale. The overall concept intends to provide fast recovery from failures and to reduce the amount of globally visible BGP update messages. It also provides an alternative path in case of failure. Thus, this novel approach improves the Internet's ability to derive a coherent view of its topology.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131158558","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
Contributory approaches to centralized key agreement in dynamic peer groups 动态对等组中集中密钥协议的贡献方法
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266223
A. Saxena, B. Soh
{"title":"Contributory approaches to centralized key agreement in dynamic peer groups","authors":"A. Saxena, B. Soh","doi":"10.1109/ICON.2003.1266223","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266223","url":null,"abstract":"This paper has two contributions. In the first part of this paper we propose a new approach to contributory key agreement in dynamic peer groups (DPG) using a central controller. Our approach has certain advantages over other centralized approaches because it can be extended to a distributed environment. We discuss ways to extend our approach to adapt to arbitrary network failures by segregating a large group into smaller subgroups. Since each subgroup still requires access to a central controller, in the second part of this paper, we present a protocol that can be used to adapt to arbitrary network failures that disable the central controller.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132695242","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
A cooperative immunization system for an untrusting Internet 一个合作免疫系统为不信任的互联网
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266224
K. Anagnostakis, M. Greenwald, S. Ioannidis, A. Keromytis, Dekai Li
{"title":"A cooperative immunization system for an untrusting Internet","authors":"K. Anagnostakis, M. Greenwald, S. Ioannidis, A. Keromytis, Dekai Li","doi":"10.1109/ICON.2003.1266224","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266224","url":null,"abstract":"Viruses and worms are one of the most common causes of security problems in computer systems today. Users attempt to protect machines from such attacks by using anti-virus programs and firewalls, with a mixed record of success at best. One of the main problems with these solutions is that they rely on manual configurations and human intervention, and may fail to react in time to defend against an attack. We present a cooperative immunization system that helps defend against these types of attacks. The nodes in our system cooperate and inform each other of ongoing attacks and the actions necessary to defend. To evaluate our proposal, we discuss a simple virus model and evaluate our system using simulation. Our measurements show that our algorithm is more effective against viruses and more robust against malicious participants in the immunization system.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677800","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}
引用次数: 75
Forwarding-loop-free configuration for IBGP networks IBGP网络的无转发环配置
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266163
Hassan Gobjuka
{"title":"Forwarding-loop-free configuration for IBGP networks","authors":"Hassan Gobjuka","doi":"10.1109/ICON.2003.1266163","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266163","url":null,"abstract":"We investigate the inter-cluster routing deflection and forwarding loops in IBGP networks. In more detail, we define and explore the two causes of deflection, and consecutively, forwarding loops which might happen due to IBGP cluster misconfiguration. We study the methods that can be used to remove forwarding loops, if detected. Unfortunately, we show that detecting forwarding loops in a given IBGP network configuration is NP-hard. However, we propose a simple heuristic algorithm with complexity of 0(2) to configure deflection- and loop-free IBGP network.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115511676","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
Rate-distortion comparisons between FEC and MDC based on Gilbert channel model 基于Gilbert信道模型的FEC和MDC的速率失真比较
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266239
M. Kim, W. Kleijn
{"title":"Rate-distortion comparisons between FEC and MDC based on Gilbert channel model","authors":"M. Kim, W. Kleijn","doi":"10.1109/ICON.2003.1266239","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266239","url":null,"abstract":"Abstracl-To facilitate real-time audio-visual communications thmugh the Internet, low-delay packet-loss recovery techniques, such as forward e m r c o m t i o n (FEC) aud multiple description coding WDC), can be used. Based on a 2-state Gilbert channel model, we compare the SNR performance of FEC with XOR operation (XOR-FEC), FEC with Reed-Solomon code WFEC), side distortion optimized MDC (SD-MDC), and channel optimized MDC (optMDC). If we know the channel condition by feedback thmugh the Real-Time Contml Pmtocol (RTCP), optMDC can adjust the ratio between central distortion and side distortion so that it works at the best operating point. From a ratedistortion viewpoint, optMDC gives the best performance both in the single-channel and two-independent-chel transmission cases via packet networks with burst loss nature. Multiple-channel transmission is preferred if independent channels can be established between connections.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115932385","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}
引用次数: 16
A note on an analytic model for slow start in TCP TCP慢启动分析模型的注解
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266200
D. Phillips, Jiankun Hu, B. Lloyd-Smith, R. Harris
{"title":"A note on an analytic model for slow start in TCP","authors":"D. Phillips, Jiankun Hu, B. Lloyd-Smith, R. Harris","doi":"10.1109/ICON.2003.1266200","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266200","url":null,"abstract":"Sikdar et al. [B. Sikdar et al., 2001] has provided a formula to model the window increase pattern given the mechanics of delayed acknowledgements. In this paper, we show that their sum formula significantly underestimates the iterated sum for rounds greater than seven. The approximation error grows exponentially. We also derive a more accurate sum formula whose approximation error is linearly bounded. We show that with use of the incorrect sum formula, cases arise where it is impossible to time out as the initial loss indication in slow start, which can have significant impact on TCP latency, assuming a correlated loss model. We show that our more accurate sum formula greatly reduces the number of cases showing this behaviour, further improving upon the accuracy of the model.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114809115","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
Fast IP lookup algorithms 快速IP查找算法
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266173
Jaeyong Lim, S. Rajasekaran
{"title":"Fast IP lookup algorithms","authors":"Jaeyong Lim, S. Rajasekaran","doi":"10.1109/ICON.2003.1266173","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266173","url":null,"abstract":"In this paper we present a fast algorithm for the problem of IP routing. In particular, the algorithm presented is for the problem of longest prefix matching. The new algorithm has an expected run time that is asymptotically better than those of existing algorithms. Experimental results are also encouraging. For a packet with a given destination IP address, the next hop the packet should take can be determined in an expected time of O(1+log (n/2/sup q/)), where n is the number of destination prefixes and q is an appropriate parameter. For instance, if q is chosen to be log n, then the expected search time is O(1). The memory requirement is only O(n).","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753838","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
Dealing with heterogeneity in a fully reliable multicast protocol 处理完全可靠组播协议中的异构性
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266191
M. Maimour, C. Pham
{"title":"Dealing with heterogeneity in a fully reliable multicast protocol","authors":"M. Maimour, C. Pham","doi":"10.1109/ICON.2003.1266191","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266191","url":null,"abstract":"Many of the proposed multicast congestion avoidance algorithms are single-rate where heterogeneity is accommodated by adjusting the transmission rate as a response to the worst receiver in the group. Due to the Internet heterogeneity, a single-rate congestion control affects the overall satisfaction of the receivers in a multicast session. In this paper, we propose a multi-rate replicated scheme where some receivers (instead of the source) are designated to perform data replication for other receivers with lower capacity. To be more scalable and to minimize the bandwidth consumption due to data replication, the partitioning algorithm is performed on-the-fly by the routers depending on the feedback they receive. Neither a prior estimation of the receivers capacity is necessary nor a complex computation is required to execute our partitioning algorithm.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125982347","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
Flexible route control for wireless multi-hop internet access 无线多跳互联网接入的灵活路由控制
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266274
T. Nakagawa, T. Yoshikawa, K. Ohta, S. Kurakake
{"title":"Flexible route control for wireless multi-hop internet access","authors":"T. Nakagawa, T. Yoshikawa, K. Ohta, S. Kurakake","doi":"10.1109/ICON.2003.1266274","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266274","url":null,"abstract":"Pervasive ad hoc networks are a promising approach to realize ubiquitous Internet access. If an end terminal is located outside of the coverage area of an infrastructure network, neighboring terminals may relay packets so that the packets can reach the infrastructure network. In order to meet the diverse QoS requirements of applications in such a mixture of an ad hoc network and an infrastructure network, we propose a cross-layer route control mechanism. The proposed mechanism allows dynamic change of the routing metric based on the requirements of applications running. We also propose a new routing metric called hybrid metric. I t takes into account both the optimality of ad hoc network configuration and the link quality of the connection between the ad hoc network and an infrastructure network to be connected. We confirmed by computer simulation that the hybrid metric is effective in improving throughput. The hybrid metric is added as a routing metric option for the proposed route control mechanism and improves route control flexibility.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129487160","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学术官方微信