Sciweavers

1127 search results - page 8 / 226
» New Algorithms for Generalized Network Flows
Sort
View
MSWIM
2006
ACM
15 years 3 months ago
Gateway adaptive pacing for TCP across multihop wireless networks and the Internet
In this paper, we introduce an effective congestion control scheme for TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the wired Int...
Sherif M. ElRakabawy, Alexander Klemm, Christoph L...
WWW
2007
ACM
15 years 10 months ago
Identifying and discriminating between web and peer-to-peer traffic in the network core
Traffic classification is the ability to identify and categorize network traffic by application type. In this paper, we consider the problem of traffic classification in the netwo...
Jeffrey Erman, Anirban Mahanti, Martin F. Arlitt, ...
ISCC
2006
IEEE
128views Communications» more  ISCC 2006»
15 years 4 months ago
Adjacent 2-Route Flow Approach for Restorable Dynamic Routing in MPLS Networks
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...
Krzysztof Walkowiak
NETWORKS
2002
14 years 9 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
MOR
2000
162views more  MOR 2000»
14 years 9 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan