Sciweavers

2266 search results - page 141 / 454
» Generalizing parametric timing analysis
Sort
View
INFOCOM
2000
IEEE
15 years 10 months ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li
CN
2006
106views more  CN 2006»
15 years 6 months ago
Model-based end-to-end available bandwidth inference using queueing analysis
End-to-end available bandwidth estimation between Internet hosts is important to understand network congestion and enhance the performance of Quality-of-Service (QoS) demanding ap...
Xiaojun Hei, Brahim Bensaou, Danny H. K. Tsang
EMSOFT
2006
Springer
15 years 10 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
STACS
2004
Springer
15 years 11 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
PODC
2005
ACM
15 years 12 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling