Sciweavers

3638 search results - page 506 / 728
» Optimization via communication networks
Sort
View
CCR
2004
86views more  CCR 2004»
15 years 6 months ago
IPv4 address allocation and the BGP routing table evolution
The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address ...
Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, Geoff Hu...
INFOCOM
1997
IEEE
15 years 10 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
IJIPT
2007
111views more  IJIPT 2007»
15 years 6 months ago
System architecture of a mobile message transport system
Many scenarios of beyond 3G mobile communications describe the integration of various access technologies into one system. Being always best connected under certain optimization c...
Bernd Gloss
INFOCOM
2010
IEEE
15 years 5 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
GLOBECOM
2007
IEEE
16 years 28 days ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu