Sciweavers

240 search results - page 14 / 48
» On the One-Dimensional Optimal Switching Problem
Sort
View
GLOBECOM
2007
IEEE
14 years 4 months ago
Joint Congestion Control and Burst Contention Resolution in Optical Burst Switching Networks
Abstract— This paper revisits burst contention resolution problems in optical burst switching (OBS) networks from the viewpoint of network utility maximization. Burst collision o...
Won-Seok Park, Minsu Shin, Hyang-Won Lee, Song Cho...
HYBRID
2004
Springer
14 years 3 months ago
Network Congestion Alleviation Using Adjoint Hybrid Control: Application to Highways
Abstract. This paper derives an optimization-based control methodology for networks of switched and hybrid systems in which each mode is governed by a partial differential equatio...
Alexandre M. Bayen, Robin L. Raffard, Claire Tomli...
CVPR
2010
IEEE
14 years 6 months ago
Tiered Scene Labeling with Dynamic Programming
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
Pedro Felzenszwalb, Olga Veksler
ICETET
2009
IEEE
14 years 4 months ago
Best Fit Void Filling Algorithm in Optical Burst Switching Networks
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switche...
M. Nandi, Ashok K. Turuk, D. K. Puthal, S. Dutta
ICNP
2002
IEEE
14 years 2 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...