Proceedings. Eleventh International Conference on Computer Communications and Networks最新文献

筛选
英文 中文
Simulating convergence properties of BGP 模拟BGP收敛特性
Johan Nykvist, Lenka Carr-Motykova
{"title":"Simulating convergence properties of BGP","authors":"Johan Nykvist, Lenka Carr-Motykova","doi":"10.1109/ICCCN.2002.1043056","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043056","url":null,"abstract":"We present a simple BGP simulator that is used for testing convergence properties of inter-domain routing. The discrete-event driven simulator contains a high-level abstraction model of the BGP protocol. The purpose is to perform simulations to examine the complexity of routing information exchange and to test different possible reasons for delayed convergence of BGP routing. We have simulated effects of BGP timers on convergence and compared the results with simulations done by Labovitz and Griffin. Our simulator displayed the theoretically predicted characteristics. We then tested the effects of skewed timers, split horizon and the sender side loop detection (SSLD) techniques on convergence for different network topologies. We conclude that SSLD helps to decrease the number of announcements and the convergence time. However, SSLD increases the number of withdrawals.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128776939","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 dynamic programming approach for optimal scheduling policy in wireless networks 无线网络最优调度策略的动态规划方法
X. Hong, K. Sohraby
{"title":"A dynamic programming approach for optimal scheduling policy in wireless networks","authors":"X. Hong, K. Sohraby","doi":"10.1109/ICCCN.2002.1043120","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043120","url":null,"abstract":"We discuss scheduling policies in wireless networks with fading channels. A utility function that takes both the communication throughput and the transmission delay into account is defined. A dynamic programming optimization method is used to obtain the optimal scheduling policy which explores the channel dynamics and gets a reasonable trade-off between the communication throughput and the packet transmission delay. A near-optimal solution is also presented to deal with problems with large state space. Through simulation results, we show that our policy can improve the performance in both aspects of throughput and transmission delay, compared to the well-known weighted round-robin scheme which does not consider channel dynamics.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"49 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122789168","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
The lack of ethics in cyber space: a case for cyber ethics 网络空间伦理缺失:网络伦理案例
Enrique H. Fiallo
{"title":"The lack of ethics in cyber space: a case for cyber ethics","authors":"Enrique H. Fiallo","doi":"10.1109/ICCCN.2002.1043083","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043083","url":null,"abstract":"Summary form only given as follows. The cyber world has become a most important part of our everyday lives. We spend an increasingly significant portion of our lives in it and use it to communicate with friends, acquaintances, loved ones, and business associates. We make use of our computers and Internet connectivity to look for and purchase all kinds of goods and services. We make airline and other travel reservations through this medium we call the World Wide Web. We look through weather forecasts in planning our daily lives, including our recreation, travel activities and social functions. We use the web and all its powerful resources to educate ourselves and to gain knowledge. We are able to look for, join and keep up with special interest groups and to discuss topics of interest to us. We research serious as well as mundane issues on line. In summary, cyberspace has become an interactive world that many of us have fully integrated into our lives. There is dark side to this phenomenon. The ease and anonymity by which we are able to perform all and many more of these feats of contact and access with an entire universe of places and people has created a dilemma: a lack of cyber ethics. This issue threatens all of us and introduces a whole set of ethical and legal issues for business people, scientists, parents, educators, children and law makers.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122941155","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
Multi-layer optical network design based on clustering method 基于聚类方法的多层光网络设计
Passakon Prathombutr, E. Park
{"title":"Multi-layer optical network design based on clustering method","authors":"Passakon Prathombutr, E. Park","doi":"10.1109/ICCCN.2002.1043107","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043107","url":null,"abstract":"In our optical network design method, design of the logical topology is preceded by routing and wavelength assignment. The logical topology is a set of lightpaths formed to serve traffic demands. It must be flexible and robust for future changes or reconfiguration while also minimizing the cost and optimizing some objective functions. These features can be found in a multi-layer architecture. In an optical network, this architecture includes service layer, electrical layer and optical layer, where the optical layer serves as the backbone of the lower layers. Moreover, the equipment at optical nodes, such as optical cross connect (OXC), cannot serve all demands in the traffic demand matrix (e.g., the set of lightpaths is limited by the number of transmitters and receivers). Some nodes and lightpaths are preselected and form the optical network in the optical layer of the multi-layer architecture. We show an approach to multi-layer optical network design by analyzing the traffic demand matrix and physical topology in order to classify nodes into either optical layer or electrical layer using a clustering method and then design the logical topology to reach a certain limitation and objective function. Our multi-layer approach reduces the size of the optical network, resulting in lower cost of equipment and fewer constraints in the design. Besides, the clustering method provides a multivariate analysis to cluster the data by combination of network node characteristics, and can be extended to the financial cost of equipment, location data or even policy data.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131284891","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
A self-correcting neighbor protocol for mobile ad-hoc wireless networks 一种用于移动自组织无线网络的自校正邻居协议
M. Mosko, J. Garcia-Luna-Aceves
{"title":"A self-correcting neighbor protocol for mobile ad-hoc wireless networks","authors":"M. Mosko, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2002.1043124","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043124","url":null,"abstract":"Mobile wireless ad-hoc networks lack some basic abilities taken for granted in wired networks, such as the ability to know adjacent nodes. We present a neighbor discovery protocol, with particular application to broadcast flooding. The neighbor exchange protocol (NXP) has two main improvements over simple periodic broadcast schemes: (1) it only sends Hello packets when necessary to maintain topology and (2) uses sequence numbers in redistributed information to aid in convergence. In simulation, we compare NXP to a periodic protocol and simple flooding for all-node packet broadcasts and two dissemination techniques. We show that we maintain similar delivery rates while using fewer control packets in most configurations.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134403020","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 software framework for non-repudiation service in electronic commerce based on the Internet 基于Internet的电子商务中不可否认服务的软件框架
S. Tak, Yugyung Lee, E. Park
{"title":"A software framework for non-repudiation service in electronic commerce based on the Internet","authors":"S. Tak, Yugyung Lee, E. Park","doi":"10.1109/ICCCN.2002.1043064","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043064","url":null,"abstract":"We propose a software framework for non-repudiation service in e-commerce (electronic commerce) on the Internet. The proposed software framework is an explicit security framework for notary service. In the framework we propose a systematic design methodology that provides a security class concept. Our framework can be differentiated from others. First, unlike other frameworks, it is interested in a successful completion of e-commerce transactions by supporting non-repudiation of service. Second, the proposed framework is based on dynamic adaptive mechanism that improves the performance of e-commerce transactions.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124468658","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
Load balancing heuristics for dynamic establishment of restorable lightpaths 动态建立可恢复光路的负载平衡启发式算法
Haibo Luo, L. Ruan
{"title":"Load balancing heuristics for dynamic establishment of restorable lightpaths","authors":"Haibo Luo, L. Ruan","doi":"10.1109/ICCCN.2002.1043108","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043108","url":null,"abstract":"Efficient lightpath provisioning for dynamic traffic is an important issue in WDM optical networks. Meanwhile, in order for a lightpath to survive a network failure, both a primary lightpath and a backup lightpath need to be found for each demand. A demand is blocked if either cannot be provided. We identify 2 blocking types, and then three heuristic ideas are proposed to exploit the wavelength usage information and to use link channels more evenly across the network, leading to a lower blocking probability. Simulation shows that the load balancing routing algorithm (LBA), with our heuristic cost functions for primary path selection and backup path selection, achieves performance comparable to that of the centralized algorithm (CA). However, LBA asks for much less information to be disseminated, and therefore is more scalable.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123669699","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}
引用次数: 18
An efficient scheme to remove crawler traffic from the Internet 一个有效的方案,以消除爬虫流量从互联网
Xiaoqin Yuan, M. MacGregor, J. Harms
{"title":"An efficient scheme to remove crawler traffic from the Internet","authors":"Xiaoqin Yuan, M. MacGregor, J. Harms","doi":"10.1109/ICCCN.2002.1043051","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043051","url":null,"abstract":"We estimate that approximately 40% of current Internet traffic is due to Web crawlers retrieving pages for indexing. We address this problem by introducing an efficient indexing system based on active networks. Our approach employs strategically placed active routers that constantly monitor passing Internet traffic, analyze it, and then transmit the index data to a dedicated back-end repository. Our simulations have shown that active indexing is up to 30% more efficient than the current crawler-based techniques.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122544740","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}
引用次数: 24
MobileGrid: capacity-aware topology control in mobile ad hoc networks 移动网格:移动自组织网络中的容量感知拓扑控制
Jilei Liu, Baochun Li
{"title":"MobileGrid: capacity-aware topology control in mobile ad hoc networks","authors":"Jilei Liu, Baochun Li","doi":"10.1109/ICCCN.2002.1043127","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043127","url":null,"abstract":"Since wireless mobile ad hoc networks are arbitrarily and dynamically deployed, the network performance may be affected by many unpredictable factors such as the total number of nodes, physical area of deployment, and transmission range on each node. Previous research results only focus on maximizing power efficiency through dynamically adjusting the transmission range on each node. Via extensive performance evaluations, we have observed that the network performance is linked with a single parameter, the network contention index, which each node may estimate in a fully distributed fashion. This paper introduces the definition of such a parameter, which is derived from relevant parameters such as the number of nodes and the transmission range on each node. With the presence of node mobility, we present a detailed study of the effects of contention index on the network performance, with respect to network capacity and power efficiency. We have observed that the capacity is a concave function of the contention index. We further show that the impact of node mobility is minimal on the network performance when the contention index is high. Based on these important observations, we present MobileGrid, a fully distributed topology control algorithm that attempts to achieve the best possible network capacity, by maintaining optimal contention index via dynamically adjusting the transmission range on each of the nodes in the network.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131922","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}
引用次数: 70
Content routing with network support using passive measurement in content distribution networks 在内容分发网络中使用被动测量的网络支持的内容路由
H. Miura, M. Yamamoto
{"title":"Content routing with network support using passive measurement in content distribution networks","authors":"H. Miura, M. Yamamoto","doi":"10.1109/ICCCN.2002.1043052","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043052","url":null,"abstract":"In content distribution networks(CDNs), the content routing which directs user requests to an adequate server from the viewpoint of improvement of latency for obtaining contents is one of the most important technical issues. Several information, e.g. server load or network delay, can be used for content routing. Network support, e.g. active network, enables a router to select an adequate server by using these information. We investigate a server selection policy of a network support approach from the viewpoint of which information to be used for effective server selection. We propose a server selection policy using RTT information measured at a router. Simulation results show that our proposed server selection policy in content routing selects a good server under both conditions where server latency and network delay is a dominant element of user response time. Furthermore, we also investigate the location of routers with network support bringing good performance for our proposed scheme.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163071","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
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学术官方微信