CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Top-percentile traffic routing problem by dynamic programming
Authors
A Odlyzko
Andreas Grothey
+10 more
D Goldenberg
E Altman
J Birge
J Levy
M Herzberg
M Paquet
VN Vapnik
W Powell
X Wang
Xinan Yang
Publication date
5 January 2011
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via different network providers. To make full use of the underlying networks with minimum cost, an optimal routing strategy is required by ISPs. This study investigates the optimal routing strategy in case where network providers charge ISPs according to top-percentile pricing. We call this problem the Top-percentile Traffic Routing Problem (TpTRP). The TpTRP is a multistage stochastic optimisation problem in which routing decision should be made before knowing the amount of traffic that is to be routed in the following time period. The stochastic nature of the problem forms the critical difficulty of this study. In this paper several approaches are investigated in modelling and solving the problem. We begin by modelling the TpTRP as a multi-stage stochastic programming problem, which is hard to solve due to the integer variables introduced by top-percentile pricing. Several simplifications of the original TpTRP are then explored in the second part of this work. Some of these allow analytical solutions which lead to bounds on the achievable optimal solution. We also establish bounds by investigation several "naive" routing policies. In the end, we explore the solution of the TpTRP as a stochastic dynamic programming problem by a discretization of the state space. This SDP model gives us achievable routing policies on medium size instances of TpTRP, which of course improve the naive routing policies. With a classification of the SDP decision table, a crude routing policy for realistic size instances can be developed from the smaller size SDP model. © 2011 Springer Science+Business Media, LLC
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Edinburgh Research Explorer
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.ed.ac.uk:publications...
Last time updated on 08/02/2015
University of Essex Research Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.essex.ac.uk:116...
Last time updated on 09/02/2017
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 23/03/2019