Proceedings. Eleventh International Conference on Computer Communications and Networks最新文献_第3页

An intelligent multicast protocol for satellite-terrestrial broadband network 卫星-地面宽带网络智能组播协议

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043058

Chao-Hsu Chang, E. Wu

{"title":"An intelligent multicast protocol for satellite-terrestrial broadband network","authors":"Chao-Hsu Chang, E. Wu","doi":"10.1109/ICCCN.2002.1043058","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043058","url":null,"abstract":"Multimedia applications have been desirable and attract a rapidly increasing number of network subscribers. However, their generated enormous amount of Internet traffic usually congests the network to cause the degradation of network utilization. Although multicast provides an efficient way for distributing multimedia information to a set of destinations simultaneously, the congestion still degrades the desired QoS (quality of service) of the on-going multicast connections especially if the group of multicast destinations is large and scattered. Hence, this paper proposes a novel adaptive multicast routing (AMRST) approach for satellite-terrestrial network (ST network) to provide reliable and adaptive multicast services to global subscribers. This approach decomposes the multicast delivery problem into two parts, (1) the construction of the multicast tree and (2) the maintenance of dynamic membership. The virtual hierarchical routing tree (VHRT) is proposed for constructing an efficient multicast tree and the re-routing scheme is for maintaining the multicast tree in an optimal routing cost once the membership, such as member joining or leaving, changes dynamically. The AMRST not only keeps the benefits of the traditional terrestrial multicast but also further promotes the multicasting performance by employing the satellite broadcasting capability. The simulation results demonstrate that the AMRST has excellent performance for the satellite-terrestrial network.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"81 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":"124426843","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

Call admission control using differentiated outage probabilities in multimedia DS-CDMA networks with imperfect power control 具有不完全功率控制的多媒体DS-CDMA网络中基于差分中断概率的呼叫接纳控制

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043088

Tao Shu, Z. Niu

引用次数: 8

A software framework for non-repudiation service in electronic commerce based on the Internet 基于Internet的电子商务中不可否认服务的软件框架

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043064

S. Tak, Yugyung Lee, E. Park

引用次数: 10

MobileGrid: capacity-aware topology control in mobile ad hoc networks 移动网格:移动自组织网络中的容量感知拓扑控制

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043127

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

A multilevel hierarchical distributed IP mobility management scheme for wide area networks 一种面向广域网的多层分层分布式IP移动管理方案

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043109

K. Kawano, K. Kinoshita, K. Murakami

{"title":"A multilevel hierarchical distributed IP mobility management scheme for wide area networks","authors":"K. Kawano, K. Kinoshita, K. Murakami","doi":"10.1109/ICCCN.2002.1043109","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043109","url":null,"abstract":"Hierarchical Mobile IPv6 (HMIPv6) has been proposed as one solution to accommodate the frequent movements of mobile terminals (MTs) in IP-based mobile communication networks. HMIPv6 utilizes a mobility anchor point (MAP) that allows the network to manage the mobility of MTs without causing any overflow of outgoing and incoming messages beyond the network perimeter. However, there is a problem in applying HMIPv6 to a wide area network having a multilevel hierarchy. The distribution of several MAPs within such a network can be used as a means of optimizing the different mobility scenarios experienced by MTs. However, HMIPv6 allows MTs to select their own MAP, so with HMIPv6, the MTs may not select the MAP that would be chosen in an optimized scheme. This may cause load concentration at a particular MAP and/or overflow of signaling messages to and from outside networks. An effective IP mobility management method is proposed that focuses on the speed of movement of the MTs. It reduces the number of signaling messages to and from outside networks without suffering from load concentration at particular MAPs, and we show, by simulation experiments, that the proposed method works effectively.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"75 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":"127578049","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}

引用次数: 32

Indexing techniques for file sharing in scalable peer-to-peer networks 可扩展点对点网络中文件共享的索引技术

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043038

Fred S. Annexstein, K. Berman, M. Jovanovic, Kovendhan Ponnavaikko

{"title":"Indexing techniques for file sharing in scalable peer-to-peer networks","authors":"Fred S. Annexstein, K. Berman, M. Jovanovic, Kovendhan Ponnavaikko","doi":"10.1109/ICCCN.2002.1043038","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043038","url":null,"abstract":"File sharing is a very popular service provided by peer-to-peer (P2P) networks. In a P2P file-sharing network, users share files and issue queries to the network to find the locations of files residing at other peer nodes. Recently, proxy-enabled peers, or supernodes, have been incorporated to enhance scalability by providing indexing services to nodes on slower network connections. Typically, supernodes build a vector or multi-index of shared files stored on other (slower) peer nodes connected to them. We consider a new model whereby the index tables of individual nodes are merged into a single data structure stored by the supernode. We analyze this model in relation to the standard vectorized data structure. We compare the performance of these supernode indexing algorithms and provide a theoretical analysis that is asymptotic and probabilistic in nature. However, there are several significant constant factors that the theory does not account for, and which are important for designing an optimal system solution. We report on a series of simulation experiments which provide verification of the asymptotic analysis of the formal framework and tools to determine the magnitude of the constant factors. Our general conclusion is that when the query rate exceeds the rate of data updates, the new merged model is preferable to the vector model. However, the details of our analysis allow us to consider combinations of several parameters, and thereby enable the design of optimal indexing schemes via the incorporation of measurements of the parameters of particular applications.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"103 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":"127362129","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}

引用次数: 9

An efficient scheme to remove crawler traffic from the Internet 一个有效的方案，以消除爬虫流量从互联网

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043051

Xiaoqin Yuan, M. MacGregor, J. Harms

引用次数: 24

Content routing with network support using passive measurement in content distribution networks 在内容分发网络中使用被动测量的网络支持的内容路由

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043052

H. Miura, M. Yamamoto

引用次数: 14

Analysis of multi-rate traffic in WDM grooming networks WDM疏导网络中多速率业务分析

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043081

R. Srinivasan, Arun Kumar Somani

引用次数: 16

Distributed shared multicast tree construction protocols for tree-shared multicasting in OBS networks OBS网络中树共享组播的分布式共享组播树构建协议

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043086

Myoungki Jeong, C. Qiao, M. Vandenhoute

引用次数: 7