Sciweavers

367 search results - page 65 / 74
» Evolutionary Algorithm for Congestion Problem in Connection-...
Sort
View
SPAA
2004
ACM
14 years 23 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
NETGAMES
2006
ACM
14 years 1 months ago
A distributed architecture for MMORPG
We present an approach to support Massively Multiplayer Online Role-Playing Games. Our proposed solution begins by splitting the large virtual world into smaller regions, each reg...
Marios Assiotis, Velin Tzanov
ANSS
2005
IEEE
14 years 29 days ago
An Extensible Platform for Evaluating Security Protocols
We present a discrete-event network simulator, called Simnet, designed specifically for analyzing networksecurity protocols. The design and implementation is focused on simplicit...
Seny Kamara, Darren Davis, Lucas Ballard, Ryan Cau...
ICMCS
2005
IEEE
110views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Estimating Packet Arrival Times in Bursty Video Applications
In retransmission-based error-control methods, the most fundamental yet the paramount problem is to determine how long the sender (or the receiver) should wait before deciding tha...
Ali C. Begen, Yucel Altunbasak
INFOCOM
2003
IEEE
14 years 19 days ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle