Selected Publications of George Kesidis

Prof. of EE and CSE

Pennsylvania State University

kesidis at engr dot psu dot edu

           

 

Books:

 

G. Kesidis. Introduction to Analysis of Communication Networks. Wiley-Interscience, 2007.

 

G. Kesidis. ATM Network Performance, Second Edition, Kluwer Academic Publishers, Boston, MA, 1999.

 

 

-----------------------------------------------------------------------------------------------------------

Network Games, Pricing, Incentive Engineering, including Peer-to-Peer Networking:

 

P. Patankar, G. Nam, G. Kesidis, T. Konstantopoulos and C. Das. Peer-to-peer unstructured search with learned correlations between communities of interest.  In Proc.

International Teletraffic Congress (ITC), Paris, Sept. 2009.

 

T. Konstantopoulos, G. Kesidis and P. Sousi, “A stochastic epidemiological model and deterministic limit for BitTorrent-like peer-to-peer file-sharing networks.” Workshop on Network Control and Optimization, Paris, Sept. 2008 (Proceedings to appear in Springer LNCS).

 

G. Kesidis, G. de Veciana and A. Das, “On flat-rate and usage-based pricing for tiered commodity Internet services", in Proc. CISS, Princeton, March 2008.  

 

Y. Jin and G. Kesidis, “Distributed contention window control for selfish users in IEEE 802.11 wireless LANs”, IEEE JSAC special issue on non-cooperative networks, Aug. 2007.

 

G. Kesidis, T. Konstantopoulos and P. Sousi, “Modeling file-sharing with BitTorrent-like incentives”, IEEE ICASSP, Honolulu, April 2007.

 

Y. Jin and G. Kesidis, “Charge sensitive and incentive compatible end-to-end window-based control for selfish users", IEEE JSAC special issue on Network Economics and Pricing, May 2006.

 

B. Mortazavi and G. Kesidis, “Incentive compatible reputation systems for P2P CDNs with rationally selfish but honest users", Proc. IEEE CISS, Princeton, March 2006.

 

B. Mortazavi and G. Kesidis, “A peer-to-peer content-distribution game with a reputation-based incentive mechanism", Proc. IEEE Workshop on Information Theory and its Applications, UC San Diego, Feb. 2006.

 

Y. Jin and G. Kesidis, “Dynamics of usage-priced communication networks: the case of a single bottleneck resource," IEEE Transactions on Networking (ToN), Oct. 2005.

 

Y. Jin and G. Kesidis, Equilibiria of a noncooperative game for heterogeneous users of an ALOHA network, IEEE Comm. Letters, Vol. 6, No. 7, pp. 282-284, 2002.

 

 

-----------------------------------------------------------------------------------------------------

Network Security including Anti-Spam:

 

G. Kesidis, A. Tangpong and C. Griffin. A sybil-proof referral system based on multiplicative reputation chains. IEEE Comm. Letters, Nov. 2009. Errata

 

P. Patankar, G. Nam, G. Kesidis and C. Das, “Exploring Anti-Spam Models in Large Scale VoIP Systems", in Proc. IEEE Int'l Conf. on Distributed Computing Systems (ICDCS), Beijing, June 2008.

 

G. Kesidis, M. Vojnovic, I. Hamadeh, Y. Jin, S. Jiwasurat, “Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links," ACM TOMACS, May 2008.

 

S. Yi, X. Deng, G. Kesidis and C.R. Das, “A dynamic quarantine scheme for controlling unresponsive TCP sessions," Telecommunication Systems, 2008.

 

Y.-C. Jhi, L. Li, P. Liu, Q. Jin, and G. Kesidis, “PWC: A Proactive Worm Containment Solution for Enterprise Networks", in Proc. IEEE SecureComm, Sept. 2007.

 

J. Wang, D.J. Miller and G. Kesidis, “New Directions in Covert Worm Modeling Exploiting White-Listing" in Proc. IEEE Sarnoff Symposium on Communications, March 2007.

 

J. Wang, D.J. Miller, and G. Kesidis, “Efficient Mining of the Multidimensional Traffic Cluster Hierarchy for Digesting, Visualization, and Modeling," IEEE JSAC special issue on High-Speed Network Security, 2006.

 

L. Li, P. Liu and G. Kesidis, “Visual Studio for Network Security Experiment Specification and Data Analysis,” in Proc. ACM Workshop on Visualization for Computer Security (VizSec), Nov. 3 2006.

 

J. Wang, I. Hamadeh, D.J. Miller and G. Kesidis, “Polymorphic Worm Detection and Defense: System Design, Experimental Methodology, and Data Resources", in Proc. ACM SIGCOMM Workshop on Large-Scale Attack Defense (LSAD), Pisa, Italy, Sept. 11, 2006.

 

I. Hamadeh. Attack Attribution for Distributed Denial-of-Service and Worm Attacks. Ph.D. Thesis, CSE Dept, Penn State, 2006.

 

G. Carl, R. Brooks, S. Rai and G. Kesidis, “DoS/DDoS attack detection techniques", IEEE Internet Computing, Jan/Feb 2006.

 

N. Weaver, I. Hamadeh, G. Kesidis and V. Paxson, “Preliminary results using scale-down to explore worm dynamics”, in Proc.  ACM WORM, Washington, DC, Oct. 29, 2004.

 

See also “discrete packet dropping” in the wireless networking topic section below.

 

---------------------------------------------------------------------------------------------------------

Traffic Engineering including Traffic Shaping, Scheduling and Effective Bandwidths:

 

S. Jiwasurat, G. Kesidis and D.J. Miller, “Hierarchical Shaped Deficit Round-Robin (HSDRR) Scheduling", in Proc. IEEE GLOBECOM, St. Louis, Dec. 2005.

 

S. Yi, X. Deng, G. Kesidis and C. Das, HaTCh: A Two-level Caching Scheme for Estimating the Number of Active Flows, in Proc. IEEE CDC, Maui, Dec. 2003.

 

G. Kesidis and L. Tassiulas, Traffic Shaping for a Loss System , IEEE Communication Letters , Dec. 2000, pp. 417-419.

 

G. Kesidis and T. Konstantopoulos, Extremal Traffic and Worst-Case Performance for Queues with Shaped Arrivals , Analysis of Communication Networks: Call Centres, Traffic and Performance, edited by D.R. McDonald and S.R.E. Turner, Fields Institute Communications/AMS, 2000, ISBN 0-8218-1991-7. Originally presented at the Fields Institute, U. Toronto, Nov. 9-13, 1998, also IEEE T.Comm. paper in 1998 and IEEE Comm. Let. Paper in 2000.

 

G. de Veciana and G. Kesidis, "Bandwidth Allocation for Multiple Qualities of Service using Generalized Processor Sharing", IEEE Trans. Information Theory, Vol. 42, No. 1, Jan. 1996, pp. 268-271.

 

A. Hung and G. Kesidis, Bandwidth Scheduling for Wide-Area ATM Networks Using Virtual Finishing Times, IEEE/ACM Trans. Networking, Vol. 4, No. 1, pp. 49-54, Feb. 1996.

 

G. Kesidis, T. Konstantopoulos and M. Zazanis, Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues, Proc. IEEE CDC'94, Orlando, FL., pp. 2627-2630, Dec 1994.

 

G. Kesidis, J. Walrand and C.-S. Chang, Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources, IEEE/ACM Trans. Networking, Vol. 1, No. 4, pp. 424-428, 1993.

 

-------------------------------------------------------------------------------------------------------

Performance Evaluation including Simulation:

 

G. Carl and G. Kesidis. “Large-scale testing of the Internet’s Border Gateway Protocol via Topological Scale-Down”, ACM TOMACS, July 2008.

 

I. Hamadeh, J. Hart, G. Kesidis and V. Pothamsetty, “A preliminary simulation of the effect of scanning worm activity on multicast”, in Proc. IEEE PADS, Monterey, CA, June 2005.

 

N. Milidrag, G. Kesidis and M. Devetsikiotis, An overview of fluid-based quick simulation techniques for large packet-switched communication networks, in Proc. SPIE ITCom, Denver, Aug. 2001.

 

G. Kesidis, A. Singh, D. Cheung and W.W. Kwok, Feasibility of Fluid Event-Driven Simulation for ATM Networks, in Proc. IEEE Globecom, London , Nov. 1996.

 

G. Kesidis and A. Singh, An Overview of Cell-Level ATM Network Simulation, in  Proc. ACM HPCS, Montreal, Canada, 1995.

 

G. Kesidis and J. Walrand, Quick Simulation of ATM Buffers with On-off Multiclass Markov Fluid Sources, ACM TOMACS, Vol. 3, No. 3, pp. 267-276, July 1993.

 

 

------------------------------------------------------------------------------------------------

Wireless Networking including Mobility issues:

 

A. Neishaboori and G. Kesidis, “Wireless Mesh Networks Based on CDMA", Computer Communications special issue on WMNs, vol. 31, 2008.

 

A. Das, V. Pothamsetty and G. Kesidis, ``Assessing discreet packet-dropping attacks using nearest-neighbor and path-vector attribution", in Proc. IEEE BROADNETS (Symposium on Wireless Networking), Raleigh, NC, Sept. 2007.

 

R.N. Rao. Purposeful mobility and capacity issues in sensor networks. Ph.D. thesis, EE Dept, Penn State, 2007.

 

P.B. Jeon. A pheromone-aided multipath QoS routing protocol and its application in MANETs. Ph.D. thesis, EE Dept, Penn State, 2006.

 

G. Kesidis, T. Konstantopoulos and S. Phoha,  Surveillance coverage of sensor networks under a random mobility strategy , in Proc. IEEE Sensors, Toronto, Oct. 2003.

 

V. Bhatnagar and G. Kesidis, Bluetooth scatternet formation , in Proc. joint 2nd IEEE International Conference on Networking and IEEE International Conference on Wireless LANs and Home Networks (ICN'02 and ICWLHN'02), Atlanta, August 26-29, 2002.

 

A. Hung, M-J Montpetit, and G. Kesidis, ATM via Satellite: A Framework and Implementation, ACM Wireless Networks, Vol. 4, No. 2, Feb. 1998, pp. 141-154.

 

See also Network Security and Incentive Engineering topic sections above.

 

-------------------------------------------------------------------------------------------------------

Machine Learning, Optimization including Applications to Medicine:

 

G. Kesidis. A Quantum Diffusion Network. Technical Report, Aug. 2009: http://arxiv1.library.cornell.edu/abs/0908.1597

 

D.J. Miller, C.-F. Lin, G. Kesidis and C. Collins. Semi-supervised mixture modeling with fine-grained component-conditional class labeling and transductive inference. maximum entropy modeling for regression. In Proc. IEEE Machine Learning in Signal Processing (MLSP), Grenoble, France, Sept. 2009. (best paper award)

 

Y. Zhang, D.J. Miller and G. Kesidis. Hierarchical maximum entropy modeling for regression. In Proc. IEEE Machine Learning in Signal Processing (MLSP), Grenoble, France, Sept. 2009.

 

Y. Zhang, Y. Aksu, G. Kesidis and D.J. Miller, “SVM feature-selection applications to microarray data”,  in Proc. IEEE Workshop on Machine Learning in Signal Processing (MLSP), Cancun, Mexico, Oct. 2008.

 

Y. Aksu, D.J. Miller and G. Kesidis, “Margin-based feature selection techniques for support vector machine classification”, in Proc. Cognitive Information Processing (CIP), Santorini, June 2008.

 

D.J. Miller, Y. Zhang, and G. Kesidis, “A Transductive Extension of Maximum Entropy/Iterative Scaling for Decision Aggregation in Distributed Classification", in Proc. IEEE ICASSP, Las Vegas, March 2008.

 

D.J. Miller, Y. Wang and G. Kesidis, “Emergent unsupervised clustering paradigms with potential applications to bioinformatics”, Frontiers in Bioscience, Jan. 2008.

 

Y. Aksu, G. Kesidis and D.J. Miller, “Efficient, step-wise optimal feature elimination in support vector machines for huge features spaces”, in Proc. IEEE MLSP, Thessaloniki, Greece, Aug. 2007.

 

G. Kesidis and J. Walrand, Relative Entropy Between Markov Transition Rate Matrices , IEEE Trans. Info. Th., Vol. 39, No. 3, pp. 1056-1057, May 1993.

 

G. Kesidis, Analog Optimization with Wong's Stochastic Neural Network, IEEE Trans. Neural Networks, Vol. 6, No. 1, pp. 258-260, 1995.

 

G. Kesidis and E. Wong, Optimal Acceptance Probability for Simulated Annealing, Stochastics and Stochastics Reports, Vol. 29, pp. 221-226, 1990. Errata