dblp.uni-trier.dewww.uni-trier.de

Murali S. Kodialam

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
51EEFang Hao, Murali S. Kodialam, T. V. Lakshman: Incremental Bloom Filters. INFOCOM 2008: 1067-1075
50EERandeep 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)
2007
49EEWing 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
48EEKemal 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
47EEMurali S. Kodialam, Thyaga Nandagopal, Wing Cheong Lau: Anonymous Tracking Using RFID Tags. INFOCOM 2007: 1217-1225
46EEMurali S. Kodialam, T. V. Lakshman: Achievable Rate Region for Wireless Systems with Time Varying Channels. INFOCOM 2007: 53-61
45EEFang Hao, Murali S. Kodialam, T. V. Lakshman: Building high accuracy bloom filters using partitioned hashing. SIGMETRICS 2007: 277-288
44EEAbhishek 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
43EEMurali 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)
42EEFang 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)
2006
41EEMurali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Throughput Guaranteed Restorable Routing Without Traffic Prediction. ICNP 2006: 137-146
40EEMurali 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
39EERui Zhang-Shen, Murali S. Kodialam, T. V. Lakshman: Achieving Bounded Blocking in Circuit-Switched Networks. INFOCOM 2006
38EEFang Hao, Murali S. Kodialam, T. V. Lakshman, Vivek Vishnumurthy, Hui Zhang: Content Based Rate Estimation Using Lazy Membership Testing. INFOCOM 2006
37EEMurali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Maximum Throughput Routing of Traffic in the Hose Model. INFOCOM 2006
36EEMurali S. Kodialam, T. V. Lakshman, James B. Orlin, Sudipta Sengupta: Preconfiguring IP-Over-Optical Networks to Handle Router Failures and Unpredictable Traffic. INFOCOM 2006
35EEMurali S. Kodialam, Thyaga Nandagopal: Fast and reliable estimation schemes in RFID systems. MOBICOM 2006: 322-333
34EERandeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Fast network re-optimization schemes for MPLS and optical networks. Computer Networks 50(3): 317-331 (2006)
33EERandeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Finding disjoint paths with related path costs. J. Comb. Optim. 12(1-2): 83-96 (2006)
2005
32EEFang Hao, Murali S. Kodialam, T. V. Lakshman, Hui Zhang: Fast payload-based flow estimation for traffic monitoring and network security. ANCS 2005: 211-220
31EEFang Hao, Murali S. Kodialam, T. V. Lakshman, Hui Zhang: Fast, memory-efficient traffic estimation by coincidence counting. INFOCOM 2005: 2080-2090
30EEMurali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Configuring networks with content filtering nodes with applications to network security. INFOCOM 2005: 2395-2404
29EERandeep Bhatia, Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Capacity allocation and routing of locally restorable bandwidth guaranteed connections. INFOCOM 2005: 2691-2701
28EEMurali S. Kodialam, Thyaga Nandagopal: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. MOBICOM 2005: 73-87
27EEMurali 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)
26EEIsaac 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)
2004
25EEFang Hao, Murali S. Kodialam, T. V. Lakshman: Real-Time Detection of Hidden Traffic Patterns. ICNP 2004: 340-349
24EEMurali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: A Simple Traffic Independent Scheme for Enabling Restoration Oblivious Routing of Resilient Connections. INFOCOM 2004
23EERandeep Bhatia, Murali S. Kodialam: On Power Efficient Communication over Multi-hop Wireless Networks: Joint Routing, Scheduling and Power Control. INFOCOM 2004
22EEMurali S. Kodialam, T. V. Lakshman, Shantidev Mohanty: Runs bAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. INFOCOM 2004
21EEFang Hao, Murali S. Kodialam, T. V. Lakshman: ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation. SIGMETRICS 2004: 155-166
2003
20EEMurali S. Kodialam, T. V. Lakshman: Detecting Network Intrusions via Sampling: A Game Theoretic Approach. INFOCOM 2003
19EEIsaac Keslassy, Murali S. Kodialam, T. V. Lakshman, Dimitrios Stiliadis: On Guaranteed Smooth Scheduling For Input-Queued Switches. INFOCOM 2003
18EEKoushik Kar, Murali S. Kodialam, T. V. Lakshman, Leandros Tassiulas: Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks. INFOCOM 2003
17EERandeep Bhatia, Murali S. Kodialam, T. V. Lakshman: Fast Network Re-optimization Schemes for MPLS and Optical Networks. IWQoS 2003: 249-265
16EEMurali S. Kodialam, Thyagarajan Nandagopal: Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem. MOBICOM 2003: 42-54
15EEMurali 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)
14EEMurali 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)
13EEKoushik 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)
12EEMurali 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)
2002
11EEMurali S. Kodialam, T. V. Lakshman: Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup. ICNP 2002: 259-269
10EEKoushik Kar, Murali S. Kodialam, T. V. Lakshman: Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows. INFOCOM 2002
2001
9EEMurali S. Kodialam, T. V. Lakshman: Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks. INFOCOM 2001: 358-366
8EEMurali S. Kodialam, T. V. Lakshman: Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels Using Aggregated Link Usage Information. INFOCOM 2001: 376-385
7EEMurali S. Kodialam: The Throughput of Sequential Testing. IPCO 2001: 280-292
6EELotfi 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
5EEMurali S. Kodialam, T. V. Lakshman: Minimum Interference Routing with Applications to MPLS Traffic Engineering. INFOCOM 2000: 884-893
4EEMurali S. Kodialam, T. V. Lakshman: Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration. INFOCOM 2000: 902-911
3EEMurali S. Kodialam, T. V. Lakshman, Sudipta Sengupta: Online multicast routing with bandwidth guarantees: a new approach using multicast network flow. SIGMETRICS 2000: 296-306
1999
2 Murali S. Kodialam, Steven H. Low: Resource Allocation in a Multicast Tree. INFOCOM 1999: 262-266
1991
1 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

1Krishna Balachandran [48]
2Lotfi Benmohamed [6]
3Randeep Bhatia [17] [23] [29] [33] [34] [44] [50]
4H. Jonathan Chao [49]
5Fang Hao [21] [25] [31] [32] [38] [42] [45] [51]
6Joseph H. Kang [48]
7Koushik Kar [10] [13] [18]
8Kemal Karakayali [48]
9Abhishek Kashyap [44]
10Isaac Keslassy [19] [26]
11Joseph G. Kneuer [6]
12T. V. Lakshman [3] [4] [5] [8] [9] [10] [11] [13] [14] [15] [17] [18] [19] [20] [21] [22] [24] [25] [26] [29] [30] [31] [32] [33] [34] [36] [37] [38] [39] [40] [41] [42] [43] [45] [46] [49] [50] [51]
13Wing Cheong Lau [47] [49]
14Steven H. Low [2]
15Shantidev Mohanty [22] [42]
16Thyaga Nandagopal (Thyagarajan Nandagopal) [16] [27] [28] [35] [47]
17James B. Orlin [1] [36] [40] [43]
18Sudipta Sengupta [3] [14] [24] [29] [30] [36] [37] [40] [41] [43] [44] [50]
19Dimitrios Stiliadis [19] [26]
20Leandros Tassiulas [18]
21V. Venkateswaran [12]
22Vivek Vishnumurthy [38]
23Yung-Terng Wang [6]
24Hui Zhang [31] [32] [38]
25Rui Zhang-Shen [39]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)