Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献_第7页

Efficient data retrieving in distributed data-streaming environments 分布式数据流环境中的高效数据检索

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523944

Jinsong Han, Jun Miao, Jizhong Zhao, J. Huai, L. Ni

引用次数: 2

A peer-to-peer overlay for context information search 用于上下文信息搜索的点对点覆盖

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523895

T. Gu, H. Pung, Daqing Zhang

引用次数: 15

A resource-trading mechanism for efficient distribution of large-volume contents on peer-to-peer networks 一种在点对点网络上有效分发大量内容的资源交易机制

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523902

S.G.M. Koo, C.S.G. Lee, Karthik N. Kannan

{"title":"A resource-trading mechanism for efficient distribution of large-volume contents on peer-to-peer networks","authors":"S.G.M. Koo, C.S.G. Lee, Karthik N. Kannan","doi":"10.1109/ICCCN.2005.1523902","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523902","url":null,"abstract":"In recent years, the rapid growth of peer-to-peer (P2P) networks has provided a new paradigm for content distribution. To improve the efficiency of a P2P system, it is important to provide incentives for the peers to participate and contribute their resources. Various attempts have been made to reward/penalize peers by providing service differentiation based on a requesting peer's history or reputation. However, in a truly distributed, non-cooperative environment, maintaining and preventing the untruthful revealing of such information within the community impose larger computation and communication overheads to the system. These problems are further magnified when large-volume contents are being distributed because of the length distribution processes and the update of history or reputation has to keep up with the distribution process. In this paper, we address the incentive provisioning problem for distribution of large-volume content in P2P networks, and present a \"seeing-is-believing\" incentive-compatible mechanism (protocol) in which a peer will decide how much resources will be assigned to which neighbors based on what it has experienced. The protocol applies a utility-based resource-trading concept where peers will maximize their contributions for a fair or better return, and we show that by adopting this protocol, the system will achieve Cournot Equilibrium. Furthermore, our protocol is light-weight, completely decentralized, and cheat-proof. Experimental results illustrate significant improvements on the distribution efficiency of our protocol over other adopted alternatives.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127194917","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

Reducing the user perceived delay of interactive TCP connections using a dynamic priority approach 使用动态优先级方法减少交互式TCP连接的用户感知延迟

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523901

P. Dimopoulos, P. Zeephongsekul, Z. Tari

引用次数: 5

Network simulation via hybrid system modeling: a time-stepped approach 通过混合系统建模的网络仿真:一种时间步进方法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523932

A. Kavimandan, Wonsuck Lee, M. Thottan, A. Gokhale, R. Viswanathan

{"title":"Network simulation via hybrid system modeling: a time-stepped approach","authors":"A. Kavimandan, Wonsuck Lee, M. Thottan, A. Gokhale, R. Viswanathan","doi":"10.1109/ICCCN.2005.1523932","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523932","url":null,"abstract":"The ever increasing complexity of networks dramatically increases the challenges faced by service providers to analyze network behavior and (re)provision resources to support multiple complex distributed applications. Accurate and scalable simulation tools are pivotal to this cause. The recently proposed hybrid systems model for data communication networks shows promise in achieving performance characteristics comparable to fluid models while retaining the accuracy of discrete models. Using the hybrid systems paradigm, this paper provides contributions to the modeling of TCP behavior and the analysis/simulation of data communication networks based on these models. An important distinguishing feature of our simulation framework is a faithful accounting of link propagation delays which has been ignored in previous work for the sake of simplicity. Other salient aspects of the work include a new finite state machine model for a drop-tail queue, a new model for fast recovery/fast retransmit mode, a revised sending rate model, and an embedded time-out mode transition mechanism all of which employ a time-stepped solution method to solve the hybrid system network models. Our simulation results are consistent with well-known packet based simulators such as ns-2, thus demonstrating the accuracy of our hybrid model. Our future efforts will be directed towards studying and improving the computational performance of hybrid model based simulations.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126817177","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}

引用次数: 13

Future of wireless networks 无线网络的未来

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523918

G. Rittenhouse

引用次数: 3

Least-cost disjoint paths with dependent cost structure in wavelength continuous optical WDM networks 波长连续光WDM网络中具有相关代价结构的最小代价不相交路径

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523875

A. Todimala, B. Ramamurthy

引用次数: 3

Dynamic shared Layer 1 VPN provisioning in next-generation SONET/SDH networks 下一代SONET/SDH网络中的动态共享第一层VPN供应

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523935

N. Ghani, D. Benhaddou, W. Alanqar, Krishna Amimireddygari, Satish Dandu

引用次数: 4

Scalable IP-VPN flow control mechanism supporting arbitrary fairness criteria. Part 1. Architecture design 可扩展的IP-VPN流量控制机制，支持任意公平标准。第1部分。体系结构设计

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523837

O. Honda, H. Ohsaki, M. Imase, J. Murayama, K. Matsuda

{"title":"Scalable IP-VPN flow control mechanism supporting arbitrary fairness criteria. Part 1. Architecture design","authors":"O. Honda, H. Ohsaki, M. Imase, J. Murayama, K. Matsuda","doi":"10.1109/ICCCN.2005.1523837","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523837","url":null,"abstract":"In recent years, IP-based virtual private networks (IP-VPNs), which provide a virtual privately owned network over an IP network, have attracted attention. With existing IP-VPNs, however, there is a serious problem that fairness among IP-VPN customers is not satisfied. In this paper, we first discuss design objectives of a control mechanism for achieving fair IP-VPN services: achieving inter-VPN fairness, achieving intra-VPN fairness, easy deployment into existing IP networks, and achieving a high scalability. We then propose an IP-VPN fairness control called 12FVC (inter-and intra-VPN fairness control) for realizing a fair IP-VPN service in a scalable way. The core of 12VFC is an AIMD (additive increase and multiplicative decrease) window flow control operating among IP-VPN service provider's edge routers. 12VFC has the advantage that an IP-VPN service provider can arbitrarily specify inter-VPN fairness criteria by utilizing analytic results of AIMD window flow control. Moreover, 12VFC can be easily deployed into existing IP networks by simply modifying edge routers. Through several simulation experiments, we demonstrate that 12VFC realizes both inter-VPN fairness and intra-VPN fairness with extremely high accuracy.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898291","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}

引用次数: 3

Smart PSK provisioning: a key-management and authentication scheme for wireless LANs 智能PSK发放:无线局域网的密钥管理和认证方案

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523823

Dario S. Tonesi, L. Salgarelli

引用次数: 3