|
IMPROVING SCFQ TO SUPPORT BURSTY TRAFFIC
|
#
|
1392 - 01
|
|
|
Design and Implementation of a Shared Memory Switch Fabric
|
#
|
1392 - 01
|
|
|
Delay Analysis of Randomized Algorithms for Link Scheduling in Wireless Networks
|
#
|
1391 - 11
|
|
|
The Impact of Network Topology on Delay Bound in Wireless Ad HocNetworks
|
#
|
1391 - 11
|
|
|
Route Lookup Algorithms Using the Novel Idea of Coded Prefix Trees
|
#
|
1391 - 06
|
|
|
Real-Time Intrusion Detection Alert Correlation and Attack Scenario Extraction Based on the Prerequisite-Consequence Approach
|
#
|
1391 - 04
|
|
|
On the Necessary and Sufficient Requirement of CIOQ Switch to Emulate an Output Queued Switch
|
#
|
1391 - 04
|
|
|
A High Performance and Intrinsically Secure Key Establishment Protocol for Wireless Sensor Networks
|
#
|
1390 - 03
|
|
|
Coded and Scalar Prefix Trees Prefix Matching Using the Novel Idea of Double Relation chains
|
#
|
1390 - 03
|
|
|
IP lookup Using the Novel Idea of Scalar Prefix Search with Fast Table Updates
|
#
|
1389 - 08
|
|
|
Low-power dual-edge triggered state-retention scan flip-flop
|
#
|
1389 - 06
|
|
|
An Efficient Symmetric Polynomial-based Key Establishment Protocol for Wireless Sensor Networks
|
#
|
1389 - 04
|
|
|
An Efficient Symmetric Polynomial- Based Key Estabilishment Protocol for Wireless Sensor Networks
|
#
|
1389 - 04
|
|
|
Encoding Finite Sources with Ranked Probabilities
|
#
|
1388 - 08
|
|
|
Extension of the Lasserre-Avrachenkov Theorem on the Integral of Multilinear Forms over the Simplices
|
#
|
1388 - 03
|
|
|
The CPBT A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
|
#
|
1386 - 01
|
|
|
Mobile Ad Hoc Relaying for Upward Vertical Handoff in Hybrid WLAN/Cellular Systems
|
#
|
1386 - 01
|
|
|
The Minimum Average Code for Finite Memoryless Monotone Sources
|
#
|
1385 - 12
|
|
|
A Proportionally-Fair Algorithm for Loss-Free Rate Allocation to Elastic Users
|
#
|
1385 - 01
|
|
|
Mobility Model for Hybrid WLAN/Cellular Systems
|
#
|
1385 - 01
|
|