Sixth International Conference on Networking (ICN'07)最新文献_第10页

Optimal Leader Election Scheme for Peer-to-Peer Applications 点对点应用的最优领导者选举方案

Sixth International Conference on Networking (ICN'07) Pub Date : 2007-04-22 DOI: 10.1109/ICN.2007.65

S. Han, Ye Xia

{"title":"Optimal Leader Election Scheme for Peer-to-Peer Applications","authors":"S. Han, Ye Xia","doi":"10.1109/ICN.2007.65","DOIUrl":"https://doi.org/10.1109/ICN.2007.65","url":null,"abstract":"Leader election is one of the most frequently encountered problems in peer-to-peer applications. However, choosing the best node is not a trivial problem and the obtained performance can dramatically vary depending on it. Another issue is what to measure in the evaluation and comparison of different leader election schemes. It is not clear yet what metrics best capture the performance objective. In this paper, we introduce two performance metrics, the worst link stress (WLS) and the degree of interference (DOI), for the leader election problem, and present a fully distributed, optimal scheme that elects a leader according to the DOI-minimizing criterion in a peer-to-peer network. Our scheme does not require network collaboration, and the communication/computation overhead is low. The only assumption is that the participating nodes can obtain a list of IDs of the nodes in the session through the underlying P2P substrates. After examining the correctness of the algorithm, we present simulation results demonstrating the benefits of the optimal leader election scheme. Through the simulation results, we conclude that the algorithm is simple yet effective in achieving the design goals, particularly in reducing (1) the worst link stress and balancing load in the network, and (2) the network bandwidth usage.","PeriodicalId":117154,"journal":{"name":"Sixth International Conference on Networking (ICN'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127840751","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}

引用次数: 12

Access Authentication to IMS Systems in Next Generation Networks 下一代网络中IMS系统的接入认证

Sixth International Conference on Networking (ICN'07) Pub Date : 2007-04-22 DOI: 10.1109/ICN.2007.16

S. Holtmanns, Son Phan-Anh

引用次数: 0

A High Performance Multicast Scheme Based on Virtual 2D Torus Topology 一种基于虚拟二维环面拓扑的高性能组播方案

Sixth International Conference on Networking (ICN'07) Pub Date : 2007-04-01 DOI: 10.1109/ICN.2007.2

I. Hwang, San-Nan Lee, Kuo-Chang Chien

引用次数: 0

On the Correlation of Geographic and Network Proximity at Internet Edges and Its Implications for Mobile Unicast and Multicast Routing 互联网边缘地理与网络邻近的相关性及其对移动单播和组播路由的影响

Sixth International Conference on Networking (ICN'07) Pub Date : 2007-01-20 DOI: 10.1109/ICN.2007.61

T. Schmidt, Matthias Wählisch, Y. Zhang

{"title":"On the Correlation of Geographic and Network Proximity at Internet Edges and Its Implications for Mobile Unicast and Multicast Routing","authors":"T. Schmidt, Matthias Wählisch, Y. Zhang","doi":"10.1109/ICN.2007.61","DOIUrl":"https://doi.org/10.1109/ICN.2007.61","url":null,"abstract":"Significant effort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing efficient mobile multicast management are emergent. Both problems simultaneously expose routing complexity between subsequent points of attachment as a characteristic parameter for handover performance in access networks. As continuous mobility handovers necessarily occur between access routers located in geographic vicinity, this paper investigates on the hypothesis that geographically adjacent edge networks attain a reduced network distances as compared to arbitrary Internet nodes. We therefore evaluate and analyze edge distance distributions in various regions for clustered IP ranges on their geographic location such as a city. We use traceroute to collect packet forwarding path and round-trip-time of each intermediate node to scan-wise derive an upper bound of the node distances. Results of different scanning origins are compared to obtain the best estimation of network distance of each pair. Our results are compared with corresponding analysis of CAIDA Skitter data, overall leading to fairly stable, reproducible edge distance distributions. As a first conclusion on expected impact on handover performance measures, our results indicate a general optimum for handover anticipation time in 802.11 networks of 25 ms.","PeriodicalId":117154,"journal":{"name":"Sixth International Conference on Networking (ICN'07)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130846635","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

Open Home Networks: The TEAHA Approach 开放家庭网络:TEAHA方法

Sixth International Conference on Networking (ICN'07) Pub Date : 2006-11-20 DOI: 10.1109/ICN.2007.63

H. W. V. Dijk, H. Scholten, Alvaro Tobalina, Victor Garcia Munoz, S. Milanini, A. Kung

引用次数: 6

The Honeynet Quarantine: Reducing Collateral Damage Caused by Early Intrusion Response 蜜网隔离:减少早期入侵响应造成的附带损害

Sixth International Conference on Networking (ICN'07) Pub Date : 2005-06-15 DOI: 10.1109/ICN.2007.92

Birger Tödtmann, Stephan Riebach, E. Rathgeb

引用次数: 11