Armand M. Makowski
Orcid: 0000-0002-3686-3508Affiliations:
- University of Maryland, College Park, USA
According to our database1,
Armand M. Makowski
authored at least 75 papers
between 1987 and 2020.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 2006, "For contributions to traffic modeling and performance evaluation in communication and computer networks.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2020
Asymptotic Degree Distributions in Large (Homogeneous) Random Networks: A Little Theory and a Counterexample.
IEEE Trans. Netw. Sci. Eng., 2020
2019
CoRR, 2019
2018
On the log-normality of the degree distribution in large homogeneous binary multiplicative attribute graph models.
CoRR, 2018
2017
Light traffic behavior under the power-of-two load balancing strategy: The case of heterogeneous servers.
Perform. Evaluation, 2017
Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version).
CoRR, 2017
2016
Wireless Sensor Networks Under the Random Pairwise Key Predistribution Scheme: Can Resiliency Be Achieved With Small Key Rings?
IEEE/ACM Trans. Netw., 2016
2015
Proceedings of the 54th IEEE Conference on Decision and Control, 2015
On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015
2014
Light traffic performance under the power of two load balancing strategy: the case of server heterogeneity.
SIGMETRICS Perform. Evaluation Rev., 2014
2013
IEEE Trans. Inf. Theory, 2013
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.
IEEE Trans. Inf. Theory, 2013
On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes.
Perform. Evaluation, 2013
Scaling Laws for Connectivity in Random Threshold Graph Models with Non-Negative Fitness Variables.
IEEE J. Sel. Areas Commun., 2013
On the Sensitivity of the Critical Transmission Range: Lessons from the Lonely Dimension.
Found. Trends Netw., 2013
Random threshold graphs with exponential fitness: The width of the phase transition for connectivity.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity.
Queueing Syst. Theory Appl., 2012
Connectivity results for sensor networks under a random pairwise key predistribution scheme.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
On the gradual deployment of random pairwise key distribution schemes (Extended Version)
CoRR, 2011
CoRR, 2011
Proceedings of the 9th International Symposium on Modeling and Optimization in Mobile, 2011
Proceedings of the IEEE 22nd International Symposium on Personal, 2011
Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links.
Proceedings of IEEE International Conference on Communications, 2011
2010
On the Absence of Isolated Nodes in Wireless Ad-Hoc Networks with Unreliable Links - a Curious Gap.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Connectivity in random graphs induced by a key predistribution scheme - small key pools.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010
2009
One-dimensional geometric random graphs with nonvanishing densities: part I: a strong zero-one law for connectivity.
IEEE Trans. Inf. Theory, 2009
IEEE J. Sel. Areas Commun., 2009
Proceedings of the First International Conference on Networks and Communications, 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
Perform. Evaluation, 2008
Intersecting random graphs and networks with multiple adjacency constraints: A simple example
CoRR, 2008
On the random graph induced by a random key predistribution scheme under full visibility.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008
2007
A very strong zero-one law for connectivity in one-dimensional geometric random graphs.
IEEE Commun. Lett., 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
2006
IEEE Trans. Inf. Theory, 2006
Asymptotic optimality of the Round-Robin policy in multipath routing with resequencing.
Queueing Syst. Theory Appl., 2006
On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems.
Queueing Syst. Theory Appl., 2006
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue.
Comput. Networks, 2006
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
Proceedings of IEEE International Conference on Communications, 2006
2005
2004
The output of a cache under the independent reference model: where did the locality of reference go?
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2004
Comparing strength of locality of reference -- Popularity, majorization, and some folk theorems.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004
Proceedings of IEEE International Conference on Communications, 2004
Bounding superposed on-off sources - variability ordering and majorization to the rescue.
Proceedings of IEEE International Conference on Communications, 2004
2003
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003
2002
IEEE Commun. Lett., 2002
Proceedings of the 2002 IEEE Information Theory Workshop, 2002
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002
2001
Convex stability and asymptotic convex ordering for non-stationary arrival processes.
SIGMETRICS Perform. Evaluation Rev., 2001
Proceedings of the Global Telecommunications Conference, 2001
2000
Queueing Syst. Theory Appl., 2000
1999
IEEE Trans. Autom. Control., 1999
Queueing Syst. Theory Appl., 1999
Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999
1998
IEEE Trans. Autom. Control., 1998
Modeling video traffic using M/G/∞ input processes: a compromise between Markovian and LRD models.
IEEE J. Sel. Areas Commun., 1998
Proceedings of the Proceedings IEEE INFOCOM '98, The Conference on Computer Communications, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, Gateway to the 21st Century, San Francisco, CA, USA, March 29, 1998
1997
Queueing Syst. Theory Appl., 1997
IEEE J. Sel. Areas Commun., 1997
Proceedings of the Proceedings IEEE INFOCOM '97, 1997
1996
Proceedings of the Proceedings IEEE INFOCOM '96, 1996
1995
IEEE J. Sel. Areas Commun., 1995
1994
IEEE Trans. Autom. Control., 1994
Perform. Evaluation, 1994
1993
On constrained optimization of the Klimov network and related Markov decision processes.
IEEE Trans. Autom. Control., 1993
1990
Math. Oper. Res., 1990
1989
Oper. Res., 1989
1987
Matrix-Geometric Solution for Finite Capacity Queues with Phase-Type Distributions.
Proceedings of the Performance '87, 1987