Sciweavers

86 search results - page 4 / 18
» Flows in dynamic networks with aggregate arc capacities
Sort
View
INFOCOM
2003
IEEE
14 years 6 days ago
Flow Level Simulation of Large IP Networks
— The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network par...
François Baccelli, Dohy Hong
BROADNETS
2006
IEEE
13 years 10 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
TAMC
2009
Springer
14 years 1 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
ICC
2009
IEEE
196views Communications» more  ICC 2009»
14 years 1 months ago
Joint Flow Control, Routing and Medium Access Control in Random Access Multi-Hop Wireless Networks
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
Sucha Supittayapornpong, Poompat Saengudomlert
BROADNETS
2007
IEEE
14 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta