Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications最新文献

筛选
英文 中文
On averaging for active queue management congestion avoidance 主动队列管理的平均拥塞避免
T. Ziegler
{"title":"On averaging for active queue management congestion avoidance","authors":"T. Ziegler","doi":"10.1109/ISCC.2002.1021775","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021775","url":null,"abstract":"This paper investigates the effect of queue averaging on RED's ability to avoid a bias against bursty traffic, to minimize queue size oscillation, and to optimize the distribution of packet drops over time in order to avoid global synchronization. We find that a small degree of averaging is best to optimize the performance metrics mentioned above and adapt an existing model how to set RED's queue weight parameter.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131010524","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}
引用次数: 15
Rethink the tradeoff between proportional controller and PI controller 重新考虑比例控制器和PI控制器之间的权衡
Miaohui Zhang, Jianping Wu, Chuang Lin, Ke Xu
{"title":"Rethink the tradeoff between proportional controller and PI controller","authors":"Miaohui Zhang, Jianping Wu, Chuang Lin, Ke Xu","doi":"10.1109/ISCC.2002.1021658","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021658","url":null,"abstract":"In this paper we rethink the tradeoff between proportional controller and PI controller in AQM (active queue management) algorithm design. With the introduction of integral factor, the steady state error in a proportional controller such as RED is eliminated. However the integral factor also slows down the response speed. We present a simple algorithm P/sup 2/I to solve this problem. P/sup 2/I combines the advantage of the proportional controller and the PI controller. The performance of P/sup 2/I is verified and compared with the PI controller using ns-2 simulations. P/sup 2/I is shown to respond much faster than the PI controller while retaining the merits of the PI controller. We also analyze the impact of the traffic pattern on the design and success of AQM.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115727070","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}
引用次数: 7
Fast topological design with simulated annealing for multicast networks 基于模拟退火的组播网络快速拓扑设计
T. Miyoshi, S. Shimizu, Y. Tanaka
{"title":"Fast topological design with simulated annealing for multicast networks","authors":"T. Miyoshi, S. Shimizu, Y. Tanaka","doi":"10.1109/ISCC.2002.1021788","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021788","url":null,"abstract":"This paper investigates topological designs for multicast networks using simulated annealing (SA) and proposes a new method for finding an effective initial solution to the problem of reducing the computational time of SA. Multicast communications can decrease network traffic due to branch connections. Accordingly, multicast services will be predominant in future traffic. Since the characteristics of multicast communications are quite different from those of unicast communications, it is necessary to find a suitable topology for future networks that accommodates both multicast and unicast services. Finding the optimal topology is generally known as an NP-hard problem, and so heuristic algorithms have been used in many cases. This paper optimizes the multicast network topology by simulated annealing, a well-known powerful heuristic. Even if SA were employed, however, more additional inventions would be required to compute and find the solution with the smallest possible number of iterations. Therefore, this paper proposes a method for finding an effective initial solution for SA. The results show that the computational time needed to reach the final solution becomes shorter if our proposed method is applied.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115169988","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
Survivable routing in WDM networks WDM网络中的生存性路由
Arunabha Sen, Bin Hao, B. Shen
{"title":"Survivable routing in WDM networks","authors":"Arunabha Sen, Bin Hao, B. Shen","doi":"10.1109/ISCC.2002.1021754","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021754","url":null,"abstract":"We consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains connected even after the failure of a physical link. In a previous paper Modiano et. al. (see Proc. IEEE INFOCOM'01, 2001) introduced the notion of survivable routing and established a necessary and sufficient condition for the existence survivable routes of a logical topology in a physical topology. In this paper we show that the problem of determining whether survivable routing is possible for a logical topology in a given physical topology is an NP-complete problem. Moreover we show that the problem remains NP-complete, even when the logical topology is restricted to be a ring with a specific ordering of the nodes.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"61 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116270961","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
An intruder tracing system based on a shadowing mechanism 基于阴影机制的入侵者跟踪系统
Heejin Jang, Sangwook Kim
{"title":"An intruder tracing system based on a shadowing mechanism","authors":"Heejin Jang, Sangwook Kim","doi":"10.1109/ISCC.2002.1021780","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021780","url":null,"abstract":"Since current Internet intruders conceal their real identity by distributed or disguised attacks, it is not easy to deal with intruders properly only with an ex post facto chase. Therefore, we need to trace the intruder in real time. Existing real-time intruder tracing systems have a spatial restriction. It is impossible to respond to an attack which is done out of the security domain. This paper proposes the shadowing mechanism, a new approach to real-time intruder tracing, minimizing the spatial limitation of the traceable domain. The real-time tracing supports prompt response to the intrusion, detection of target host and laundering hosts. It also enhances the possibility of intruder identification.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014252","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
Performance of group communication over ad-hoc networks ad-hoc网络上的组通信性能
M. Mosko, J. Garcia-Luna-Aceves
{"title":"Performance of group communication over ad-hoc networks","authors":"M. Mosko, J. Garcia-Luna-Aceves","doi":"10.1109/ISCC.2002.1021728","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021728","url":null,"abstract":"We study the performance of reliable and unreliable all-node broadcast over ad-hoc networks that use contention-based channel access. To obtain analytical results while preserving hidden-terminal and node clustering characteristics of ad-hoc networks, we introduce a novel differential-equation fluid model for information flow through a network of cluster trees, where a spanning tree joins groups of fully connected nodes. Through numerical analysis and simulations in GloMoSim, we show throughput, goodput, and loss rates for reliable and unreliable networks. For reliable broadcast, we also find NAK rates, NAK loss rates, and retransmission rates. We show that using end-to-end sequence numbers, which are common in reliable multicast, for NAK generation in ad-hoc networks creates substantial unnecessary traffic.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311149","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
A flexible scheme for on-line public-key certificate status updating and verification 一种灵活的在线公钥证书状态更新和验证方案
E. Faldella, M. Prandini
{"title":"A flexible scheme for on-line public-key certificate status updating and verification","authors":"E. Faldella, M. Prandini","doi":"10.1109/ISCC.2002.1021778","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021778","url":null,"abstract":"A new on-line method for efficient handling of certificates within public-key infrastructures (PKIs) is presented. The method is based on a purposely-conceived extension of the one-way accumulator (OWA) cryptographic primitive, which permits one to provide an explicit, concise, authenticated and not forgeable information about the revocation status of each certificate. A thorough investigation on the performance attainable shows that the devised method exhibits the same positive features of the well-known on-line certificate status protocol (OCSP) as regards scalability, security and timeliness. Moreover, its peculiar characteristic of collectively authentication via a single directory-signed proof the status of all the certificates handled within a PKI leads to a significant reduction of the directory computational load that, in a high-traffic context, could be nearly unbearable when OCSP is applied.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237343","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
UMTS-TDD: a solution for internetworking Bluetooth piconets in indoor environments UMTS-TDD:在室内环境中实现蓝牙微网互联的解决方案
M. Gerla, Yeng-Zhong Lee, R. Kapoor, T. Kwon, A. Zanella
{"title":"UMTS-TDD: a solution for internetworking Bluetooth piconets in indoor environments","authors":"M. Gerla, Yeng-Zhong Lee, R. Kapoor, T. Kwon, A. Zanella","doi":"10.1109/ISCC.2002.1021768","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021768","url":null,"abstract":"The standards that are supposed to play a leading role in third-generation mobile telecommunication and personal area networks in the near future are the Universal Mobile Telecommunication System (UMTS) and the Bluetooth (BT) radio technology, respectively. In this paper, we advocate that a hybrid architecture of UMTS and Bluetooth can take advantage of the complementary characteristics of these two technologies and provide a total solution for an indoor communication environment. We envision a cooperating scenario in which small Bluetooth networks (scatternets) offer basic wireless connectivity to several peripheral units scattered over small areas, while indoor UMTS supports communication among scatternets and provides wireless access to the Internet. We focus our analysis on a centralized topology, in which communication occurs only between the peripheral units and the access point. This topology can be used in many different application scenarios and represents an example of cooperation between 3G and PAN technologies. In addition to describing the architecture, we address the issue of fair capacity allocation in such a centralized topology and provide some analytic and simulation results for the topology considered.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794981","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}
引用次数: 15
Capacity provisioning and failure recovery in mesh-torus networks with application to satellite constellations 网格环面网络的容量配置与故障恢复及其在卫星星座中的应用
Jun Sun, E. Modiano
{"title":"Capacity provisioning and failure recovery in mesh-torus networks with application to satellite constellations","authors":"Jun Sun, E. Modiano","doi":"10.1109/ISCC.2002.1021661","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021661","url":null,"abstract":"This paper considers the link capacity requirement for a N/spl times/N mesh-torus network under a uniform all-to-all traffic model. Both primary capacity and spare capacity for recovering from link failures are examined. In both cases, we use a novel method of \"cuts on a graph\" to obtain lower bounds on capacity requirements and subsequently find algorithms for routing and failure recovery that meet these bounds. Finally, we quantify the benefits of path based restoration over that of link based restoration; specifically, we find that the spare capacity requirement for a link based restoration scheme is nearly N times that for a path based scheme.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917108","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
The performance of the TCP/RCWE enhancement for ad-hoc networks ad-hoc网络中TCP/RCWE增强的性能
M. Günes, Donald Vlahovic
{"title":"The performance of the TCP/RCWE enhancement for ad-hoc networks","authors":"M. Günes, Donald Vlahovic","doi":"10.1109/ISCC.2002.1021656","DOIUrl":"https://doi.org/10.1109/ISCC.2002.1021656","url":null,"abstract":"Mobile ad-hoc networks (MANET) enable the communication of mobile wireless nodes without any pre-defined infrastructure. Therefore, they are predestined for future mobile applications. To use existing applications and to inter-operate with the world wide Internet, ad-hoc networks have to use TCP/IP, which were not designed for mobile ad-hoc networks and yield poor performance when deployed in this kind of networks. The poor performance of TCP in ad-hoc networks has several reasons, especially the communication medium with high bit error rates (BER) and TCPs optimization on fixed networks. We present an enhancement, the restricted congestion window enlargement (TCP/RCWE), and show its ability to handle TCPs problems in mobile ad-hoc networks. We also illustrate the performance gain of TCP by the enhancement.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117156940","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
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学术官方微信