Results 1  10
of
12
ubiSOAP: A Service Oriented Middleware for Seamless Networking
 in "Proceedings of 6th International Conference on Service Oriented Computing (ICSOC’08
, 2008
"... Abstract. The computing and networking capacities of today’s wireless portable devices allow for pervasive services, which are seamlessly networked. Indeed, wireless handheld devices now embed the necessary resources to act as both service clients and providers. However, the seamless networking of s ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The computing and networking capacities of today’s wireless portable devices allow for pervasive services, which are seamlessly networked. Indeed, wireless handheld devices now embed the necessary resources to act as both service clients and providers. However, the seamless networking of services remains challenged by the inherent mobility and resource constraints of devices, which make services a priori highly volatile. This paper discusses the design, implementation and experimentation of the ubiSOAP serviceoriented middleware, which leverages wireless networking capacities to effectively enable the seamless networking of services. ubiSOAP specifically defines a layered communication middleware that underlies standard SOAPbased middleware, hence supporting legacy services while exploiting nowadays pervasive connectivity. 1
Exploiting MultiInterface Networks: Connectivity and Cheapest Paths
 Wireless Networks
"... Abstract. Let G = (V, E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order t ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Let G = (V, E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at least one active interface. In general, every node holds a subset of all the possible k interfaces. Such networks are known as multiinterface networks. In this setting, we study two basic problems: Connectivity and Cheapest Path. The Connectivity problem corresponds to the wellknown Minimum Spanning Tree problem in graph theory. In practice, we need to cover a subgraph of G of minimum cost which contains a spanning tree of G. The problem turns out to be APXhard in general and for many restricted graph classes, however it is possible to provide approximation algorithms: a 2approximation in general and a (2 − 1 k)approximation for the unit cost interface case, i.e. when the cost of activating an interface is unitary for any interface. We also consider the problem in special graph classes, such as graphs of bounded degree, planar graphs, graphs of bounded treewidth, complete graphs. The Cheapest Path problem corresponds to the wellknown Shortest Path problem in graph theory. In the multiinterface setting this problem is still polynomially solvable, and we point out a simple Dijsktrabased algorithm with O(kE  + kV  log(k + V )) runtime in general and O(k(E  + V )) runtime for the unit cost interface case.
Minimize the Maximum Duty in MultiInterface Networks
 ALGORITHMICA
, 2011
"... ..."
(Show Context)
Cheapest paths in multiinterface networks
 In Proceedings of the 10th International Conference on Distributed Computing and Networking (ICDCN), Lecture Notes in Computer Science
, 2009
"... Abstract. Let G = (V, E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order t ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Let G = (V, E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at least one active interface. In general, every node holds a subset of all the possible k interfaces. Such networks are known as the multiinterface networks. In such networks, we study a basic problem called Cheapest Paths, corresponding to the wellknown Shortest Path problem in graph theory. Cheapest Paths turns out to be polynomially solvable in O(kV E) in general, and in O(kE) in the uniform cost case, i.e., when the cost of activating an interface is the same for any interface.
Bandwidth Constrained MultiInterface Networks
 IN PROC. OF THE 37TH INTERNATIONAL CONFERENCE ON CURRENT TRENDS IN THEORY AND PRACTICE OF COMPUTER SCIENCE (SOFSEM), VOLUME 6543 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2011
"... In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at leas ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In heterogeneous networks, devices can communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost, and provides a communication bandwidth. In this paper, we consider the problem of activating the cheapest set of interfaces among a network G = (V, E) in order to guarantee a minimum bandwidth B of communication between two specified nodes. Nodes V represent the devices, edges E represent the connections that can be established. In practical cases, a bounded number k of different interfaces among all the devices can be considered. Despite this assumption, the problem turns out to be NPhard even for small values of k and ∆, where ∆ is the maximum degree of the network. In particular, the problem is NPhard for any fixed k ≥ 2 and ∆ ≥ 3, while it is polynomially solvable when k = 1, or ∆ ≤ 2 and k = O(1). Moreover, we show that the problem is not approximable within η log B or Ω(log log V ) for any fixed k ≥ 3, ∆ ≥ 3, and for a certain constant η, unless P = NP. We then provide an approximation algorithm with ratio guarantee of bmax, where bmax is the maximum communication bandwidth allowed among all the available interfaces. Finally, we focus on particular cases by providing complexity results and polynomial algorithms for ∆ ≤ 2.
Flow problems in multiinterface networks
 IEEE TRANSACTIONS ON COMPUTERS
, 2012
"... In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one ac ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two fundamental optimization problems. In the first one (Maximum Flow in MultiInterface Networks, MFMI), we aim to establish the maximal bandwidth that can be guaranteed between two given nodes of the input network. In the second problem (MinimumCost Flow in MultiInterface Networks, MCFMI), we look for activating the cheapest set of interfaces among a network in order to guarantee a minimum bandwidth B of communication between two specified nodes. We show that MFMI is polynomially solvable while MCFMI is NPhard even for a bounded number of different interfaces and bounded degree networks. Moreover, we provide polynomial approximation algorithms for MCFMI and exact algorithms for relevant subproblems. Finally, we experimentally analyze the proposed approximation algorithm, showing that in practical cases it guarantees a low approximation ratio.
MinMax Coverage in MultiInterface Networks
 In Proc. of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 6543 of Lecture Notes in Computer Science
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
1ubiSOAP: A Service Oriented Middleware for Ubiquitous Networking
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
WITH
"... Abstract—The computing and networking capacities of today’s wireless portable devices allow for ubiquitous services, which are seamlessly networked. Indeed, wireless handheld devices now embed the necessary resources to act as both service clients and providers. However, the ubiquitous networking of ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—The computing and networking capacities of today’s wireless portable devices allow for ubiquitous services, which are seamlessly networked. Indeed, wireless handheld devices now embed the necessary resources to act as both service clients and providers. However, the ubiquitous networking of services remains challenged by the inherent mobility and resource constraints of the devices, which make services a priori highly volatile. This paper discusses the design, implementation and experimentation of the ubiSOAP serviceoriented middleware, which leverages wireless networking capacities to effectively enable the ubiquitous networking of services. ubiSOAP specifically defines a layered communication middleware that underlies standard SOAPbased middleware, hence supporting legacy Web Services while exploiting nowadays ubiquitous connectivity.
ProjectTeam ARLES Software Architectures and Distributed Systems
"... c t i v it y e p o r t 2007 Table of contents ..."
(Show Context)