|
on Network Economics |
| By: | Sharma Megha; Ghosh Diptesh |
| Abstract: | Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the performance of the network when it is performing well. In reliable networks modeling critical functions, decision makers are often more concerned with network performance when the network is not performing well. In this paper, we study the single-source single-destination maximum flow problem through reliable networks and propose two risk measures to evaluate such downside performance. We propose an algorithm called COMPUTE-RISK to compute downside risk measures, and report our computational experience with the proposed algorithm. |
| Date: | 2009–09–29 |
| URL: | http://d.repec.org/n?u=RePEc:iim:iimawp:wp2009-09-02&r=net |
| By: | Kavitha Ranganathan; Shekhar Vikramaditya |
| Abstract: | This paper proposes a rating based scheme for encouraging user participation in ad-hoc mobile phone mesh networks. These networks are particularly attractive for remote/rural areas in developing countries as they do not depend on costly infrastructure and telecom operators. We evaluate our scheme using extensive simulations and find that our proposed scheme is successful in enhancing the network throughput. |
| Date: | 2009–08–31 |
| URL: | http://d.repec.org/n?u=RePEc:iim:iimawp:wp2009-08-01&r=net |
| By: | Sharma Megha; Ghosh Diptesh |
| Abstract: | In this paper we propose a fast state-space enumeration based algorithm called TOP-DOWN capable of computing the probability mass function of the maximum s-t flow through reliable networks. The algorithm computes the probability mass function in the decreasing order of maximum s-t flow values in the network states. This order of enumeration makes this algorithm attractive for commonly observed reliable networks, e.g., in telecommunication networks where link reliabilities are high. We compare the performance of the TOP-DOWN algorithm with a path-based exact algorithm and show that the TOP-DOWN algorithm solves problem much faster and is able to handle much larger problems than existing algorithms. |
| Date: | 2009–10–01 |
| URL: | http://d.repec.org/n?u=RePEc:iim:iimawp:wp2009-10-01&r=net |