Search results for "routing"
showing 10 items of 587 documents
A General Approach on Picard Operators
2021
In the chapter there are presented the recent investigations concerning the existence and the uniqueness of fixed points for the mappings in the setting of spaces which are not metric with different functions of measuring the distance and in consequence with the various convergence concepts. In this way we obtain the systematized knowledge of fixed point tools which are, in some situations, more convenient to apply than the known theorems with an underlying usual metric space. The appropriate illustrative examples are also presented.
Using MANET Protocols in Wireless Sensor and Actor Networks
2008
Although there are several routing protocols for wireless sensor and actor networks (WSAN), none of them have became standard. Now, there are several standard protocols for mobile ad hoc networks (MANET) that have been developed for devices with higher computing features than the sensor nodes. On the other hand, one of the main characteristics of the MANET protocols is their scalability. In this paper, we show the performance of a WSAN, when MANET protocols are used, for several topologies. We will discuss and evaluate which standard protocol is the best one depending on the number of nodes in the topology and depending on their mobility. Finally we will show their comparison. As far as we …
Group mobility impact over TCP and CBR traffic in mobile ad hoc networks
2004
We present an analysis of the effect that mobility models have over the performance of a mobile ad hoc network. We concentrate on group mobility because there is a growing attention on the development and evaluation of MANET's approach applied to personal area networks (PANs), especially based on Bluetooth technology. We investigate the effect that the mobility model has on the performance of CBR traffic and TCP traffic. We propose four different group mobility models and describe a mobility pattern generator called grcmob to be used with the ns-2 simulator. We perform a thorough evaluation of a MANET behavior using as a reference the behavior obtained with the random waypoint mobility mode…
A new algorithm for a robust solution of the fully dynamic Saint-Venant equations
2003
A new procedure for the numerical solution of the fully dynamic shallow water equations is presented. The procedure is a fractional step methodology where the original system is split into two sequential ones. The first system differs from the original one because of the head gradient term, that is treated as constant and equal to the value computed at the end of the previous time step. The solution of this system, called kinematic, is computed in each element using a spatial zero order approximation for both the heads and the flow rates by means of integration of single ODEs. The second system is called diffusive, contains in the momentum equations only the complementary terms and can be e…
A dilution test for the convergence of subseries of a monotone series
2010
Cauchy's condensation test allows to determine the convergence of a monotone series by looking at a weighted subseries that only involves terms of the original series indexed by the powers of two. It is natural to ask whether the converse is also true: Is it possible to determine the convergence of an arbitrary subseries of a monotone series by looking at a suitably weighted version of the original series? In this note we show that the answer is affirmative and introduce a new convergence test particularly designed for this purpose.
On the potential of NoC virtualization for multicore chips
2008
As the end of Moores-law is on the horizon, power becomes a limiting factor to continuous increases in performance gains for single-core processors. Processor engineers have shifted to the multicore paradigm and many-core processors are a reality. Within the context of these multi-core chips, three key metrics point themselves out as being of major importance, performance, fault-tolerance (including yield), and power consumption. A solution that optimizes all three of these metrics is challenging. As the number of cores increases the importance of the interconnection network-on-chip (NoC) grows as well, and chip designers should aim to optimize these three key metrics in the NoC context as …
Efficient formulation of Multimode Equivalent Networks for 2-D waveguide steps through Kummer's transformation
2017
In this paper we present a new and improved formulation for the Multimode Equivalent Network (MEN) representation of arbitrary waveguide junctions. In the new formulation the Kummer's transformation is used to separate the kernel into dynamic and static parts, by introducing higher order extraction terms. The main difference with respect to the old formulation is that the approximation of the kernel is more accurate and the numerical computations are more efficient. In addition to theory, both formulations are compared in terms of efficiency and convergence thereby fully validating the proposed new formulation.
An Efficient Distributed Algorithm for Generating Multicast Distribution Trees
2005
Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in Networks) is prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require complete knowledge of the network topology. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem. The algorithm allows the construction of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been i…
Multicast access control concept for xDSL-customers
2006
Multicast is a tempting possibility for many broad- band services. It makes possible to deliver one data-stream to several receivers simultaneously. IP-Multicast is based on an open group concept. This means that it is possible for all the users to join the group and thus receive the data. The open concept is also the main reason why multicast has not been taken in wider use. There is two different solution to solve this problem, group access control and multicast data encryption. Group access control mechanisms focuses on restricting the group membership at the users edge device. Traffic encryption scheme relies on end-to-end encryption, so a key management architecture is also needed. We …
Quality of Service Multicasting over Differentiated Services Networks
2003
This paper proposes a solution to support real-time multicast traffic with Quality of Service (QoS) constraints over Differentiated Services (DiffServ) IP networks. Our solution allows multicast users to dynamically join and leave the multicast tree. Moreover, it allows a multicast user which has negotiated a best-effort session to upgrade to a QoS-enabled session. Our solution is backward compatible with the Protocol Independent Multicast (PIM) scheme. It combines two ideas. First, resource availability along a new QoS path is verified via a probe-based approach. Second, QoS is maintained by marking replicated packets with a special DSCP value, before forwarding them on the QoS path.