<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJOp</journal-id><journal-title-group><journal-title>Open Journal of Optimization</journal-title></journal-title-group><issn pub-type="epub">2325-7105</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojop.2014.34005</article-id><article-id pub-id-type="publisher-id">OJOp-51600</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  A Mathematical Model for Deriving Optimal Leasing Policies of a Satellite Operator
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>lena</surname><given-names>Sarri</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>George</surname><given-names>P. Papavassilopoulos</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>elena@netmode.ntua.gr(LS)</email>;<email>yorgos@netmode.ntua.gr(GPP)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>20</day><month>11</month><year>2014</year></pub-date><volume>03</volume><issue>04</issue><fpage>43</fpage><lpage>58</lpage><history><date date-type="received"><day>11</day>	<month>September</month>	<year>2014</year></date><date date-type="rev-recd"><day>14</day>	<month>October</month>	<year>2014</year>	</date><date date-type="accepted"><day>30</day>	<month>October</month>	<year>2014</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  This paper presents a dynamic mathematical model of optimal leasing allocation of satellite band-width and services in terms of expected revenues and associated risk. This tool meets the need of a Satellite Operator to determine the optimal leasing policy of the available bandwidth. A methodology and a tool for techno-economic evaluation of satellite services are developed. The output of the tool enables the policy decisions to be customized by the attitude toward risk that the company wants to apply at each time period. The study is based on inputs concerning data and services from an existing Satellite Operator and addresses a real situation. Demand and pricing data have been gathered from the international market. The decision making tool is given in the set-up of a decision tree presenting quantified alternative leasing policies and risks. Sensitivity analysis is also performed to measure the efficiency of the model.
 
</p></abstract><kwd-group><kwd>Decision Making Tool</kwd><kwd> Dynamic Model</kwd><kwd> Satellite Services</kwd><kwd> Techno-Economic Evaluation</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The evolutionary penetration of the satellite services and demand in the telecommunication market during the last decades has created the need for decision making tools for a satellite operator [<xref ref-type="bibr" rid="scirp.51600-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.51600-ref2">2</xref>] . There is still an incremental growth to the telecommunication applications and services [<xref ref-type="bibr" rid="scirp.51600-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.51600-ref4">4</xref>] . A number of studies have proposed methodologies and tools for the techno-economic evaluation of different aspects of satellite communication dealing with physical, operational, design performance and risk parameters [<xref ref-type="bibr" rid="scirp.51600-ref5">5</xref>] . The need for in-depth analysis of the economic feasibility of new telecommunication solutions that take into account both technological and econometric characteristics of the applications, has become obvious, both in industrial and academic community. This study deals with the creation and assessment of an optimal business policy of a Satellite Operator. The ability of real time decisions has a significant effect to the viability and profitability of the company in the growing and competitive satellite market. The decision making model presented here is an applied tool for assessment purposes, which deals with real problems and can be used as such, by any Satellite Operator. Limited work has addressed the revenue modeling [<xref ref-type="bibr" rid="scirp.51600-ref6">6</xref>] in terms of market penetration, expected profits and risks, in order to provide a quantitative estimation to the Satellite Operator (after the launching) for the optimal business decision making.</p><p>The problem of determining the optimal leasing policy for satellite services, at different time periods is similar to an inventory control problem, with evolution in time, incorporating dynamic and stochastic elements [<xref ref-type="bibr" rid="scirp.51600-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.51600-ref8">8</xref>] , modified accordingly to address the specific application [<xref ref-type="bibr" rid="scirp.51600-ref9">9</xref>] . The purpose of our work is to model and quantify this problem, using heuristic techniques, as well as to evaluate the outcome. The validation of this work results from its usage by the Greek Satellite Operator in the last five years and the development of a new methodology based on stochastic dynamic optimization, presented in [<xref ref-type="bibr" rid="scirp.51600-ref10">10</xref>] with similar results.</p><p>We present a model that compares different scenarios of combinations of customers asking to hire satellite capacity. There is a variety of services that a satellite can support. For each of these services requested by a customer, there is a different bandwidth demand, duration of lease, and a different price. The purpose of this work is to find the most profitable case for the incumbent operator. Each scenario leads to a decision tree. This maximization problem is described in terms of real and expected revenues, along with the corresponding probability of getting them. The final outcome leads to optimal enterprise steps that maximize revenues and enable the evaluation of different contingency plans. The decisions are taken successively in a time horizon and thus the presented tool incorporates time evolution. Consequently the model is dynamic.</p><p>At the first stage of the work, demand and pricing data have been gathered from the international market. These data provided by the operating Satellite firm i) are statistically processed to produce mean values and standard deviations for each service and each bandwidth demand when needed, and ii) are integrated into a mathematical model, implemented at the second stage, and taking into account all possible states and stages [<xref ref-type="bibr" rid="scirp.51600-ref11">11</xref>] . The model evaluates all probable revenues, along with their associated risks that could result from each alternative decision branch. The concept of the tool gives the benefit of accessing alternative courses of action, to the decision maker. Depending on the company policy at each time period, variant enterprise steps could be followed. Sensitivity analysis is included, in order to determine the impact of small errors in parameters estimates to the final decision. It is performed using both mathematical calculation of the shadow prices and heuristic calculation, providing consistent results.</p><p>The paper is organized as follows: Sections 2 and 3 describe the stages of work followed and the main concept of the model. Section 4 formulates the mathematical model and Section 5 presents the sensitivity analysis of the proposed model.</p></sec><sec id="s2"><title>2. Stages of Work</title><p>The first stage of this study involves the recording and the evaluation of the pricing data coming from the international market of leasing satellite capacity as well as their statistical processing. Some charging schemes have been proposed for broadband networks while this work involves real pricing data [<xref ref-type="bibr" rid="scirp.51600-ref12">12</xref>] . A decision making tool that maximizes the profits of a satellite operator, is implemented in the second stage. The goal of the proposed model is to enable the decision maker, to determine the best possible scenario for the satellite operator, which is the scenario with the larger amount of income.</p><p>The hypothesis that a satellite operator has different lease demands from different customers is made. Each customer wants to hire satellite capacity with a specified bandwidth, for a given lease period, which has an associated cost. The model output provides guidelines on the combination of customers that is the most profitable for the operator.</p><p>A scenario can be customized by entering the characteristics of the customers. These are:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x5.png" xlink:type="simple"/></inline-formula>: the type of the requested service,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x6.png" xlink:type="simple"/></inline-formula>: the ascending number of customer <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x7.png" xlink:type="simple"/></inline-formula></p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x8.png" xlink:type="simple"/></inline-formula>(MHz): the capacity in MHz that the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x9.png" xlink:type="simple"/></inline-formula>-th costumer requires<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x10.png" xlink:type="simple"/></inline-formula>. If the required capacity is more than 36 MHz, then it can occupy one or more transponders completely. Therefore, for our calculations instead of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x11.png" xlink:type="simple"/></inline-formula> we compute<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x12.png" xlink:type="simple"/></inline-formula>, which is the remaining capacity that does not occupy a whole transponder: <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x13.png" xlink:type="simple"/></inline-formula></p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x14.png" xlink:type="simple"/></inline-formula>: the starting time (month) for which the k-th customer requires the leasing of capacity<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x15.png" xlink:type="simple"/></inline-formula>, considering a horizon of five years<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x16.png" xlink:type="simple"/></inline-formula>,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x17.png" xlink:type="simple"/></inline-formula>: the ending time (month) for which the k-th customer requires the leasing of capacity<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x18.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x19.png" xlink:type="simple"/></inline-formula>, and</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x20.png" xlink:type="simple"/></inline-formula>: the corresponding cost of lease, in Euros, for the k-th customer depending on the type of the requested service.</p><p>In the structure of the model, the possibility of beginning the hire in different time periods (different months) is included. <xref ref-type="table" rid="table1">Table 1</xref> shows an example of the input parameters of the model.</p><p>The indicative cost for each service, is calculated using the data collected from the global satellite market. From the gathered data we created a basic classification of the possible services that a satellite operator could offer. These services correspond to different bandwidth demands and are presented in <xref ref-type="table" rid="table2">Table 2</xref>. The statistical analysis includes the pricing for the equivalent capacity, per 36 MHz, per month and the duration of lease in months. For each service, the mean value, the standard deviation, and the percentage of difference between standard deviation and mean value of these measures are determined along with their cross-correlation. Similar quantities are calculated for the duration of hire.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Input parameters</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >K</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x21.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x22.png" xlink:type="simple"/></inline-formula> (month)</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x23.png" xlink:type="simple"/></inline-formula> (month)</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x24.png" xlink:type="simple"/></inline-formula> (month)</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x25.png" xlink:type="simple"/></inline-formula> (MHz)</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x26.png" xlink:type="simple"/></inline-formula> (KEuros)</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >A</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >12</td><td align="center" valign="middle" >15</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >B</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >8</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >20</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >C</td><td align="center" valign="middle" >2</td><td align="center" valign="middle" >20</td><td align="center" valign="middle" >19</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >D</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >22</td><td align="center" valign="middle" >17</td><td align="center" valign="middle" >5</td><td align="center" valign="middle" >10</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >E</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >16</td><td align="center" valign="middle" >16</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >5</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >F</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >5</td><td align="center" valign="middle" >5</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >G</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >8</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >30</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >H</td><td align="center" valign="middle" >11</td><td align="center" valign="middle" >15</td><td align="center" valign="middle" >5</td><td align="center" valign="middle" >19</td><td align="center" valign="middle" >20</td></tr><tr><td align="center" valign="middle" >9</td><td align="center" valign="middle" >I</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >27</td><td align="center" valign="middle" >8</td><td align="center" valign="middle" >9</td></tr><tr><td align="center" valign="middle" >10</td><td align="center" valign="middle" >J</td><td align="center" valign="middle" >3</td><td align="center" valign="middle" >23</td><td align="center" valign="middle" >21</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >3</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Types of services</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >s</th><th align="center" valign="middle" >Services</th></tr></thead><tr><td align="center" valign="middle" >1</td><td align="center" valign="middle" >VSAT</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >Telephony</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >IP Gateway</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >Corporate</td></tr><tr><td align="center" valign="middle" >5</td><td align="center" valign="middle" >Broadcast</td></tr><tr><td align="center" valign="middle" >6</td><td align="center" valign="middle" >Video Contribution</td></tr><tr><td align="center" valign="middle" >7</td><td align="center" valign="middle" >Media company</td></tr><tr><td align="center" valign="middle" >8</td><td align="center" valign="middle" >Government</td></tr></tbody></table></table-wrap></sec><sec id="s3"><title>3. Concept of the Model</title><p>The underlying concept of the problem of optimal allocation of the available satellite spectrum is based on a heuristic approach of the inventory control problem [<xref ref-type="bibr" rid="scirp.51600-ref7">7</xref>] . In the context of the proposed work, the model enables the comparison of 10 at most possible incoming customers with maximum required lease duration of 60 months, corresponding to a typical level of satellite demand. However, the model can easily be expanded to compare more customers requiring satellite capacity, for more than 5 years.</p><p>All the possible combinations of customers are calculated (see <xref ref-type="fig" rid="fig1">Figure 1</xref> Group A), where a description of these combinations is given in terms of feasibility to implement or not. Specifically, there is an indication of Possible, Not Possible or Negotiable Combination for each combination of customers.</p><p>A Negotiable Combination is the combination of customers that exceeds by 1 MHz at most the highest possible capacity that a transponder can serve i.e. 36 MHz, which can probably constitute an issue of negotiation between the provider and the consumer. A Possible Combination is the feasible combination of customers from the point of view of the maximum capacity of the transponder and a Not Possible Combination is a not feasible one. The proposed tool gives the benefit of sorting by the Description of combination in order to present all the Possible Combinations (see <xref ref-type="fig" rid="fig1">Figure 1</xref> Group B). The next step is to extract the Possible Combinations that are best to compare, by examining the most promising ones. This is done by selecting the combinations with the highest amount of total occupied capacity, which is the sum of the requested capacity by each customer of the combination (see <xref ref-type="fig" rid="fig1">Figure 1</xref> Group C). Obviously, the more bandwidth is occupied from a transponder, the more profit there will be for the firm. These are the “Real Revenues”. This confines the search for the best case scenario to a small number of possible combinations.</p><p>The next step is to decide which of these combinations, with high occupied capacity, are more profitable. The criteria that are used to lead to the optimum combination are:</p><p>a) the amount of Real Revenues, representing the revenues that an operator will gain from hiring the capacity to the customers of each combination,</p><p>b) the calculation of Additional Expected Future Profits for the satellite operator, taking into consideration the standard deviation of the prices and consequently the corresponding risk.</p><p>Each combination has different time of maximum requested capacity hire. Therefore, in order to properly compare different scenarios, it is necessary to reduce them to the same time period i.e. to the same month of maximum hiring. We include to our calculations the additional possible income that can be acquired by this left over-free capacity that is called the “Remaining Capacity” (C Remaining). It is also possible that at specific months, not all the available capacity of the transponder of the satellite will be occupied with each combination. This leads to the undesirable effect of not having maximum occupancy of the transponder of the satellite, at each month. So the satellite operator could probably hire out this available capacity, to other possible future customers that are not included in the combination, and gain more revenues. This is called the “Empty Capacity” (C Empty). These moreover profits, consist the Additional Expected Future Profits.</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Possible combinations of customers</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x27.png"/></fig><p>Let us examine the following example involving two cases that a satellite operator may need to compare and decide which one leads to maximum revenues. These are Scenario 1, which includes the combination of the customer number 1, 2, 3, 4 and 5 (<xref ref-type="fig" rid="fig2">Figure 2</xref>) and Scenario 2, which includes the combination of the customer number 6, 7, 8, 9 and 10 (<xref ref-type="fig" rid="fig3">Figure 3</xref>), with the characteristics shown in <xref ref-type="table" rid="table1">Table 1</xref>.</p><p>The sum of the occupied capacity of the transponder by the customers of the combinations in Scenario 1 and Scenario 2 are shown in <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref>, respectively. These figures represent the profile of the satellite transponder occupancy.</p><p>In Scenario 1, the maximum demand on the transponder’s capacity occurs during the 22nd month, while in Scenario 2, it occurs during the 30th month. The additional possible income that can be acquired from this left over free capacity is calculated. This is the “Remaining Capacity” (C Remaining) and appears at the white region in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p><p>Each Scenario does not lead to maximum occupancy of the transponder of the satellite at each month. This “Empty Capacity” (C Empty) is shown as the lined region of <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref>. For instance, in Scenario 1 (<xref ref-type="fig" rid="fig4">Figure 4</xref>) there are 21 MHz of unoccupied capacity during the 1st month, 20 MHz during the 2nd month, 5 MHz from the 3rd to the 5th month, 0 MHz between the 5th and the 10th month, etc. These expected profits are included to our calculations.</p><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Scenario 1</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x28.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Scenario 2</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x29.png"/></fig><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Scenario 3</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x30.png"/></fig><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Scenario 4</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x31.png"/></fig></sec><sec id="s4"><title>4. Structure of the Tool</title><p><xref ref-type="fig" rid="fig6">Figure 6</xref> shows the general structure of the model. This was implemented in Microsoft. NET environment in order to meet the need for increased computational burden. All feasible combinations of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x32.png" xlink:type="simple"/></inline-formula> objects per<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x32.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x33.png" xlink:type="simple"/></inline-formula>, are</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x34.png" xlink:type="simple"/></inline-formula>, with<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x35.png" xlink:type="simple"/></inline-formula>. All feasible combinations of 10 customers per 10, starting from 2 customers per 2 and more, are<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x34.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x36.png" xlink:type="simple"/></inline-formula>. It is meaningless to include cal-</p><p>culations with only one customer, since this will not result to maximization of the profits for the operator.</p><p>The tool starts with the input as shown in <xref ref-type="table" rid="table1">Table 1</xref>, which is the demand of the customers that arrives to the satellite operator. Then all the combinations of customers are being calculated taking into account the evolution in time. The possible revenues for each scenario resulting from the leasing of the Remaining and the Empty Capacity are computed, using demand and pricing Parameters.</p><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Structure of the tool</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x37.png"/></fig><sec id="s4_1"><title>4.1. Calculation of All Combinations of k Customers per k</title><p>All the possible combinations of the customers (PCf), <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x38.png" xlink:type="simple"/></inline-formula>are:</p><disp-formula id="scirp.51600-formula75"><graphic  xlink:href="http://html.scirp.org/file/1-2730060x39.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.51600-formula76"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x40.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x41.png" xlink:type="simple"/></inline-formula> are auxiliary parameters for the requested capacity of each customer and each combination. We introduce the requirement for non zero value of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x42.png" xlink:type="simple"/></inline-formula> in order to avoid the calculations of combinations with a single customer.</p><p>For our calculations we specify the following intermediate parameters:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x43.png" xlink:type="simple"/></inline-formula>: the numbered month for which the i-th customer requires the lease of capacity wk, at the j-th month. This parameter divides into pieces, with length of one month, and numbers the time interval t<sub>k</sub></p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x44.png" xlink:type="simple"/></inline-formula>.</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x45.png" xlink:type="simple"/></inline-formula>: the capacity that the i-th costumer requires, at the j-th month</p><disp-formula id="scirp.51600-formula77"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x46.png"  xlink:type="simple"/></disp-formula><p>We assign<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x47.png" xlink:type="simple"/></inline-formula>, as the total capacity for the (PCf) combination at the j-th month.</p></sec><sec id="s4_2"><title>4.2. Calculation of Revenues from C Empty</title><p>For each scenario the possible revenues from the future leasing of the “Empty Capacity” up to the 36 MHz, are calculated.</p><p>The Empty Capacity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x48.png" xlink:type="simple"/></inline-formula> for each combination of customers (PCf), at the j-th month is:</p><disp-formula id="scirp.51600-formula78"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x49.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x50.png" xlink:type="simple"/></inline-formula> is the capacity of the i-th customer of the f-th combination (PCf) at the j-th month, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x51.png" xlink:type="simple"/></inline-formula> is the maximum ending month of each combination (PCf) which coincides with the<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x52.png" xlink:type="simple"/></inline-formula>.</p><p>This calculation is categorized depending on the amount of bandwidth that is not used each month by the customers of each combination. This “Empty Capacity” could potentially be hired out and generate revenues. The selected ranges of capacity in MHz are shown in <xref ref-type="table" rid="table3">Table 3</xref>, resulting from the gathered data.</p><p>We are considering <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula> <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula> as the central value of capacity for each range of the unused bandwidth, corresponding to a certain probability<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x55.png" xlink:type="simple"/></inline-formula>, a mean value <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x56.png" xlink:type="simple"/></inline-formula> and a standard deviation<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x57.png" xlink:type="simple"/></inline-formula>. Each range, has a bandwidth of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x58.png" xlink:type="simple"/></inline-formula>, in MHz. The initial value for <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x57.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x58.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x59.png" xlink:type="simple"/></inline-formula> corresponds</p><p>to a capacity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x60.png" xlink:type="simple"/></inline-formula> and the ending value <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x61.png" xlink:type="simple"/></inline-formula> corresponds to the highest possible capacity of the transponder,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x62.png" xlink:type="simple"/></inline-formula>.</p><p>We use the notation:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x63.png" xlink:type="simple"/></inline-formula>: the mean value price, per MHz, per month, asking for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x64.png" xlink:type="simple"/></inline-formula>-th range of bandwidth,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x65.png" xlink:type="simple"/></inline-formula>: the standard deviation of the value price, per MHz, per month, asking for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x66.png" xlink:type="simple"/></inline-formula>-th range of bandwidth,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x67.png" xlink:type="simple"/></inline-formula>: the probability of appearance of a customer asking for the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x68.png" xlink:type="simple"/></inline-formula>-th range of bandwidth, and</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x69.png" xlink:type="simple"/></inline-formula>: the probability of appearance of a customer asking for satellite services.</p><p>The selected capacity ranges along with the corresponding probability of appearance of a new incoming customer, have been statistically computed by the available gathered data (<xref ref-type="fig" rid="fig7">Figure 7</xref>), and constitute the Parameter data set (<xref ref-type="fig" rid="fig6">Figure 6</xref>).</p><p>A decision tree arises for each scenario, as shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>.</p><fig id="fig7"  position="float"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Pricing schemes (mean value price, standard deviation per MHz, per month, probability of appearance of a customer, in one month) for each range of Empty Capacity</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x70.png"/></fig><fig id="fig8"  position="float"><label><xref ref-type="fig" rid="fig8">Figure 8</xref></label><caption><title> Revenues from C empty</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x71.png"/></fig><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Ranges of empty capacity</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >n</th><th align="center" valign="middle" >1</th><th align="center" valign="middle" >2</th><th align="center" valign="middle" >3</th><th align="center" valign="middle" >4</th><th align="center" valign="middle" >5</th><th align="center" valign="middle" >6</th><th align="center" valign="middle" >7</th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x72.png" xlink:type="simple"/></inline-formula>(MHz)</td><td align="center" valign="middle" >1.3</td><td align="center" valign="middle" >4</td><td align="center" valign="middle" >6</td><td align="center" valign="middle" >10</td><td align="center" valign="middle" >18</td><td align="center" valign="middle" >33</td><td align="center" valign="middle" >36</td></tr></tbody></table></table-wrap><p>The Expected Values of theoretical income, resulting from the “Empty Capacity” for each combination, depending on the not-leased bandwidth at each time period, are calculated as:</p><disp-formula id="scirp.51600-formula79"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x73.png"  xlink:type="simple"/></disp-formula><p>The standard deviation of the Expected Value, for each combination is:</p><disp-formula id="scirp.51600-formula80"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x74.png"  xlink:type="simple"/></disp-formula><p>The probable revenues for each combination, which are called Theoretical Revenues, depending on the number of MHz that are not used, are calculated as:</p><disp-formula id="scirp.51600-formula81"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x75.png"  xlink:type="simple"/></disp-formula><p>While the standard deviation of the Theoretical Revenues for each combination is:</p><disp-formula id="scirp.51600-formula82"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x76.png"  xlink:type="simple"/></disp-formula><p>The Expected Values of Revenues are calculated as intermediate volumes, which are used only for comparison purposes among scenarios. Such revenues incorporate the corresponding risk, and measure the monetary value of each scenario. The values of Theoretical Revenues are the real amounts of money (in Euros) that can be acquired, following each branch of the decision tree.</p></sec><sec id="s4_3"><title>4.3. Calculation of Revenues from C Remaining</title><p>We proceed analogously calculating all possible revenues, (Expected Values and Theoretical Revenues) that can result from the leasing of the “Remaining Capacity”. This calculation is categorized depending on the type of service (s), using the statistically processed data (<xref ref-type="fig" rid="fig9">Figure 9</xref>), forming a decision tree (<xref ref-type="fig" rid="fig1">Figure 1</xref>0 up).</p><p>First, we calculate the remaining time<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x77.png" xlink:type="simple"/></inline-formula>, which is the time interval for each combination, between the</p><p>maximum requested month of lease by the customers of the (PCf) combination, until the max requested time of all compared scenarios.</p><disp-formula id="scirp.51600-formula83"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x78.png"  xlink:type="simple"/></disp-formula><p>The following variables are introduced:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x79.png" xlink:type="simple"/></inline-formula>: the probability of appearance of a customer, in one month, asking for service s.</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x80.png" xlink:type="simple"/></inline-formula>: the mean value price per 36 MHz per month, asking for service s.</p><fig id="fig9"  position="float"><label><xref ref-type="fig" rid="fig9">Figure 9</xref></label><caption><title> Pricing schemes (mean value price, standard deviation per 36 MHz, per month, probability of appearance of a customer, in one month) for each service</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x81.png"/></fig><fig id="fig10"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>0</label><caption><title> Output of the model-decision tree</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x82.png"/></fig><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x83.png" xlink:type="simple"/></inline-formula>: the standard deviation of the value price, per 36 MHz, per month, asking for service s.</p><p>These variables also constitute the Parameter data set and have been statistically calculated by the available gathered data.</p><p>The Expected Values of theoretical income for the Remaining Capacity depending on the type of service are:</p><disp-formula id="scirp.51600-formula84"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x84.png"  xlink:type="simple"/></disp-formula><p>The standard deviation of the Expected Value for each combination is:</p><disp-formula id="scirp.51600-formula85"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x85.png"  xlink:type="simple"/></disp-formula><p>While the Theoretical Revenues for the Remaining Capacity are:</p><disp-formula id="scirp.51600-formula86"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x86.png"  xlink:type="simple"/></disp-formula><p>and the standard deviation of the Theoretical Revenues for each combination is:</p><disp-formula id="scirp.51600-formula87"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x87.png"  xlink:type="simple"/></disp-formula><p>All the calculations concerning demand as well as the mean values of the prices of lease and standard deviations of prices are based on statistical computation of the real data coming from the international market and constitute the Parameter data set.</p></sec><sec id="s4_4"><title>4.4. Output Function Formulation</title><p>All of these evaluated data are presented in the form of a unified decision tree (<xref ref-type="fig" rid="fig1">Figure 1</xref>0), which is the output of the model.</p><p>The amount of Total Expected Revenues that will estimate the optimal policy for the firm is the sum of all revenues. This sum consists of the Real Revenues, plus the Expected Value resulting from the leasing of the Empty Capacity, plus the Expected Value resulting from the leasing of the Remaining Capacity, including their standard deviations, which are the Additional Expected Future Profits.</p><p>The Real Revenues are:</p><disp-formula id="scirp.51600-formula88"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x88.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x89.png" xlink:type="simple"/></inline-formula> is the corresponding cost of lease, for the k-th customer, of the f-th combination, requested by</p><p>the satellite operator, and belongs to the Input Parameters. An indicative cost, for each service, which applies to the international market, has been calculated by the gathered data. These values provide information to the incumbent operator for the current trends of satellite services billing and can be modified accordingly.</p><p>The Total Expected Revenues give a range of values, defining the best and worst case scenario for the revenues of the satellite operator.</p><disp-formula id="scirp.51600-formula89"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x90.png"  xlink:type="simple"/></disp-formula><p>where:</p><disp-formula id="scirp.51600-formula90"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x91.png"  xlink:type="simple"/></disp-formula><p>and</p><disp-formula id="scirp.51600-formula91"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x92.png"  xlink:type="simple"/></disp-formula><p>The real amount of money, resulting from each brand of the decision tree that will possibly result to the satellite operator is:</p><disp-formula id="scirp.51600-formula92"><label>(17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x93.png"  xlink:type="simple"/></disp-formula><p>where:</p><disp-formula id="scirp.51600-formula93"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x94.png"  xlink:type="simple"/></disp-formula><p>and</p><disp-formula id="scirp.51600-formula94"><label>(19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x95.png"  xlink:type="simple"/></disp-formula><p>This gives the opportunity to the satellite provider to determine which combination is the most profitable, for the present and in the future. The decision is made using the amount of Total Expected Revenues. This is not the real revenue that can be acquired, but it is an intermediate amount, which takes into account the corresponding probabilities, and is used for comparison purposes of the scenarios. The Total Expected Revenues is a decision quantity that incorporates profits and associated risk. This amount gives an estimate of the extent/worthness of the risk.</p><p>The decision making process starts from the identification of the highest Real Revenues, then the possible additional revenues are considered with their corresponding standard deviation that measures risk. This result to a</p><p>range of Total Expected Revenues with central value:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x96.png" xlink:type="simple"/></inline-formula>, upper limit: <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x97.png" xlink:type="simple"/></inline-formula> and lower limit:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x96.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x97.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x98.png" xlink:type="simple"/></inline-formula>.</p><p>The final decision depends on the extent of risk that the firm is willing to take and on the particular policy that wants to apply. For a risk-loving decision maker the policy generating the highest Total Expected Revenues (upper limit) is chosen. A risk-neutral decision maker will take the policy with the central value, whereas for a risk-averse decision maker the policy generating the lowest of Total Expected Revenues (lower limit) will be chosen. The real amount of income that will result from each decision is the amount of Total Revenues of the corresponding scenario.</p></sec></sec><sec id="s5"><title>5. Sensitivity Analysis</title><p>Sensitivity analysis is necessary in validating the efficiency of a model. Due to the stochastic nature of the input parameters, we calculate the variance to the output of the model, caused by small variation of the input. The statistical processing of the pricing data gathered from the international market provided us with pricing and probability parameters. Since these variables may not be very accurate, we study the effect caused by small errors on their values.</p><p>These parameters include three categories:</p><p> pricing and demand (probability) data concerning the Remaining Capacity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x99.png" xlink:type="simple"/></inline-formula> categorized on each type of service,</p><p> pricing and demand (probability) data concerning the Empty Capacity <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x100.png" xlink:type="simple"/></inline-formula> categorized on each selected range of capacity and</p><p> the Probability of a new incoming customer asking the Satellite provider for satellite services<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x101.png" xlink:type="simple"/></inline-formula>.</p><p>The sensitivity analysis for these input parameters was performed by creating a small perturbation for each one of them. The value of each parameter was varied by &#177;2% and the corresponding change in the output, which is the Total Expected Revenues (TER), was measured. The analysis was performed in two different ways: first by theoretical calculation of the shadow prices of the input parameters and second using a heuristic technique, implemented by immediate application of the input-change to the model and observation of the output.</p><sec id="s5_1"><title>5.1. Mathematical Calculation</title><p>The shadow prices of the price parameters<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x102.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x103.png" xlink:type="simple"/></inline-formula>where computed as the derivative of the output function TER, in the traditional sense of calculus:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x104.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x105.png" xlink:type="simple"/></inline-formula> is the objective function and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x103.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x104.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x106.png" xlink:type="simple"/></inline-formula> is the</p><p>parameter that we would like to examine.</p><p>The Sensitivity of the Total Expected Revenues with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x107.png" xlink:type="simple"/></inline-formula> is:</p><disp-formula id="scirp.51600-formula95"><label>(20)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x108.png"  xlink:type="simple"/></disp-formula><p>The Sensitivity of the Total Expected Revenues with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x109.png" xlink:type="simple"/></inline-formula> is:</p><disp-formula id="scirp.51600-formula96"><label>(21)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x110.png"  xlink:type="simple"/></disp-formula><p>We proceed calculating the Bode Sensitivity function for the demand parameters<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x111.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x112.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x113.png" xlink:type="simple"/></inline-formula>. The Bode Sensitivity of the function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x113.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x114.png" xlink:type="simple"/></inline-formula> with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x111.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x112.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x113.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x115.png" xlink:type="simple"/></inline-formula> is calculated as:</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x116.png" xlink:type="simple"/></inline-formula>. This normalized sensitivity is more appropriate for the estimations concern-</p><p>ing probabilities parameter, expressing the variation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x117.png" xlink:type="simple"/></inline-formula> subject to the standard value of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x118.png" xlink:type="simple"/></inline-formula>, in relation to the variation <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x119.png" xlink:type="simple"/></inline-formula> subject to the value of the parameter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x119.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x120.png" xlink:type="simple"/></inline-formula>.</p><p>The Sensitivity of the Total Expected Revenues with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x121.png" xlink:type="simple"/></inline-formula> is:</p><disp-formula id="scirp.51600-formula97"><label>(22)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x122.png"  xlink:type="simple"/></disp-formula><p>The Sensitivity of the Total Expected Revenues with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x123.png" xlink:type="simple"/></inline-formula> is:</p><disp-formula id="scirp.51600-formula98"><label>(23)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x124.png"  xlink:type="simple"/></disp-formula><p>The Sensitivity of the Total Expected Revenues with respect to the parameter <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x125.png" xlink:type="simple"/></inline-formula> is:</p><disp-formula id="scirp.51600-formula99"><label>(24)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-2730060x126.png"  xlink:type="simple"/></disp-formula><p>All parameters ranges, involved in the calculation of the sensitivity analysis are presented in <xref ref-type="table" rid="table4">Table 4</xref>, resulting by the statistical analysis. Let us note that we consider a time period of 30 months allocated to the Remaining Capacity and 30 months allocated to the Empty Capacity. We calculated the summation of the Empty Capacity for each combination of customers<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x127.png" xlink:type="simple"/></inline-formula>, over the total time period of 60 months, presume that for the months allocated to the Empty Capacity, only the 1/8 of the total available capacity of the transponder will be unoccupied. This assumption is compatible with the desirable requirement of choosing combinations of customers, with maximum occupation of the transponder, for the maximum time period.</p><p><xref ref-type="table" rid="table5">Table 5</xref>, summarizes the change to the output (minimum-maximum value) of the model caused by 2% change of the price and demand parameters considered. The analysis showed very small sensitivity to the demand parameter (probabilities<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x128.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x129.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x130.png" xlink:type="simple"/></inline-formula>). On the other hand this mathematical calculation determined a wide ranging on the pricing parameters, with higher ranging to the parameter<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x130.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x131.png" xlink:type="simple"/></inline-formula>. In order to derive limits of bounds of accuracy to the parameters above, we proceed with the heuristic approach.</p></sec><sec id="s5_2"><title>5.2. Heuristic Calculation</title><p>The Sensitivity analysis is now performed by immediate application of the variance of each input parameter, by &#177;2%, to the input of the model, and measuring of the output. A case study of six incoming customers, arriving to the satellite operator has been evaluated.</p><p>Two cases were considered. The best case scenario, which is the scenario generating the larger amount of expected revenues. This was identified by choosing for the calculations of the Remaining Capacity those that result from the Media Company Service, since it is the one with the highest pricing. The second case considered was the worst case scenario. This case accordingly resulted from the choice of Broadcast Service for the calculations of the expected revenues of the Remaining Capacity, which is the one with the lowest pricing. For each of these cases the calculations were extended to considering the upper limit and the lower limit of the Total Expected Revenues. A sensitivity analysis was performed for these 4 cases.</p><p>Using this small variation for each of the input parameters and for each case, we calculated 20 points of the output of the decision model, corresponding to different percentages of change of the input parameters between the ranges of &#177;2% of the central value.</p><p>For each change of input, the change of the output was calculated. This change has the form of the percentage of difference of the value of the output calculated for each of the 20 points of change to the input, minus the value of the output at the central point (11th point, with zero alteration), normalized to this central value.</p><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> Parameters values ranges</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Variable</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x132.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x133.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x134.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x135.png" xlink:type="simple"/></inline-formula>(K€)</th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x136.png" xlink:type="simple"/></inline-formula>(K€)</th></tr></thead><tr><td align="center" valign="middle" >min</td><td align="center" valign="middle" >0.62</td><td align="center" valign="middle" >0.0164</td><td align="center" valign="middle" >0.015</td><td align="center" valign="middle" >4.148</td><td align="center" valign="middle" >125.100</td></tr><tr><td align="center" valign="middle" >max</td><td align="center" valign="middle" ></td><td align="center" valign="middle" >0.270</td><td align="center" valign="middle" >0.277</td><td align="center" valign="middle" >6.114</td><td align="center" valign="middle" >295.834</td></tr></tbody></table></table-wrap><table-wrap id="table5" ><label><xref ref-type="table" rid="table5">Table 5</xref></label><caption><title> Sensitivity analysis results</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x137.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x138.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x139.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x140.png" xlink:type="simple"/></inline-formula></th><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x141.png" xlink:type="simple"/></inline-formula></th></tr></thead><tr><td align="center" valign="middle" >min</td><td align="center" valign="middle" >0.06%</td><td align="center" valign="middle" >0.02%</td><td align="center" valign="middle" >0.0002%</td><td align="center" valign="middle" >0.0001%</td><td align="center" valign="middle" >0.0089%</td></tr><tr><td align="center" valign="middle" >max</td><td align="center" valign="middle" >16.63%</td><td align="center" valign="middle" >45.28%</td><td align="center" valign="middle" >0.09%</td><td align="center" valign="middle" >0.02%</td><td align="center" valign="middle" >0.16%</td></tr></tbody></table></table-wrap><p>The results of the sensitivity analysis for the best case scenario are shown in Figures 11-14. For each of the 20 different input sets we calculated the output on the four most profitable combinations of customers. Scenario1, is the scenario with the higher amount of Total Expected Revenues, Scenario 2 is the one with the second higher amount of Total Expected Revenues and so on.</p><fig id="fig11"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>1</label><caption><title> Sensitivity analysis for Scenario 1</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x142.png"/></fig><fig id="fig12"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>2</label><caption><title> Sensitivity analysis for Scenario 2</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x143.png"/></fig><fig id="fig13"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>3</label><caption><title> Sensitivity analysis for Scenario 3</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x144.png"/></fig><fig id="fig14"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref>4</label><caption><title> Sensitivity analysis for Scenario 4</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-2730060x145.png"/></fig><p>In Scenario 2 (<xref ref-type="fig" rid="fig1">Figure 1</xref>2), we observe a zero sensitivity of parameters<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x146.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x146.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x147.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x146.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x147.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x148.png" xlink:type="simple"/></inline-formula>. This is happening because the amounts of the Remaining Capacity, the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x146.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x147.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x148.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-2730060x149.png" xlink:type="simple"/></inline-formula> and the Empty Capacity for this combination of</p><p>customers are zero.</p><p>The calculations were made for all 46 input parameters, categorized as shown in <xref ref-type="table" rid="table4">Table 4</xref> and <xref ref-type="table" rid="table5">Table 5</xref>, extended to all of the 4 most profitable combinations, for both the best and worst case scenario. The most characteristic ones were presented. The results turned out to be similar.</p><p>The analysis showed very low sensitivity of the output to changes in the input parameters, even to the pricing parameters. The outcome using Heuristic calculations for the Sensitivity analysis were consistent with the outcome from the mathematical calculations. A small change to the pricing and to the demand parameters will not significantly change the output of the model. This is a very desirable feature, resulting from the good balancing of the proposed model. Even if the parameter data are not very accurate, the decision will not be greatly affected.</p></sec></sec><sec id="s6"><title>6. Conclusions</title><p>In this paper, we consider the techno-economic valuation of satellite services. The incremental growth of the satellite market nowadays, makes important the study of the economic feasibility of a satellite operator considering technological aspects of the application.</p><p>A dynamic mathematical model addressing the decision needs of an operator that provides satellite services is created. This decision making tool considers different demands of customers that arrive to the satellite operator.</p><p>Demand and pricing data have been gathered and statistically processed, from the international market. We present a model that compares different scenarios of combinations of customers with different demands, asking to hire satellite capacity. The model evaluates all probable revenues, along with their associated risks that could result from each decision branch. The tool incorporates all the valuable information that will help the satellite operator to determine the most profitable leasing scenario and allows alternative courses of enterprising steps depending on the company policy.</p><p>Sensitivity analysis has been included and showed a very small impact of the uncertainty of the input demand and pricing parameters to the final decision. This analysis could also be extended on simultaneous changes of several combinations of input parameters. This work addresses the real need of optimal satellite business planning. Other analysis was mainly referred to the economic evaluation to the physical layer of satellite planning.</p><p>The benefits of the model and of the analysis presented here for any satellite operator are clear. The same benefits may apply to related areas of activity where leasing of specific volumes to customers is the essence of the business enterprise.</p><p>Finally, we are currently extending our work, using the dynamic programming formulation, in discrete time and with stochastic elements.</p></sec><sec id="s7"><title>Acknowledgements</title><p>This research has been co-financed by the European Union (European Social Fund—ESF) and Greek national funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)-Research Funding Program: THALES, Investing in knowledge society through the European Social Fund. The authors would also like to express their appreciation to Hellas Sat [<xref ref-type="bibr" rid="scirp.51600-ref13">13</xref>] , the Greek Satellite Operator, for their valuable support in data providing, developed tool usage and validation through business practice.</p></sec></body><back><ref-list><title>References</title><ref id="scirp.51600-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Haase, E., Christensen, C.B. and Ten, C.H. (2012) Global Commercial Space Industry Indicators and Trends. Acta Astronautica, 50, 747-757. http://dx.doi.org/10.1016/S0094-5765(02)00005-X</mixed-citation></ref><ref id="scirp.51600-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Marchese, M. and Jamalipour, A. (2005) Key Technologies and Applications of Present and Future Satellite Communications. IEEE Wireless Communications, 12, 8-9. http://dx.doi.org/10.1109/MWC.2005.1522097</mixed-citation></ref><ref id="scirp.51600-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">NSR (2010) Global Assessment of Satellite Supply &amp; Demand. 8th Edition. http://www.nsr.com/research-reports/</mixed-citation></ref><ref id="scirp.51600-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Wood, D. and Weigel, A. (2012) A Framework for Evaluating National Space Activity. Acta Astronautica, 73, 221236. http://dx.doi.org/10.1016/j.actaastro.2011.11.013</mixed-citation></ref><ref id="scirp.51600-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Henri, Y. and Nozdrin, V. (2012) Economic Methods of Improving Efficient Use of the Orbit/Spectrum Resource by Satellite Systems. Space Policy, 28, 185-191. http://dx.doi.org/10.1016/j.spacepol.2012.07.001</mixed-citation></ref><ref id="scirp.51600-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Saleh, J.H. and Padilla, J.P.T. (2007) Beyond Cost Models: Communications Satellite Revenue Models. Integrating Cost Considerations into a Value-Centric Mindset. International Journal of Satellite Communications and Networking, 25, 69-92. http://dx.doi.org/10.1002/sat.863</mixed-citation></ref><ref id="scirp.51600-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Bertsekas, D.P. (2007) Dynamic Programming and Optimal Control. 3rd Edition, Athena Scientific, Belmont.</mixed-citation></ref><ref id="scirp.51600-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Ross, S.M. (1983) Introduction to Stochastic Dynamic Programming. Academic Press, New York.</mixed-citation></ref><ref id="scirp.51600-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Maral, G. and Bousquet, M. (1998) Satellite Communications Systems: Systems, Techniques and Technology. 3rd Edition, John Wiley &amp; Sons Ltd., New York.</mixed-citation></ref><ref id="scirp.51600-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Sarri, E. (2007) Modelling and Techno-Economic Evaluation of Telecommunication—Satellite Services Using Optimization Techniques. Ph.D. Thesis, National Technical University of Athens, Athens.</mixed-citation></ref><ref id="scirp.51600-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Pace, P. and Sun, Z. (2007) Demand Sensitive Model for Tuning Price over Satellite Digital Multimedia Broadcast System. IEEE Transactions on Broadcasting, 53, 329-337. http://dx.doi.org/10.1109/TBC.2006.889684</mixed-citation></ref><ref id="scirp.51600-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Courcoubetis, C., Kelly, F.P., Siris, V.A. and Weber, R. (2000) A Study of Simple Usage-Based Charging Schemes for Broadband Networks. Telecommunications Systems, 15, 323-343.</mixed-citation></ref><ref id="scirp.51600-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Sat, H. Greek Satellite Operator. http://www.hellas-sat.net</mixed-citation></ref></ref-list></back></article>