Sciweavers

914 search results - page 25 / 183
» Branch and Bound on the Network Model
Sort
View
COR
2004
111views more  COR 2004»
14 years 9 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
MOBIHOC
2007
ACM
15 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
IWQOS
2004
Springer
15 years 3 months ago
Network calculus meets queueing theory -a simulation based approach to bounded queues
— Quality of Service (QoS) is an area with high academic curiosity. Our long-term goal is to develop a unified mathematical model. This paper is a first step towards this ambit...
Krishna Pandit, Jens Schmitt, Ralf Steinmetz
JPDC
2007
184views more  JPDC 2007»
14 years 9 months ago
Modeling of concurrent web sessions with bounded inconsistency in shared data
Client interactions with modern web-accessible network services are typically organized into sessions involving multiple requests that read and write shared application data. Ther...
Alexander Totok, Vijay Karamcheti
NETWORKS
2008
14 years 9 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani