{"title":"A Versatile Control Plane for EPON-based FTTX Access Networks","authors":"M. T. Ngo, A. Gravey","doi":"10.1109/NGI.2009.5175754","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175754","url":null,"abstract":"The Ethernet PON (EPON), standardized by the IEEE Ethernet First Mile Alliance, is viewed by many as an attractive solution to deliver very high-speed broadband access. While downstream traffic is broadcasted to all customers, the access of upstream traffic to the fiber has to be arbitrated in order to avoid collisions. This is achieved by designing both a Dynamic Bandwidth Assignment (DBA) that shares bandwidth opportunities between customers, and a scheduling policy, which is used by customers to take advantage of the allocated bandwidth opportunities. The DBA and the settings of the scheduling policy are part of the control plane of the PON, and thus characterize which types of services can be supported by the operator. EPON are widely deployed in some geographical areas, but usually offer a simple Best Effort access network. This paper proposes a versatile control plane for EPONs that can be configured to support either a classless Best Effort network, or several relative Classes of Services, or a mix of committed bandwidth and Best Effort services. This control plane includes a framework for enforcing Service Level Agreements, and fairly sharing available resources. The paper also addresses the issue of Connection. Acceptance Control for EPONs and explains its relationship with the DBA. The proposed framework is easily configured (all the control being centralized at the OLT or in the backbone) while allowing the support of large varieties of services.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116681040","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}
{"title":"Multimedia Data Transport for Wireless Sensor Networks","authors":"João Almeida, A. Grilo, P. Pereira","doi":"10.1109/NGI.2009.5175768","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175768","url":null,"abstract":"This paper presents the study and implementation of a reliable transport protocol for wireless multimedia sensor networks. The work was based on an existing transport protocol for sensor networks, the DTSN (\"Distributed Transport for Sensor Networks\") developed at Inesc within projects IST FP6 UbiSec&Sens, EuroFGI and FP7 EuroNF. \u0000 \u0000For multimedia data transport, some structural changes were made to DTSN, and mechanisms were added in order to provide a differentiated reliability service for packets flowing on the sensor network. The new service allows a multimedia data stream to be divided on several blocks with different reliability. The blocks' size and minimum reliability required are sent to the network by the client to configure and initialize the differentiated reliability service. Lost packets from multimedia blocks with the minimum reliability already assured will not be claimed lost by the receiver, and therefore will not be retransmitted. That will cause fewer retransmissions on the network, throughput improvements and an increase of network lifetime with no significant degradation of the transmitted stream. \u0000 \u0000A packet recovery module was also implemented, based on an additional parity packet that must be sent for each block, allowing the recovery of one lost packet per multimedia block. This module works on top of the transport layer, improving overall efficiency and being completely transparent to it. \u0000 \u0000The new multimedia DTSN protocol was tested in the TOSSIM network simulator. Functional and performance tests were made which have demonstrated the advantages of the proposed solution for multimedia transport in wireless sensor networks.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575585","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}
{"title":"Option-based Dynamic Management of Wireless Spectrum","authors":"L. Mastroeni, M. Naldi","doi":"10.1109/NGI.2009.5175773","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175773","url":null,"abstract":"Dynamic spectrum management makes it possible for the owner of usage rights on some frequency blocks to sublet each of them in real time and for a limited period of time. As a softer implementation with respect to the spot market a two stage assignment is here proposed through the use of options, which give buyers the right to purchase the usage right on a single block and for a timeslot. In the sale of options the primary owner may accomplish an overbooking strategy, which consists in selling more blocks than the available ones and acts as hedging against the risk of unsold blocks. A model for the overbooking strategy is described and evaluated, which takes into account both the value of the option, the correlated decisions taken by the prospective purchasers, and the penalty to be paid to the unsatisfied customers. The dependence of the economical convenience of the overbooking strategy on the relevant parameters (among which the penalty value and the overbooking factor) is shown for a significant range of cases.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125980656","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}
G. Biczók, G. Németh, P. Tarján, F. Kubinszky, A. Veres
{"title":"SpeedDetect: A Simple TCP Extension for Handling Sudden Capacity Increase","authors":"G. Biczók, G. Németh, P. Tarján, F. Kubinszky, A. Veres","doi":"10.1109/NGI.2009.5175783","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175783","url":null,"abstract":"Emerging broadband mobile cellular networks are inherently heterogeneous due to the co-existence of multiple wireless access technologies. In such a network sudden capacity changes are bound to happen due to inter-system handovers, user mobility and flow dynamics. Existing congestion control protocols are shown to deal sufficiently with capacity drops but tend to reach full link utilization slowly after abrupt capacity increases. \u0000 \u0000In this paper we prepose SpeedDetect, a simple, sender-side TCP extension for handling sudden capacity increase. The key idea behind our approach is to improve link utilization by explicitly detecting increased link capacity then triggering the underlying congestion control scheme to an aggressive probing regime. We evaluate the performance of SpeedDetect with testbed experiments and simulations. Our findings suggest that the proposed mechanism can significantly improve the reaction time of TCP by detecting sudden capacity increase quickly and consistently. Furthermore, our approach retains the RTT-fairness of the underlying TCP and exhibits favorable interprotocol fairness towards standard TCP NewReno.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126826056","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}
{"title":"Integration of Mobile Devices into Popular Peer-to-Peer Networks","authors":"A. Berl, H. Meer","doi":"10.1109/NGI.2009.5175763","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175763","url":null,"abstract":"Peer-to-peer content-distribution networks are nowadays highly popular among users that have stationary computers with high-bandwidth Internet connections. Mobile devices (e.g. cell phones) that are connected to the Internet via cellular-radio networks, however, could not yet be launched into this field to a satisfactory extent. Although most mobile devices have the necessary hardware resources for joining peer-to-peer content-distribution networks, they are often not able to benefit from participation, due to limitations caused by mobility. In this work, mobile devices are identified as providers of advanced mobile features and services that are usually not available to computers in stationary networks. These mobile features and services can be exchanged for services in peer-to-peer networks, turning mobile devices into valuable trading partners. Partnership schemes are set up to define the way of a fair cooperation between mobile devices and other peers. A novel peer-to-peer architecture is suggested that applies partnership schemes to a well-established peer-to-peer content-distribution network and facilitates the integration of mobile devices.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672089","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}
{"title":"Performance of Wireless Heterogeneous Networks with Always-best-connected Users","authors":"N. Kaci, P. Maillé, J. Bonnin","doi":"10.1109/NGI.2009.5175776","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175776","url":null,"abstract":"We consider a geographic area covered by two wireless networks. Assuming delay-sensitive users, we study the loss of efficiency of the user equilibrium (the Price of Anarchy) in terms of total delay, with M/M/1 delay functions on each network. The user equilibrium is proved to be less efficient when the network is very heterogeneous, i.e. the two networks have different capacities. \u0000 \u0000In order to elicit coordination among users, we suggest to use marginal cost pricing. We investigate the computation of the optimal taxes to use, and give several arguments in favor of the technical feasibility of such a scheme. Applying taxes therefore seems particularly well-suited to improve the overall performance of a network selection game with selfish users.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128553849","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}
{"title":"Evaluation of Single Rate Multicast Congestion Control Schemes for MPEG-4 Video Transmission","authors":"C. Bouras, A. Gkamas, Georgios Kioumourtzis","doi":"10.1109/NGI.2009.5175760","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175760","url":null,"abstract":"We present in this paper a simulation-based comparison of one of the best known multicast congestion control schemes - TFMCC - against our proposed Adaptive Smooth Multicast Protocol (ASMP). ASMP consists of a singlerate multicast congestion control, which takes advantage of the RTCP Sender (SR) and Receiver Reports (RR) in order to adjust the sender's transmission rate in respect of the network conditions. The innovation in ASMP lays in the \"smooth\" transmission rate, which is TCP-friendly and prevent oscillations. We use an integrated simulation environment named Multi-Evalvid-RA for the evaluation of the two congestion control schemes. Multi-Evalvid-RA provides all the necessary tools to perform simulation studies and assess the video quality by using both network related metrics along with video quality measurements. The performance evaluation results show that ASMP is a very efficient solution for rate adaptive multimedia applications and a serious competitor to well know TFMCC.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133733065","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}
Stefano Secci, J. Rougier, A. Pattavina, F. Patrone, G. Maier
{"title":"ClubMED: Coordinated Multi-Exit Discriminator Strategies for Peering Carriers","authors":"Stefano Secci, J. Rougier, A. Pattavina, F. Patrone, G. Maier","doi":"10.1109/NGI.2009.5175756","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175756","url":null,"abstract":"Inter-domain peering links represent nowadays the real bottleneck of the Internet. On peering links carriers may coordinate to efficiently balance the load, but the current practice is often based on an uncoordinated selfish routing supported by the peer relationship. We present a novel game theoretical routing framework to efficiently coordinate the routing on peering links while modelling the non-cooperative carrier behaviour. It relies on a collaborative use of the Multi-Exit Discriminator (MED) attribute of BGP, hence it is nicknamed ClubMED (Coordinated MED). The incentives are the minimization of carrier routing costs, the control of peering link congestions and peering route stability. For the ClubMED game, we define the Nash Equilibrium Multi-Path (NEMP) routing policy that shall be implemented upon Nash equilibria and Pareto-efficient profiles. Intra-domain Interior Gateway Protocol (IGP) weight optimizations are consistently integrated into the framework. \u0000 \u0000We emulated the peering settlement between the Internet2 and the Geant2 networks, employing real datasets, comparing the ClubMED results to the current BGP practice. The results show that the global routing cost can be reduced of roughly 17%, that the peering link congestion can be avoided and that the stability of the routes can significantly be reinforced.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122419247","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}
{"title":"Robust Load-balancing under Statistical Uncertainty: Models and Polynomial-time Algorithms","authors":"A. Gunnar, M. Johansson","doi":"10.1109/NGI.2009.5175781","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175781","url":null,"abstract":"We study the problem of guaranteed-performance routing under statistical traffic uncertainty. Relevant traffic models are presented and a polynomial-time algorithm for solving the associated robust routing problem is given. We demonstrate how our techniques, in combination with fundamental limitations on the accuracy of estimated traffic matrices, enable us to compute bounds on the achievable performance of OSPF-routing optimized using only topology information and link count data. We discuss extensions to other types of traffic uncertainties and describe an alternative, more memory efficient, algorithm based on combined constraint and column generation. The proposed techniques are evaluated in several numerical examples to highlight the features of our approach.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132558478","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}
{"title":"Revisiting Internet Access Pricing for Loyal Customers: the Long-Term Interaction Case","authors":"T. Trinh, L. Gyarmati","doi":"10.1109/NGI.2009.5175780","DOIUrl":"https://doi.org/10.1109/NGI.2009.5175780","url":null,"abstract":"Customer loyalty as part of user behaviour has significant impact on the Internet Service Providers' (ISPs) price setting strategies as shown recently in [1]-[5]. However, these papers focused mainly on short-term interactions of the ISPs, which - we believe - is not usually the case in practice as ISPs have to be aware of the long-term effects of their pricing decisions. Future-aware decision making is even more important if the structure of the local ISP market changes, e.g. a new ISP enters the market. In this paper, we address long-term pricing strategies of ISPs on local access markets with costumer loyalty. The contribution of the paper is threefold. Firstly, we present a case by empirical analysis for a user loyalty model, which differs from usual models as it is based on the price difference of the ISPs. Secondly, we present ISP pricing strategies on static ISP markets using game-theoretical tools. Thirdly, we model the dynamic ISP market with Stackelberg leader-follower game and propose equilibrium pricing strategies, taking into account the impacts of expected future incomes. Finally, we quantify and evaluate the effects of uncertainties of long-term decisions by simulating ISP markets.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126933895","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}