Sciweavers

109 search results - page 12 / 22
» Processor Sharing Flows in the Internet
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
HOTOS
1999
IEEE
13 years 11 months ago
The Case for Informed Transport Protocols
Wide-area distributed applications are frequently limited by the performance of Internet data transfer. We argue that the principle cause of this effect is the poor interaction be...
Stefan Savage, Neal Cardwell, Thomas E. Anderson
NETWORK
2008
106views more  NETWORK 2008»
13 years 7 months ago
Toward internet-wide multipath routing
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing pa...
Jiayue He, Jennifer Rexford
EUROMICRO
1998
IEEE
13 years 11 months ago
Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...
COMCOM
2004
114views more  COMCOM 2004»
13 years 7 months ago
WFI optimized PWGPS for wireless IP networks
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
Fei Xiang, Alan Marshall, Junzhou Luo