default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAppie van de Liefvoort
Person information
- affiliation: University of Missouri-Kansas City, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Hasita Kaja
, Rahul Arun Paropkari, Cory C. Beard, Appie van de Liefvoort:
Survivability and Disaster Recovery Modeling of Cellular Networks Using Matrix Exponential Distributions. IEEE Trans. Netw. Serv. Manag. 18(3): 2812-2824 (2021)- 2020
- [j23]Mustafa Tekinay, Cory C. Beard, Appie van de Liefvoort:
Partial Packet Duplication: Control of Fade and Non-Fade Duration Outages Using Matrix Exponential Distributions. IEEE Trans. Veh. Technol. 69(5): 5652-5656 (2020)
2010 – 2019
- 2017
- [c13]Rahul Arun Paropkari, Cory C. Beard, Appie van de Liefvoort:
Handover performance prioritization for public safety and emergency networks. Sarnoff Symposium 2017: 1-6 - 2015
- [c12]Michael Todd Gardner, Cory C. Beard, Appie van de Liefvoort:
Mission critical publish-subscribe performance modeling using linear algebraic and classical methods. SpringSim (TMS-DEVS) 2015: 269-277 - 2014
- [c11]Michael Todd Gardner, Cory C. Beard, Appie van de Liefvoort:
Efficient matrix-exponential random variate generation using a numeric linear combination approach. SpringSim (TMS-DEVS) 2014: 19
2000 – 2009
- 2009
- [j22]Shekhar Srivastava, Appie van de Liefvoort, Deep Medhi:
Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams. Comput. Networks 53(15): 2688-2702 (2009) - 2008
- [j21]Chaitanya Garikiparthi, Appie van de Liefvoort, Kenneth Mitchell:
Busy period analysis of finite QBD processes. SIGMETRICS Perform. Evaluation Rev. 36(2): 98-100 (2008) - 2007
- [j20]Dijiang Huang, Manish Mehta, Appie van de Liefvoort, Deep Medhi:
Modeling pairwise key establishment for random key predistribution in large-scale sensor networks. IEEE/ACM Trans. Netw. 15(5): 1204-1215 (2007) - [c10]Chaitanya Garikiparthi, Appie van de Liefvoort, Kenneth Mitchell:
Sample Path Analysis of Busy Periods and Related First Passages of a Correlated MEP/MEP/1 System. QEST 2007: 277-286 - 2006
- [j19]Sue Fitzgerald, Jerry Place, Appie van de Liefvoort:
Generating correlated matrix exponential random variables. Adv. Eng. Softw. 37(2): 75-84 (2006) - [j18]Armin Heindl, Kenneth Mitchell, Appie van de Liefvoort:
Correlation bounds for second-order MAPs with application to queueing network decomposition. Perform. Evaluation 63(6): 553-577 (2006) - 2005
- [j17]Jayesh Kumaran, Kenneth Mitchell, Appie van de Liefvoort:
A spectral approach to compute performance measures in a correlated single server queue. SIGMETRICS Perform. Evaluation Rev. 33(2): 12-14 (2005) - 2004
- [j16]Shekhar Srivastava, Balaji Krithikaivasan, Cory C. Beard, Deep Medhi, Appie van de Liefvoort, Wesam Alanqar, Ananth Nagarajan:
Benefits of traffic engineering using QoS routing schemes and network controls. Comput. Commun. 27(5): 387-399 (2004) - [j15]Jayesh Kumaran, Kenneth Mitchell, Appie van de Liefvoort:
Characterization of the departure process from an ME/ME/1 queue. RAIRO Oper. Res. 38(2): 173-191 (2004) - 2003
- [j14]Wen-Jung Hsin, Appie van de Liefvoort:
Analytical observations for a multiservice node. Perform. Evaluation 51(2/4): 103-116 (2003) - [j13]Kenneth Mitchell, Appie van de Liefvoort:
Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals. Perform. Evaluation 51(2/4): 137-152 (2003) - [c9]Armin Heindl, Kenneth Mitchell, Appie van de Liefvoort:
The Correlation Region of Second-Order MAPs with Application to Queueing Network Decomposition. Computer Performance Evaluation / TOOLS 2003: 237-254 - [c8]Balaji Krithikaivasan, Shekhar Srivastava, Cory C. Beard, Appie van de Liefvoort, Deep Medhi:
Controlling Performance in the Congested Parts of an Asymmetric Network Using Controls and Routing. ISCC 2003: 385-391 - 2002
- [j12]Kenneth Mitchell, Appie van de Liefvoort:
Transient analysis of packet discarding policies in ATM networks with correlated arrivals. Perform. Evaluation 48(1/4): 47-66 (2002) - [c7]Shekhar Srivastava, Balaji Krithikaivasan, V. Venkatachalam, Cory C. Beard, Deepankar Medhi, Appie van de Liefvoort, Wesam Alanqar, Ananth Nagarajan:
A case study on evaluating the benefits of MPLS traffic engineering through constraint-based routing and network controls. ICC 2002: 2437-2442 - 2001
- [j11]Kenneth Mitchell, Appie van de Liefvoort, Jerry Place:
The effects of correlated arrivals at a server with credit-based traffic policing. Int. J. Commun. Syst. 14(4): 393-405 (2001) - [j10]Kenneth Mitchell, Khosrow Sohraby, Appie van de Liefvoort, Jerry Place:
Approximation models of wireless cellular networks using moment matching. IEEE J. Sel. Areas Commun. 19(11): 2177-2190 (2001) - 2000
- [j9]Yong Duk Lee, Appie van de Liefvoort, Victor L. Wallace:
Modeling correlated traffic with a generalized IPP. Perform. Evaluation 40(1-3): 99-114 (2000) - [c6]Kenneth Mitchell, Khosrow Sohraby, Appie van de Liefvoort, Jerry Place:
Approximation Models of Wireless Cellular Networks Using Moment Matching. INFOCOM 2000: 189-197
1990 – 1999
- 1998
- [j8]Kenneth Mitchell, Appie van de Liefvoort, Jerry Place:
Correlation properties of the token leaky bucket departure process. Comput. Commun. 21(11): 1010-1019 (1998) - [j7]E. Brown, Jerry Place, Appie van de Liefvoort:
Generating Matrix Exponential Random Variates. Simul. 70(4): 224-230 (1998) - 1996
- [j6]Wen-Jung Hsin, Appie van de Liefvoort:
The teletraffic analysis of the multi-server loss model with renewal distributions. Telecommun. Syst. 5(2): 303-321 (1996) - 1995
- [j5]Deepankar Medhi, Appie van de Liefvoort, C. S. Reece:
Performance analysis of a digital link with heterogeneous multislot traffic. IEEE Trans. Commun. 43(2/3/4): 968-976 (1995) - [c5]Wen-Jung Hsin, Appie van de Liefvoort:
Performance Analysis of the General Multi-Server Finite Waiting Room Model. MASCOTS 1995: 38-42 - 1993
- [j4]Appie van de Liefvoort, Narayan Subramanian:
A New Approach for the Performance Analysis of a Single-Bus Multiprocessor System with General Service Times. IEEE Trans. Computers 42(3): 358-362 (1993) - 1992
- [j3]Appie van de Liefvoort:
An Iterative Algorithm for the Reve's Puzzle (Short Note). Comput. J. 35(1): 91-92 (1992) - [c4]Deep Medhi, Appie van de Liefvoort, C. S. Reece:
A Performance Evaluation Model for a Digital Group with Multislot Traffic Streams. ACM Conference on Computer Science 1992: 377-383 - [c3]Appie van de Liefvoort, Aby Tehranipour:
On a single server queue with non-renewal input. SAC 1992: 1144-1149 - 1990
- [c2]Appie van de Liefvoort:
An Iterative Solution to the Four-Peg Tower of Hanoi Problem. ACM Conference on Computer Science 1990: 70-75 - [c1]Jerry Place, Vijay Kumar, Appie van de Liefvoort:
The Behavior of Database Concurrency Control Mechanisms under Bursty Arrivals. ICCI 1990: 324-333
1980 – 1989
- 1986
- [j2]Appie van de Liefvoort, Lester Lipsky:
A matrix-algebraic solution to two Km servers in a loop. J. ACM 33(1): 207-223 (1986) - 1982
- [j1]J. L. Carroll, Appie van de Liefvoort, Lester Lipsky:
Solutions of M/G/1//N-type Loops with Extensions to M/G/1 and GI/M/1 Queues. Oper. Res. 30(3): 490-514 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
