The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nihal Pekergin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Michel Fourneau, H. Maisonniaux, Nihal Pekergin, Véronique Vèque
    Performance Evaluation of Buffer Policies with Stochastic Automata Networks. [Citation Graph (0, 0)][DBLP]
    Modelling and Evaluation of ATM Networks, 1993, pp:433-451 [Conf]
  2. Jean-Michel Fourneau, Nihal Pekergin, H. Taleb
    An application of stochastic ordering to the analysis of the push-out mechanism. [Citation Graph (0, 0)][DBLP]
    Modelling and Evaluation of ATM Networks, 1994, pp:227-244 [Conf]
  3. Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin
    Bounding the Loss Rates in a Multistage ATM Switch. [Citation Graph (0, 0)][DBLP]
    Computer Performance Evaluation, 1997, pp:193-205 [Conf]
  4. Ana Busic, Jean-Michel Fourneau, Nihal Pekergin
    Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering. [Citation Graph (0, 0)][DBLP]
    EPEW, 2006, pp:196-210 [Conf]
  5. Nihal Pekergin, Sana Younès
    Stochastic Model Checking with Stochastic Comparison. [Citation Graph (0, 0)][DBLP]
    EPEW/WS-FM, 2005, pp:109-123 [Conf]
  6. Nihal Pekergin
    Stochastic Bounds on Delays of Fair Queueing Algorithms. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1212-1219 [Conf]
  7. Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin
    Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals. [Citation Graph (0, 0)][DBLP]
    ISCIS, 2005, pp:244-253 [Conf]
  8. O. Abuamsha, Nihal Pekergin
    Comparison of Fair Queuing Algorithms with a Stochastic Approach. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1998, pp:139-0 [Conf]
  9. M. Benmammoun, Jean-Michel Fourneau, Nihal Pekergin, Alexis Troubnikoff
    An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2002, pp:375-382 [Conf]
  10. Jean-Michel Fourneau, Mathieu Le Coz, Nihal Pekergin, Franck Quessette
    An open tool to compute stochastic bounds on steady-state distributions and rewards. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2003, pp:219-0 [Conf]
  11. Jean-Michel Fourneau, Nihal Pekergin
    An Algorithmic Approach to Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    Performance, 2002, pp:64-88 [Conf]
  12. Mouad Ben Mamoun, Nihal Pekergin, Sana Younès
    Model Checking of Continuous-Time Markov Chains by Closed-Form Bounding Distributions. [Citation Graph (0, 0)][DBLP]
    QEST, 2006, pp:189-198 [Conf]
  13. Jean-Michel Fourneau, Nihal Pekergin, Sana Younès
    Improving Stochastic Model Checking with Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2005, pp:264-267 [Conf]
  14. Mouad Ben Mamoun, Nihal Pekergin
    Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2002, v:47, n:2/3, pp:181-196 [Journal]
  15. Nihal Pekergin
    Stochastic Performance Bounds by State Space Reduction. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1999, v:36, n:1-4, pp:1-17 [Journal]
  16. Nihal Pekergin, Tugrul Dayar, Denizhan N. Alparslan
    Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:3, pp:810-825 [Journal]
  17. Hind Castel, Lynda Mokdad, Nihal Pekergin
    Loss rates bounds in IP buffers by Markov chains aggregations. [Citation Graph (0, 0)][DBLP]
    AICCSA, 2007, pp:623-630 [Conf]
  18. Ana Busic, Nihal Pekergin
    Closed Form Absorption Time Bounds. [Citation Graph (0, 0)][DBLP]
    EPEW, 2007, pp:33-47 [Conf]
  19. Jean-Michel Fourneau, Nihal Pekergin, Sana Younès
    Censoring Markov Chains and Stochastic Bounds. [Citation Graph (0, 0)][DBLP]
    EPEW, 2007, pp:213-227 [Conf]
  20. Wolfgang E. Nagel, Bruno Gaujal, Tugrul Dayar, Nihal Pekergin
    Topic 2 Performance Prediction and Evaluation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:83- [Conf]

  21. Loss rates bounds for IP switches in MPLS networks. [Citation Graph (, )][DBLP]


  22. Stochastic Bounds for Loss Rates. [Citation Graph (, )][DBLP]


  23. Statistical Model Checking Using Perfect Simulation. [Citation Graph (, )][DBLP]


  24. Improving Time Parallel Simulation for Monotone Systems. [Citation Graph (, )][DBLP]


  25. Stochastic Monotonicity in Queueing Networks. [Citation Graph (, )][DBLP]


  26. Stochastic bounds for performance evaluation of web services. [Citation Graph (, )][DBLP]


  27. Stochastic Bounds Applied to the End to End QoS in Communication Systems. [Citation Graph (, )][DBLP]


  28. Accuracy of Strong and Weak Comparisons for Network of Queues. [Citation Graph (, )][DBLP]


  29. CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time. [Citation Graph (, )][DBLP]


  30. Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains. [Citation Graph (, )][DBLP]


  31. Perfect simulation and monotone stochastic bounds. [Citation Graph (, )][DBLP]


  32. Aggregated bounding Markov processes applied to the analysis of tandem queues. [Citation Graph (, )][DBLP]


  33. Model Checking of Infinite State Space Markov Chains by Stochastic Bounds. [Citation Graph (, )][DBLP]


  34. Different Monotonicity Definitions in Stochastic Modelling. [Citation Graph (, )][DBLP]


  35. Weak Stochastic Comparisons for Performability Verification. [Citation Graph (, )][DBLP]


  36. Stochastic Comparisons for Performability of Telecommunication Systems. [Citation Graph (, )][DBLP]


  37. Analyzing Weighted Round Robin policies with a stochastic comparison approach. [Citation Graph (, )][DBLP]


Search in 0.075secs, Finished in 0.076secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002