Sciweavers

290 search results - page 35 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
67
Voted
DCC
2007
IEEE
15 years 9 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
CN
2002
112views more  CN 2002»
14 years 9 months ago
State-dependent M/G/1 type queueing analysis for congestion control in data networks
Abstract--We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poi...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
WCNC
2010
IEEE
15 years 1 months ago
Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
Kun Zhu, Dusit Niyato, Ping Wang
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Security for Wiretap Networks via Rank-Metric Codes
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
Danilo Silva, Frank R. Kschischang
80
Voted
CN
2006
75views more  CN 2006»
14 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon