Sciweavers

1414 search results - page 98 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
KIVS
2009
Springer
14 years 3 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
INFOCOM
1995
IEEE
14 years 17 days ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
AICT
2009
IEEE
130views Communications» more  AICT 2009»
14 years 2 months ago
Modelling an Isolated Compound TCP Connection
—Compound TCP (CTCP) was designed by Tan at al. to improve the efficiency of TCP on high speed networks without unfairly penalizing other connections. In this work we analyze an...
Alberto Blanc, Denis Collange, Konstantin Avrachen...
INFOCOM
2002
IEEE
14 years 1 months ago
Constraint-based path selection methods for on-demand provisioning in WDM networks
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
Admela Jukan, Gerald Franzl
IPPS
2005
IEEE
14 years 2 months ago
On the Impact of IPsec on Interactive Communications
Interactive communication services as telephony and video-conferences use the infrastructure of existing LANs and the Internet more and more. The advantages are obvious. For examp...
Jirka Klaue, Andreas Hess