The SCEAS System
Navigation Menu

Search the dblp DataBase


Jorma T. Virtamo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Riikka Susitaival, Jorma T. Virtamo, Samuli Aalto
    Load Balancing by MPLS in Differentiated Services Networks. [Citation Graph (0, 0)][DBLP]
    Art-QoS, 2003, pp:252-264 [Conf]
  2. Jouni Karvo, Jorma T. Virtamo, Samuli Aalto, Olli Martikainen
    Blocking of dynamic multicast connections in a single link. [Citation Graph (0, 0)][DBLP]
    Broadband Communications, 1998, pp:473-484 [Conf]
  3. Attila Vidács, Jorma T. Virtamo
    Maximum Likelihood Estimation of the Parameters of Fractional Brownian Traffic with Geometrical Sampling. [Citation Graph (0, 0)][DBLP]
    Broadband Communications, 1999, pp:51-62 [Conf]
  4. Jorma T. Virtamo, Ilkka Norros
    On the Broadening of Cell Bursts in an ATM Network. [Citation Graph (0, 0)][DBLP]
    Integrated Broadband Communications, 1993, pp:373-381 [Conf]
  5. Riikka Susitaival, Samuli Aalto, Jorma T. Virtamo
    Analyzing the Dynamics and Resource Usage of P2P File Sharing by a Spatio-temporal Model. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (4), 2006, pp:420-427 [Conf]
  6. Pasi E. Lassila, Jorma T. Virtamo
    Using Gibbs sampler in simulating multiservice lass systems. [Citation Graph (0, 0)][DBLP]
    PICS, 1998, pp:261-272 [Conf]
  7. Pasi E. Lassila, Jouni Karvo, Jorma T. Virtamo
    Efficient Importance Sampling for Monte Carlo Simulation of Multicast Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:432-439 [Conf]
  8. Attila Vidács, Jorma T. Virtamo
    Parameter Estimation of Geometrically Sampled Fractional Brownian Traffic. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1791-1796 [Conf]
  9. Esa Hyytiä, Jorma T. Virtamo
    Dynamic Routing and Wavelength Assignment Using First Policy Iteration. [Citation Graph (0, 0)][DBLP]
    ISCC, 2000, pp:146-151 [Conf]
  10. Aleksi Penttinen, Jorma T. Virtamo
    Improving Multicast Tree Construction in Static Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    LCN, 2003, pp:762-765 [Conf]
  11. Rikka Sustiatival, Samuli Aalto, Jorma T. Virtamo
    Adaptive Load Balancing Using MPLS. [Citation Graph (0, 0)][DBLP]
    MMB, 2004, pp:15-24 [Conf]
  12. Henri Koskinen, Jorma T. Virtamo
    Probability of successful transmission in a random slotted-aloha wireless multihop network employing constant transmission power. [Citation Graph (0, 0)][DBLP]
    MSWiM, 2005, pp:191-199 [Conf]
  13. Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
    An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2000, pp:275-286 [Conf]
  14. Aleksi Penttinen, Jorma T. Virtamo
    Performance of Wireless Ad Hoc Networks under Balanced Fairness. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:235-246 [Conf]
  15. Pasi E. Lassila, Aleksi Penttinen, Jorma T. Virtamo
    Dimensioning of wireless mesh networks with flow-level QoS requirements. [Citation Graph (0, 0)][DBLP]
    PE-WASUN, 2006, pp:17-24 [Conf]
  16. Pasi E. Lassila, Jorma T. Virtamo
    Modeling the Dynamics of the RED Algorithm. [Citation Graph (0, 0)][DBLP]
    QofIS, 2000, pp:28-42 [Conf]
  17. Juha Leino, Jorma T. Virtamo
    Optimal Load Balancing in Insensitive Data Networks. [Citation Graph (0, 0)][DBLP]
    QoS-IP, 2005, pp:313-324 [Conf]
  18. Thomas Bonald, Aleksi Penttinen, Jorma T. Virtamo
    On light and heavy traffic approximations of balanced fairness. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:109-120 [Conf]
  19. Matthieu Jonckheere, Jorma T. Virtamo
    Optimal insensitive routing and bandwidth sharing in simple data networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2005, pp:193-204 [Conf]
  20. Juha Leino, Jorma T. Virtamo
    An approximative method for calculating performance measures of Markov processes. [Citation Graph (0, 0)][DBLP]
    VALUETOOLS, 2006, pp:67- [Conf]
  21. Juha Leino, Jorma T. Virtamo
    Insensitive load balancing in data networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:8, pp:1059-1068 [Journal]
  22. Ilkka Norros, James W. Roberts, Alain Simonian, Jorma T. Virtamo
    The Superposition of Variable Bit Rate Sources in an ATM Multiplexer. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1991, v:9, n:3, pp:378-387 [Journal]
  23. Esa Hyytiä, Jorma T. Virtamo
    Random waypoint model in n-dimensional space. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:567-571 [Journal]
  24. Thomas Bonald, Jorma T. Virtamo
    Calculating the flow level performance of balanced fairness in tree networks. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2004, v:58, n:1, pp:1-14 [Journal]
  25. Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
    An exact end-to-end blocking probability algorithm for multicast networks. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2003, v:54, n:4, pp:311-330 [Journal]
  26. Vinod Sharma, Jorma T. Virtamo
    A finite buffer queue with priorities. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:47, n:1, pp:1-22 [Journal]
  27. Thomas Bonald, Laurent Massoulié, Alexandre Proutiére, Jorma T. Virtamo
    A queueing analysis of max-min fairness, proportional fairness and balanced fairness. [Citation Graph (0, 0)][DBLP]
    Queueing Syst., 2006, v:53, n:1-2, pp:65-84 [Journal]
  28. Jouni Karvo, Olli Martikainen, Jorma T. Virtamo, Samuli Aalto
    Blocking of Dynamic Multicast Connections. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2001, v:16, n:3-4, pp:467-481 [Journal]
  29. Aleksi Penttinen, Jorma T. Virtamo, Riku Jäntti
    Performance analysis in multi-hop radio networks with balanced fair resource sharing. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2006, v:31, n:4, pp:315-336 [Journal]
  30. Esa Hyytiä, Pasi E. Lassila, Jorma T. Virtamo
    Spatial Node Distribution of the Random Waypoint Mobility Model with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2006, v:5, n:6, pp:680-694 [Journal]
  31. Pasi E. Lassila, Jorma T. Virtamo
    Nearly optimal importance sampling for Monte Carlo simulation of loss systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Model. Comput. Simul., 2000, v:10, n:4, pp:326-347 [Journal]
  32. Hannu Rummukainen, Jorma T. Virtamo
    Polynomial cost approximations in markov decision theory based call admission control. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2001, v:9, n:6, pp:769-779 [Journal]
  33. Esa Hyytiä, Tuomas Tirronen, Jorma T. Virtamo
    Optimal Degree Distribution for LT Codes with Small Message Length. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2576-2580 [Conf]
  34. Juha Leino, Aleksi Penttinen, Jorma T. Virtamo
    Approximating Flow Throughput in Complex Data Networks. [Citation Graph (0, 0)][DBLP]
    International Teletraffic Congress, 2007, pp:422-433 [Conf]
  35. Attila Vidács, Jorma T. Virtamo
    Minimum Transmission Energy Trajectories for a Linear Pursuit Problem. [Citation Graph (0, 0)][DBLP]
    NET-COOP, 2007, pp:286-295 [Conf]
  36. Esa Hyytiä, Jorma T. Virtamo
    Random waypoint mobility model in cellular networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2007, v:13, n:2, pp:177-188 [Journal]

  37. Dimensioning methods for data networks with flow-level QoS requirements. [Citation Graph (, )][DBLP]

  38. On optimality of single-path routes in massively dense wireless multi-hop networks. [Citation Graph (, )][DBLP]

  39. Flow-optimized random access for wireless multihop networks. [Citation Graph (, )][DBLP]

  40. Forwarding capacity of an infinite wireless network. [Citation Graph (, )][DBLP]

  41. Performance Analysis of Divided Random Linear Fountain. [Citation Graph (, )][DBLP]

  42. Optimal robust policies for bandwidth allocation and admission control in wireless networks. [Citation Graph (, )][DBLP]

Search in 0.050secs, Finished in 0.052secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002