Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Murali S. Kodialam
2010 – today
- 2012
[j21]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Haoyu Song: Fast Dynamic Multiple-Set Membership Testing Using Combinatorial Bloom Filters. IEEE/ACM Trans. Netw. 20(1): 295-304 (2012)
[j20]Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. Lakshman: Efficient Trie Braiding in Scalable Virtual Routers. IEEE/ACM Trans. Netw. 20(5): 1489-1500 (2012)
[c56]Krishna P. N. Puttaswamy, Thyaga Nandagopal, Murali S. Kodialam: Frugal storage for cloud file systems. EuroSys 2012: 71-84
[c55]Fangfei Chen, Murali S. Kodialam, T. V. Lakshman: Joint scheduling of processing and Shuffle phases in MapReduce systems. INFOCOM 2012: 1143-1151
[c54]Murali S. Kodialam, T. V. Lakshman, Sarit Mukherjee: Effective ad targeting with concealed profiles. INFOCOM 2012: 2237-2245- 2011
[j19]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Traffic-oblivious routing in the hose model. IEEE/ACM Trans. Netw. 19(3): 774-787 (2011)
[j18]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: End-to-end restorable oblivious routing of hose model traffic. IEEE/ACM Trans. Netw. 19(4): 1223-1236 (2011)
[j17]Murali S. Kodialam, T. V. Lakshman, Sarit Mukherjee, Limin Wang: Online Scheduling of Targeted Advertisements for IPTV. IEEE/ACM Trans. Netw. 19(6): 1825-1834 (2011)
[c53]Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kompella, T. V. Lakshman, Myungjin Lee, Sarit Mukherjee: Scheduling in mapreduce-like systems for fast completion time. INFOCOM 2011: 3074-3082
[c52]Wai-Kit Sze, Thyaga Nandagopal, Wing Cheong Lau, Murali S. Kodialam: RFID tag counting over lossy wireless channels. WiOpt 2011: 55-61- 2010
[j16]Armen Aghasaryan, Murali S. Kodialam, Sarit Mukherjee, Yann Toms, Christophe Senot, Stéphane Betgé-Brezetz, T. V. Lakshman, Limin Wang: Personalized application enablement by web session analysis and multisource user profiling. Bell Labs Technical Journal 15(1): 67-76 (2010)
[c51]Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. Lakshman: Building Scalable Virtual Routers with Trie Braiding. INFOCOM 2010: 1442-1450
[c50]Murali S. Kodialam, T. V. Lakshman, Sarit Mukherjee, Limin Wang: Online Scheduling of Targeted Advertisements for IPTV. INFOCOM 2010: 1550-1558
2000 – 2009
- 2009
[j15]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: Oblivious routing of highly variable traffic in service overlays and IP backbones. IEEE/ACM Trans. Netw. 17(2): 459-472 (2009)
[j14]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Locally restorable routing of highly variable traffic. IEEE/ACM Trans. Netw. 17(3): 752-763 (2009)
[j13]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Guaranteed performance routing of unpredictable traffic with fast path restoration. IEEE/ACM Trans. Netw. 17(5): 1427-1438 (2009)
[c49]Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. Lakshman: Scalable IP Lookups using Shape Graphs. ICNP 2009: 73-82
[c48]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Resilient Routing of Variable Traffic with Performance Guarantees. ICNP 2009: 213-222
[c47]Fang Hao, Murali S. Kodialam, T. V. Lakshman: On-line Detection of Real Time Multimedia Traffic. ICNP 2009: 223-232
[c46]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Haoyu Song: Fast Multiset Membership Testing Using Combinatorial Bloom Filters. INFOCOM 2009: 513-521
[c45]Haoyu Song, Fang Hao, Murali S. Kodialam, T. V. Lakshman: IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards. INFOCOM 2009: 2518-2526
[c44]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Capacity of Multi-Hop Wireless Networks with Incomplete Traffic Specification. INFOCOM 2009: 2536-2540
[c43]Murali S. Kodialam, Wing Cheong Lau, Thyaga Nandagopal: Identifying RFID tag categories in linear time. WiOpt 2009: 1-6- 2008
[j12]Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Bandwidth guaranteed routing with fast restoration against link and node failures. IEEE/ACM Trans. Netw. 16(6): 1321-1330 (2008)
[c42]Vidhyashankar Venkataraman, Paul Francis, Murali S. Kodialam, T. V. Lakshman: A priority-layered approach to transport for high bandwidth-delay product networks. CoNEXT 2008: 14
[c41]- 2007
[j11]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic. IEEE Journal on Selected Areas in Communications 25(5): 934-948 (2007)
[j10]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Shantidev Mohanty: Fast, memory efficient flow rate estimation using runs. IEEE/ACM Trans. Netw. 15(6): 1467-1477 (2007)
[c40]Wing Cheong Lau, Murali S. Kodialam, T. V. Lakshman, H. Jonathan Chao: DATALITE: a distributed architecture for traffic analysis via light-weight traffic digest. BROADNETS 2007: 622-630
[c39]Kemal Karakayali, Joseph H. Kang, Murali S. Kodialam, Krishna Balachandran: Joint Resource Allocation and Routing for OFDMA-Based Broadband Wireless Mesh Networks. ICC 2007: 5088-5092
[c38]Murali S. Kodialam, T. V. Lakshman: Achievable Rate Region for Wireless Systems with Time Varying Channels. INFOCOM 2007: 53-61
[c37]Murali S. Kodialam, Thyaga Nandagopal, Wing Cheong Lau: Anonymous Tracking Using RFID Tags. INFOCOM 2007: 1217-1225
[c36]Abhishek Kashyap, Sudipta Sengupta, Randeep Bhatia, Murali S. Kodialam: Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic. SIGMETRICS 2007: 85-96
[c35]Fang Hao, Murali S. Kodialam, T. V. Lakshman: Building high accuracy bloom filters using partitioned hashing. SIGMETRICS 2007: 277-288
[c34]Kemal Karakayali, Joseph H. Kang, Murali S. Kodialam, Krishna Balachandran: Cross-Layer Optimization for OFDMA-Based Wireless Mesh Backhaul Networks. WCNC 2007: 276-281- 2006
[j9]Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Fast network re-optimization schemes for MPLS and optical networks. Computer Networks 50(3): 317-331 (2006)
[j8]Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Finding disjoint paths with related path costs. J. Comb. Optim. 12(1-2): 83-96 (2006)
[c33]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Throughput Guaranteed Restorable Routing Without Traffic Prediction. ICNP 2006: 137-146
[c32]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Vivek Vishnumurthy, Hui Zhang: Content Based Rate Estimation Using Lazy Membership Testing. INFOCOM 2006
[c31]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones. INFOCOM 2006
[c30]Murali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic. INFOCOM 2006
[c29]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Maximum Throughput Routing of Traffic in the Hose Model. INFOCOM 2006
[c28]Rui Zhang-Shen, Murali S. Kodialam, T. V. Lakshman: Achieving Bounded Blocking in Circuit-Switched Networks. INFOCOM 2006
[c27]Murali S. Kodialam, Thyaga Nandagopal: Fast and reliable estimation schemes in RFID systems. MOBICOM 2006: 322-333- 2005
[j7]Murali S. Kodialam, Thyaga Nandagopal: Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels. IEEE/ACM Trans. Netw. 13(4): 868-880 (2005)
[j6]Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis: On guaranteed smooth scheduling for input-queued switches. IEEE/ACM Trans. Netw. 13(6): 1364-1375 (2005)
[c26]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Hui Zhang: Fast payload-based flow estimation for traffic monitoring and network security. ANCS 2005: 211-220
[c25]Fang Hao, Murali S. Kodialam, T. V. Lakshman, Hui Zhang: Fast, memory-efficient traffic estimation by coincidence counting. INFOCOM 2005: 2080-2090
[c24]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Configuring networks with content filtering nodes with applications to network security. INFOCOM 2005: 2395-2404
[c23]Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Capacity allocation and routing of locally restorable bandwidth guaranteed connections. INFOCOM 2005: 2691-2701
[c22]Murali S. Kodialam, Thyaga Nandagopal: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. MOBICOM 2005: 73-87- 2004
[c21]Fang Hao, Murali S. Kodialam, T. V. Lakshman: Real-Time Detection of Hidden Traffic Patterns. ICNP 2004: 340-349
[c20]Randeep Bhatia, Murali S. Kodialam: On Power Efficient Communication over Multi-hop Wireless Networks: Joint Routing, Scheduling and Power Control. INFOCOM 2004
[c19]Murali S. Kodialam, T. V. Lakshman, Shantidev Mohanty: Runs bAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. INFOCOM 2004
[c18]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: A Simple Traffic Independent Scheme for Enabling Restoration Oblivious Routing of Resilient Connections. INFOCOM 2004
[c17]Fang Hao, Murali S. Kodialam, T. V. Lakshman: ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation. SIGMETRICS 2004: 155-166- 2003
[j5]Murali S. Kodialam, V. Venkateswaran: Bandwidth Allocation In Multicast Trees With QoS Constraints. International Journal of Information Technology and Decision Making 2(4): 619-627 (2003)
[j4]Murali S. Kodialam, T. V. Lakshman: Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Trans. Netw. 11(3): 399-410 (2003)
[j3]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Online multicast routing with bandwidth guarantees: a new approach using multicast network flow. IEEE/ACM Trans. Netw. 11(4): 676-686 (2003)
[j2]Koushik Kar, Murali S. Kodialam, T. V. Lakshman: Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Trans. Netw. 11(5): 772-781 (2003)
[c16]Koushik Kar, Murali S. Kodialam, T. V. Lakshman, Leandros Tassiulas: Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks. INFOCOM 2003
[c15]Isaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis: On Guaranteed Smooth Scheduling For Input-Queued Switches. INFOCOM 2003
[c14]Murali S. Kodialam, T. V. Lakshman: Detecting Network Intrusions via Sampling: A Game Theoretic Approach. INFOCOM 2003
[c13]Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Fast Network Re-optimization Schemes for MPLS and Optical Networks. IWQoS 2003: 249-265
[c12]Murali S. Kodialam, Thyagarajan Nandagopal: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. MOBICOM 2003: 42-54- 2002
[c11]Murali S. Kodialam, T. V. Lakshman: Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup. ICNP 2002: 259-269
[c10]Koushik Kar, Murali S. Kodialam, T. V. Lakshman: Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows. INFOCOM 2002- 2001
[c9]Murali S. Kodialam, T. V. Lakshman: Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks. INFOCOM 2001: 358-366
[c8]Murali S. Kodialam, T. V. Lakshman: Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. INFOCOM 2001: 376-385
[c7]
[c6]Lotfi Benmohamed, Joseph G. Kneuer, Murali S. Kodialam, Yung-Terng Wang: Connection Admission Control for the Real-Time VBR Service in an ATM Switch with per-VC Queueing. ISCC 2001: 399-404- 2000
[j1]Koushik Kar, Murali S. Kodialam, T. V. Lakshman: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE Journal on Selected Areas in Communications 18(12): 2566-2579 (2000)
[c5]Murali S. Kodialam, T. V. Lakshman: Minimum Interference Routing with Applications to MPLS Traffic Engineering. INFOCOM 2000: 884-893
[c4]Murali S. Kodialam, T. V. Lakshman: Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration. INFOCOM 2000: 902-911
[c3]Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Online multicast routing with bandwidth guarantees: a new approach using multicast network flow. SIGMETRICS 2000: 296-306
1990 – 1999
- 1999
[c2]- 1991
[c1]Murali S. Kodialam, James B. Orlin: Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming. SODA 1991: 131-135
Coauthor Index
[j21] [j20] [c55] [c54] [j19] [j18] [j17] [c53] [j16] [c51] [c50] [j15] [j14] [j13] [c49] [c48] [c47] [c46] [c45] [c44] [j12] [c42] [c41] [j11] [j10] [c40] [c38] [c35] [j9] [j8] [c33] [c32] [c31] [c30] [c29] [c28] [j6] [c26] [c25] [c24] [c23] [c21] [c19] [c18] [c17] [j4] [j3] [j2] [c16] [c15] [c14] [c13] [c11] [c10] [c9] [c8] [j1] [c5] [c4] [c3]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:07 CET by the dblp team



