 | 2008 |
|---|
| 11 |       | K. R. Raghu,
Sanjay K. Bose,
Maode Ma:
A Queue Based Scheduling Approach for WMAN with Adaptive Augmentation.
WCNC 2008: 1374-1379 |
| 10 | | Wesley Chee-Wah Tan,
Sanjay K. Bose:
Throughput and lifetime performance of cost-credit-based routing protocols for power constrained ad hoc networks.
Computer Communications 31(17): 3964-3977 (2008) |
| 9 | | Hongtao Tian,
Sanjay K. Bose,
Choi Look Law,
Wendong Xiao:
Joint routing and flow rate optimization in multi-rate ad hoc networks.
Computer Networks 52(3): 739-764 (2008) |
| 2002 |
|---|
| 8 |  | Bill Lloyd-Smith,
Richard Harris,
Sanjay K. Bose:
Link and Path Metrics for Broadband Networks: Simulation Studies Using the Encourager Program.
INTERWORKING 2002: 251-263 |
| 2001 |
|---|
| 7 | | G. Shen,
Tee Hiang Cheng,
Sanjay K. Bose,
Chao Lu,
Teck Yoong Chai,
H. M. M. Hosseini:
Approximate analysis of limited-range wavelength conversion all-optical WDM networks.
Computer Communications 24(10): 949-957 (2001) |
| 6 | | G. Shen,
Sanjay K. Bose,
Tee Hiang Cheng,
Chao Lu,
Teck Yoong Chai:
Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads.
Computer Communications 24(3-4): 364-373 (2001) |
| 2000 |
|---|
| 5 | | Hema Tahilramani Kaur,
D. Manjunath,
Sanjay K. Bose:
The Queuing Network Analysis Tool (QNAT).
MASCOTS 2000: 341- |
| 1999 |
|---|
| 4 | | Hema Tahilramani Kaur,
D. Manjunath,
Sanjay K. Bose:
Approximate Analysis of Open Network of GE/GE/m/N Queues with Transfer Blocking.
MASCOTS 1999: 164- |
| 1997 |
|---|
| 3 | | B. Venkataramani,
Sanjay K. Bose,
K. R. Srivathsan:
Queuing analysis of a non-pre-emptive MMPP/D/1 priority system.
Computer Communications 20(11): 999-1018 (1997) |
| 1995 |
|---|
| 2 | | T. Srinivasa Rao,
Sanjay K. Bose,
K. R. Srivathsan:
Using maximum entropy principle for output burst characterization of an ATM switch.
Modelling and Evaluation of ATM Networks 1995: 22-38 |
| 1992 |
|---|
| 1 | | T. Srinivasa Rao,
Sanjay K. Bose,
K. R. Srivathsan:
An Approach for Automatic Generation of Simulators for a Class of Random Access Algorithms.
NETWORKS 1992: 129-140 |
