 | 2006 |
| 11 |  | Daniel Fokum,
Cory C. Beard:
A Scheme for Improved Delay and Frame Drop Probabilities in 802.11e Networks.
Wireless and Optical Communications 2006 |
| 10 |  | Dijiang Huang,
Qing Cao,
Amit Sinha,
Marc J. Schniederjans,
Cory C. Beard,
Lein Harn,
Deep Medhi:
New architecture for intra-domain network security issues.
Commun. ACM 49(11): 64-72 (2006) |
| 2005 |
| 9 |  | Manali Joshi,
Ajay Mansata,
Salil Talauliker,
Cory C. Beard:
Design and analysis of multi-level active queue management mechanisms for emergency traffic.
Computer Communications 28(2): 162-173 (2005) |
| 8 |  | Cory C. Beard:
Preemptive and delay-based mechanisms to provide preference to emergency traffic.
Computer Networks 47(6): 801-824 (2005) |
| 2004 |
| 7 |  | Brijraj Vaghani,
Cory C. Beard:
A scheme to measure error rates inS. the presence of adjacent channel interference using frequency domain analysis.
Communications, Internet, and Information Technology 2004: 425-430 |
| 6 |  | Manali Joshi,
Cory C. Beard:
Reducing Queue-Fill Variability for Emergency Traffic in a Differentiated Services Network.
ICCCN 2004: 123-128 |
| 5 |  | Shekhar Srivastava,
Balaji Krithikaivasan,
Cory C. Beard,
Deep Medhi,
Appie van de Liefvoort,
Wesam Alanqar,
Ananth Nagarajan:
Benefits of traffic engineering using QoS routing schemes and network controls.
Computer Communications 27(5): 387-399 (2004) |
| 4 |  | Cory C. Beard,
Victor S. Frost:
Prioritization of Emergency Network Traffic Using Ticket Servers: A Performance Analysis.
Simulation 80(6): 289-299 (2004) |
| 2003 |
| 3 |  | Balaji Krithikaivasan,
Shekhar Srivastava,
Cory C. Beard,
Appie van de Liefvoort,
Deep Medhi:
Controlling Performance in the Congested Parts of an Asymmetric Network Using Controls and Routing.
ISCC 2003: 385-391 |
| 2 |  | Cory C. Beard,
Victor S. Frost:
Ticket Servers for Network Traffic Prioritization.
J. Network Syst. Manage. 11(2): 151-170 (2003) |
| 2001 |
| 1 |  | Cory C. Beard,
Victor Frost:
Prioritized resource allocation for stressed networks.
IEEE/ACM Trans. Netw. 9(5): 618-633 (2001) |