625 search results - page 65 / 125 » Routing in Trees |
QOSIP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
NETWORKING
2008
13 years 11 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
ICN
2005
Springer
14 years 3 months ago
2005
Springer
We propose a mobile multicast routing protocol based on the timer-based mobile multicast (TBMOM). A mobile host that stays in a foreign network receives multicast datagrams from a ...
ICUMT
2009
13 years 7 months ago
2009
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...