Sciweavers

224 search results - page 21 / 45
» Parallel Switching in Connection-Oriented Networks
Sort
View
ICN
2005
Springer
15 years 8 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
96
Voted
CLUSTER
2007
IEEE
15 years 9 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
103
Voted
IPPS
2007
IEEE
15 years 8 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat
126
Voted
IPPS
2007
IEEE
15 years 8 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
164
Voted
IAJIT
2011
14 years 6 months ago
Network load and packet loss optimization during handoff using multi-scan approach
: Handoff is a critical function that enables mobile nodes to stay connected to the wireless network by switching the data connection from one WLAN to another. During handoff the c...
Anwar Saif, Mohammed Othman