Berk Birand
 |
Berk Birand |
About
Berk is a Ph.D. student in Prof. Gil Zussman's group and is currently an IBM PhD Fellow.
His research focus is on developing efficient cross-layer algorithms in wireless and optical networks. His current work is on proving the performance bounds on distributed scheduling algorithms and on identifying energy-efficient resource allocation problems in optical access networks.
His work on using graph theory to prove throughput-bounds on greedy scheduling algorithms was nominated for the “Best Paper Award” in INFOCOM’10. He was an invited speaker at the ACM S3 2010 workshop in Chicago, IL and received the “Best Theory Session Talk” award. He was the TPC co-chair of the ACM S3 2011 workshop in Las Vegas, NV. In Spring 2011, he was a Teaching Fellow for the Computer Science department. He was awarded the “Harold S. Black Award for outstanding EE senior” from WPI and the “Millman Award for outstanding EE TA of the year” from Columbia University. In the summer of 2010 and the fall of 2011, he was a research intern at IBM T.J. Watson Research Center, Hawthorne, NY.
Some of the conferences he is interested in are listed here. His resume, contact information, and public PGP key are also available.
Teaching
Instructor for:
CSEE 4140 Networking Lab (Spring 2011)
Teaching assistant for:
COMS 4119 Computer Networks (Spring 2010)
COMS 4119 Computer Networks (Spring 2009)
ELEN 3801 Continuous Time Systems and Signals (Fall 2008)
Research
Cross-layer optimization
Throuhgput maximization in various network topologies
Fiber-wireless convergence
Publications
Conference
B. Birand, M. Zafer, G. Zussman, and K-W. Lee, “Dynamic Graph Properties of Mobile Networks under Levy Walk Mobility,” Proc. IEEE MASS’11, Oct. 2011
PDF
B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, “Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory,” Proc. ACM MobiHoc S3 Workshop’10, Sep. 2010 [Invited Speaker, Best Theory Session Talk Award]
B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, “Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory,” Proc. IEEE INFOCOM’10, Mar. 2010,
PDF [Nominated for Best Paper Award]
G. Hammouri, E. Öztürk, B. Birand, and B. Sunar. Unclonable Lightweight Authentication Scheme. In Proc. ICICS’08, Oct. 2008, in Springer LNCS, DOI= http://dx.doi.org/10.1007/978-3-540-88625-9_3
Journal
B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, “Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory,” IEEE/ACM Transactions on Networking, vol. 20, no. 1, pp. 163–176, Feb. 2012
PDF
S-H. Yoo, D. Karakoyunlu, B. Birand, and B. Sunar. A Robust and Practical Random Number Generator. ACM Transactions on Reconfigurable Technology and Systems, Vol. 3, No. 2, May 2010
Technical Report
B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory, Columbia University Electrical Engineering Technical Report 2009-07-30,
PDF
Posters
B. Birand, C. P. Lai, H. Wang, G. Zussman and K. Bergman, Fiber-Wireless Convergence - Cross-Layer Design Approach CIAN Poster
PDF
Courses
Network Optimizations
Deterministic Models
Stochastic modeling
Computer Networks
Analysis of Algorithms
Graph Theory