Sciweavers

38 search results - page 3 / 8
» Minimum Rate Guarantee Without Per-Flow Information
Sort
View
INFOCOM
2000
IEEE
13 years 9 months ago
Minimum Interference Routing with Applications to MPLS Traffic Engineering
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
Murali S. Kodialam, T. V. Lakshman
INFOCOM
2002
IEEE
13 years 11 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
14 years 18 days ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
ICNP
1997
IEEE
13 years 9 months ago
On path selection for traffic with bandwidth guarantees
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Qingming Ma, Peter Steenkiste
GLOBECOM
2007
IEEE
13 years 10 months ago
CAC for Multibeam Opportunistic Schemes in Heterogeneous WiMax Systems Under QoS Constraints
Spatial scheduling in a heterogeneous WiMax Downlink channel, based on partial Channel State Information at the Transmitter (CSIT), is carried out through a multibeam opportunistic...
Nizar Zorba, Ana I. Pérez-Neira