Sciweavers

1015 search results - page 94 / 203
» An efficient algorithm for AS path inferring
Sort
View
TON
2008
109views more  TON 2008»
13 years 8 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
MASS
2010
173views Communications» more  MASS 2010»
13 years 6 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...
JFP
2000
163views more  JFP 2000»
13 years 8 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
ICDCSW
2005
IEEE
14 years 1 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
ISCC
2005
IEEE
105views Communications» more  ISCC 2005»
14 years 1 months ago
Enhanced Protection Using Shared Segment Backups in a Multiservice GMPLS-Based Networks
The paper presents a novel protection methodology for setting protected paths in a multiservice GMPLSbased network scenario. By applying the proposed methods, label switched paths...
Anna Urra, Eusebi Calle, José-Luis Marzo