Sciweavers

290 search results - page 41 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
CCR
2004
62views more  CCR 2004»
14 years 9 months ago
Methodological frameworks for large-scale network analysis and design
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
Antonis Papachristodoulou, Lun Li, John C. Doyle
INFOCOM
2011
IEEE
14 years 1 months ago
Multi-path routing and rate allocation for multi-source video on-demand streaming in wireless mesh networks
Abstract—We study the multi-source video on-demand application in multi-channel multi-radio wireless mesh networks. When a user initiates a new video request, the application can...
Yong Ding, Yang Yang, Li Xiao
ICDCSW
2005
IEEE
15 years 3 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
STACS
2007
Springer
15 years 3 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
67
Voted
TON
2008
99views more  TON 2008»
14 years 9 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly