Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems最新文献_第4页

The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems 对等体选择和缓冲策略对对等体文件共享系统性能的影响

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167061

L. Zou, E. Zegura, M. Ammar

{"title":"The effect of peer selection and buffering strategies on the performance of peer-to-peer file sharing systems","authors":"L. Zou, E. Zegura, M. Ammar","doi":"10.1109/MASCOT.2002.1167061","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167061","url":null,"abstract":"Peer-to-peer systems contain a collection of equivalent entities that form an application-layer overlay network. Each entity acts as client, server, and overlay network router. Peer-to-peer systems enable the rapid development of distributed applications; peer-to-peer file sharing has become one of the most popular Internet applications. There are two primary functions in a peer-to-peer file sharing application: content discovery (determining which peers have the desired content) and content retrieval (transferring content from a peer to the requester). We focus on two aspects of content retrieval that have received limited attention, namely peer selection and request buffering. Using a combination of analytic modelling and simulation, we find that a simple greedy scheme that uses only local information to select a peer has performance comparable to alternative schemes, including those that make more globally-informed decisions. We also find that the optimal request buffering strategy depends on the system load and availability of peer information. For example, when peer information is scarce, download buffering works well; when peer information is plentiful, no buffering is preferable for a better throughput. Our results have implications for the design of high-performance, low overhead peer-to-peer file sharing systems.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116785488","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

Energy-aware routing in cluster-based sensor networks 基于簇的传感器网络中的能量感知路由

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167069

M. Younis, M. Youssef, K. A. Arisha

引用次数: 637

Modified LC-trie based efficient routing lookup 改进的基于LC-trie的高效路由查找

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167075

V. Ravikumar, R. Mahapatra, Jyh-Charn S. Liu

引用次数: 21

Network traffic behaviour in switched Ethernet systems 交换以太网系统中的网络流量行为

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167058

T. Field, U. Harder, P. Harrison

引用次数: 40

Disha: a performance model of a true fully adaptive routing algorithm in k-ary n-cubes Disha: k-ary n-cubes中真完全自适应路由算法的性能模型

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167076

A. Khonsari, Alireza Farahani, M. Ould-Khaoua

引用次数: 2

Novel formulae for GSPN aggregation GSPN聚合的新公式

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167079

J. Freiheit, A. Heindl

引用次数: 5

Collision avoidance in multi-hop ad hoc networks 多跳自组织网络中的碰撞避免

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167071

Yu Wang, J. Garcia-Luna-Aceves

{"title":"Collision avoidance in multi-hop ad hoc networks","authors":"Yu Wang, J. Garcia-Luna-Aceves","doi":"10.1109/MASCOT.2002.1167071","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167071","url":null,"abstract":"Collision avoidance is very important in contention-based medium access control protocols for multi-hop ad hoc networks due to the adverse effects of hidden terminals. Four-way sender-initiated schemes are the most popular collision-avoidance schemes to date. Although there has been considerable work on the performance evaluation of these schemes, most analytical work is confined to single-hop ad hoc networks or networks with very few hidden terminals. We use a simple analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed according to a two-dimensional Poisson distribution, which, to our knowledge, has not been investigated sufficiently before. We show that the sender-initiated collision-avoidance scheme achieves much higher throughput than the idealized carrier sense multiple access scheme with an ideal separate channel for acknowledgments. More importantly, we show that the collision avoidance scheme can accommodate much fewer competing nodes within a region in a network infested with hidden terminals than in a fully-connected network, if reasonable throughput is to be maintained. This shows that the scalability problem of contention-based collision-avoidance protocols looms much earlier than might be expected. Simulation experiments of the popular IEEE 802.11 MAC protocol validate the predictions made in the analysis.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117113994","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}

引用次数: 77

An efficient routing algorithm for all-optical networks with turn constraints 一种具有回合约束的全光网络路由算法

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167073

H. Soliman, Chad Peyton

引用次数: 1

Exploiting the predictability of TCP's steady-state behavior to speed up network simulation 利用TCP稳态行为的可预测性来加速网络模拟

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167066

Qi He, M. Ammar, G. Riley, R. Fujimoto

{"title":"Exploiting the predictability of TCP's steady-state behavior to speed up network simulation","authors":"Qi He, M. Ammar, G. Riley, R. Fujimoto","doi":"10.1109/MASCOT.2002.1167066","DOIUrl":"https://doi.org/10.1109/MASCOT.2002.1167066","url":null,"abstract":"In discrete-event network simulation, a significant portion of resources and computation are dedicated to the creation and processing of packet transmission events. For large-scale network simulations with a large number of high-speed data flows, the processing of packet events is the most time consuming aspect of the simulation. We develop a technique that saves on the processing of packet events for TCP flows using the well established results showing that the average behavior of a TCP flow is predictable given a steady-state path condition. We exploit this to predict the average behavior of a TCP flow over a future period of time where steady-state conditions hold, thus allowing for a reduction (or elimination) of the processing required for packet events during this period. We consider two approaches to predicting TCP's steady-state behavior: using throughput formulas or by direct monitoring of a flow's throughput in a simulation. We design a simulation framework that provides the flexibility to incorporate this method of simulating TCP packet flows. Our goal is (1) to accommodate different network configurations, on/off flow behavior and interaction between predicted flows and packet-based flows; and (2) to preserve the statistical behavior of every entity in the system, from hosts to routers to links, so as to maintain the accuracy of the network simulation as a whole. In order to illustrate the promise of this idea we implement it in the context of the ns2 simulation system. A set of experiments illustrate the speedup and approximation of the simulation framework under different scenarios and for different network performance metrics.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116321200","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

On the sensitivity of network simulation to topology 网络仿真对拓扑的敏感性研究

Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems Pub Date : 2002-10-11 DOI: 10.1109/MASCOT.2002.1167068

K. Anagnostakis, M. Greenwald, Raphael S. Ryger

引用次数: 25