2008 Next Generation Internet Networks最新文献_第2页

Dynamic Cooperation Enforcement through Trust-based Allocation Policies in P2P Systems 基于信任的P2P系统分配策略的动态合作执行

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.50

A. Satsiou, L. Tassiulas

{"title":"Dynamic Cooperation Enforcement through Trust-based Allocation Policies in P2P Systems","authors":"A. Satsiou, L. Tassiulas","doi":"10.1109/NGI.2008.50","DOIUrl":"https://doi.org/10.1109/NGI.2008.50","url":null,"abstract":"In this paper we propose distributed trust-based resource allocation policies to provide fairness in p2p-like systems. According to these policies, the portion of the available resource received by each competing peer depends on (a) his trust/reputation, (b) his resource demands and (c) his request generation rate. The reputation of a peer is quantified and an approach for continuously updating the reputation is proposed such that it reflects the contributions of the peer in the transactions he engages. We study both homogeneous and heterogeneous systems of peers with different resource capabilities and needs and we see from theoretical analysis and simulation results that proposed policies motivate peers to contribute resources in the network by guarantying that peers will only receive resources in proportion to their contributions; thus misbehaving (non contributive) peers cannot exploit the system. Furthermore, proposed policies lead to the dynamic formation of coalitions (cooperation) between peers who mutually benefit by their transactions, according to their capabilities and needs. Peers' coalitions are adaptive to network changes and self-organized as new peers enter the system or strategic peers vary their contributions.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698404","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

An Open Architecture for Monitoring and Measuring QoS Indicators in Wireless Community Networks 无线社区网络中QoS指标监测与测量的开放体系结构

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.45

G. Parissis, S. Arkoulis, T. Apostolopoulos

引用次数: 1

Trend Based Bandwidth Provisioning: An Online Approach for Traffic Engineered Tunnels 基于趋势的带宽分配:一种流量工程隧道的在线方法

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.14

S. Dasgupta, J. de Oliveira, J. Vasseur

引用次数: 7

Robust and Reactive Traffic Engineering for Dynamic Traffic Demands 动态交通需求的鲁棒和响应交通工程

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.16

P. Casas, L. Fillatre, Sandrine Vaton

{"title":"Robust and Reactive Traffic Engineering for Dynamic Traffic Demands","authors":"P. Casas, L. Fillatre, Sandrine Vaton","doi":"10.1109/NGI.2008.16","DOIUrl":"https://doi.org/10.1109/NGI.2008.16","url":null,"abstract":"Traffic engineering (TE) has become a challenging mechanism for network management and resources optimization due to uncertain and difficult to predict traffic patterns. Recent works have proposed robust optimization techniques to cope with uncertain traffic, computing a stable routing configuration that is immune to demand variations within certain uncertainty set. However, using a single routing configuration for longtime periods can be highly inefficient. Even more, the presence of abnormal and malicious traffic has magnified the network operation problem, claiming for solutions which not only deal with traffic uncertainty but also allow to detect and identify faulty traffic to take the appropriate countermeasures. In this paper, we introduce the Reactive Robust Routing (RRR) for TE, an approach that combines both proactive and reactive techniques to tackle the problem. Based on expected traffic patterns, we adapt the uncertainty set and build a multi-hour yet robust routing scheme that outperforms the stable robust approach. For the case of anomalous and unexpected traffic, we propose a fast anomaly detection/isolation algorithm to detect and localize abrupt changes in traffic flows and decide routing changes. This algorithm is optimal in the sense that it minimizes the decision delay for a given mean false alarm rate and false isolation probability. We validate these proposals using real data from two different backbone networks and we show how the RRR can handle uncertain and highly dynamic traffic in an automatic fashion, simplifying network operation.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"526 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988722","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

Optimized Content Distribution in a Push-VoD Scenario 推送点播场景下的内容分发优化

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.28

S. Bessler

引用次数: 1

Large Scale Distributed Storage and Search for a Video on Demand Streaming System 一种视频点播流媒体系统的大规模分布式存储与搜索

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.30

Xonia Ivonne Olavarrieta, A. Leon-Garcia

{"title":"Large Scale Distributed Storage and Search for a Video on Demand Streaming System","authors":"Xonia Ivonne Olavarrieta, A. Leon-Garcia","doi":"10.1109/NGI.2008.30","DOIUrl":"https://doi.org/10.1109/NGI.2008.30","url":null,"abstract":"In the trend towards all IP networks, providing video services has proven to be a challenging task due to the high bandwidth requirements and the low delay and loss constraints. The architectural approaches taken by corporations to date mainly involve costly solutions that are difficult to manage and scale. Although IP multicast attempts to deal with the scalability of these systems at the network layer, it has not been widely deployed due to the extra cost of management and replacement of the existing infrastructure that involves. Therefore, if next generation service providers are to deliver high quality and on-demand video streaming to a large number of clients, new streaming methodologies such as peer-to-peer (P2P) need to be deployed to alleviate some of the current challenges involved in video streaming. We propose an effective and deployable solution for next generation video on demand (VoD) service providers based on a multilayered hybrid P2P topology for the distribution of and search for content, that addresses the requirements of low startup delay, provision of VCR-like commands and the scalability and management of a VoD streaming system.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134104797","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

TCP Limit: A Streaming Friendly Transport Protocol TCP限制:一个流友好的传输协议

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.25

F. Németh, S. Molnár, P. Tarján, R. Szabó

引用次数: 4

The Underlay Abstraction in the Spontaneous Virtual Networks (SpoVNet) Architecture 自发虚拟网络(SpoVNet)体系结构中的底层抽象

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.22

Roland Bless, Christian Hübsch, S. Mies, O. P. Waldhorst

引用次数: 40

An Economical Cost Model for Fair Resource Sharing in Virtual Home Environments 虚拟家庭环境下资源公平共享的经济成本模型

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.27

A.E. Garcia, A. Berl, K. Hummel, R. Weidlich, A. Houyou, K. Hackbarth, H. de Meer, H. Hlavacs

引用次数: 13

Design and Analysis of Flow Aware Load Balancing Mechanisms for Multi-Service Networks 多业务网络流感知负载均衡机制设计与分析

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.18

Andrés Ferragut, D. Kofman, Federico Larroca, S. Oueslati

{"title":"Design and Analysis of Flow Aware Load Balancing Mechanisms for Multi-Service Networks","authors":"Andrés Ferragut, D. Kofman, Federico Larroca, S. Oueslati","doi":"10.1109/NGI.2008.18","DOIUrl":"https://doi.org/10.1109/NGI.2008.18","url":null,"abstract":"Ethernet technology is being deployed in metro and wide area networks. However, despite recent evolutions, Ethernet cannot be considered a carrier class technology due mainly to the lack of facilities for efficient traffic engineering (TE). In this article, we propose a Flow-aware TE approach for carrier class Ethernet networks providing services like those defined by the Metro Ethernet Forum. The flow-aware networking approach we consider is based on the Cross-protect router mechanisms, allowing satisfactory quality for streaming and elastic flows without explicitly identifying traffic classes by the combined use of fair queuing and admission control. Our proposal applies specifically to architectures where a tunnel is established between ingress and egress nodes (like Ethernet over MPLS). In this specific context, the Cross-protect mechanisms are applied on a per tunnel basis. We analyze the proposed approach in terms of flow blocking probabilities for which explicit formula are derived. We also extend the study framework to the case where several paths are established between a pair of ingress/egress nodes, and propose a simple load balancing scheme. We analyze its performance and derive approximate formula for the flow blocking probability in this case. The analysis is validated by extensive simulations.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127053668","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