Sciweavers

73 search results - page 6 / 15
» The Value-of-Information in Matching with Queues
Sort
View
ISCC
2003
IEEE
15 years 2 months ago
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches.
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
Mei Yang, Si-Qing Zheng
TCOM
2008
74views more  TCOM 2008»
14 years 9 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
WCNC
2008
IEEE
15 years 4 months ago
Computing TCP Throughput in a UMTS Network
— We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separa...
Kunde Anand, Vinod Sharma
IDEAL
2000
Springer
15 years 1 months ago
Round-Table Architecture for Communication in Multi-agent Softbot Systems
In multi -agent systems based on softbots, communication architectures have significant influences on system performance as interaction and cooperation of softbots are carried out...
Pham Hong Hanh, Tran Cao Son
CN
2008
100views more  CN 2008»
14 years 9 months ago
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
Arzad Alam Kherani, Ralph El Khoury, Rachid El Azo...