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