Sciweavers

5079 search results - page 87 / 1016
» Hidden-Action in Network Routing
Sort
View
MST
2010
106views more  MST 2010»
14 years 8 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
14 years 7 months ago
Optimal control in two-hop relay routing
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes ca...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
ICNP
2005
IEEE
15 years 3 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
PVLDB
2008
137views more  PVLDB 2008»
14 years 9 months ago
EasyTicket: a ticket routing recommendation engine for enterprise problem resolution
Managing problem tickets is a key issue in the IT services industry. A large service provider may handle thousands of problem tickets from its customer on daily basis. The efficie...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
MSN
2005
Springer
15 years 3 months ago
A Low Overhead Ad Hoc Routing Protocol with Route Recovery
Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In the paper, we pro...
Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Po Tsa...