Sciweavers

6245 search results - page 338 / 1249
» A Case for Aggregate Networks
Sort
View
EPEW
2007
Springer
16 years 27 days ago
A Fixed-Point Algorithm for Closed Queueing Networks
In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and ac...
Ramin Sadre, Boudewijn R. Haverkort, Patrick Reine...
MSWIM
2004
ACM
16 years 5 days ago
Modeling wireless shadow networks
In case of natural disasters or intentional attacks, telecommunication networks often get heavily damaged and current resilience schemes have proven to be insufficient for rapid r...
Filip De Turck, Aurel A. Lazar
JNCA
2008
104views more  JNCA 2008»
15 years 6 months ago
Computing in social networks with relationship algebra
Communities are the latest phenomena on the Internet. At the heart of each community lies a social network. In this paper, we show a generalized framework to understand and reason...
Javed I. Khan, Sajid S. Shaikh
NETWORKS
2011
15 years 1 months ago
On cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
MMB
2010
Springer
180views Communications» more  MMB 2010»
15 years 8 months ago
ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks
We present a tool for the analysis of fault-tolerance in packet-switched communication networks. Network elements like links or routers can fail or unexpected traffic surges may o...
David Hock, Michael Menth, Matthias Hartmann, Chri...