Search results for "Network topology"
showing 10 items of 192 documents
Nanoseconds Timing System Based on IEEE 1588 FPGA Implementation
2019
Clock synchronization procedures are mandatory in most physical experiments where event fragments are readout by spatially dislocated sensors and must be glued together to reconstruct key parameters (e.g. energy, interaction vertex etc.) of the process under investigation. These distributed data readout topologies rely on an accurate time information available at the frontend, where raw data are acquired and tagged with a precise timestamp prior to data buffering and central data collecting. This makes the network complexity and latency, between frontend and backend electronics, negligible within upper bounds imposed by the frontend data buffer capability. The proposed research work describ…
Gigabit Ethernet backbones with active loops
2001
The current standard Ethernet switches are based on the Spanning Tree (ST) protocol. Their most important restriction is that they can not work when the topology has active loops. In fact, the ST protocol selects a tree from the real topology by blocking the links that are not involved in the tree. This restriction produces a network traffic unbalancing behavior saturating those link near the root switch while rest of links will be idle or with a very low utilization. This paper proposes a new transparent switch protocol for Gigabit Ethernet backbones that considerably improves the performance of current ones. The proposed protocol is named ALOR for Active Loops and Optimal Routing. ALOR pr…
LSOM: A Link State protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
2003
This paper presents a new protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full free…
Two Levels SPF-Based System to Interconnect Partially Decentralized P2P File Sharing Networks
2005
Partially decentralized P2P (PDP2P) networks are a subset of P2P networks. Roles of nodes are different according to their functionality in the network. Nowadays, there are many PDP2P networks, with different characteristics. It is necessary to find a way to join those autonomous networks. We have not found any interconnection system, so in this article we present a new hierarchical system for interconnecting peers from different PDP2P networks. It will allow sharing data, content and resources between networks. It can be employed between sensor networks, P2P networks, and generally, overlay networks. Oldest superpeers or brokers with higher bandwidth in the PDP2P network will belong to hig…
Thermal analysis and new insights to support decision making in retrofit and relaxation of heat exchanger networks
2011
International audience; Pinch analysis offers a rational framework for identifying energy saving targets and designing efficient heat recovery networks, especially in process industry. Several scientists have contributed to improve and automate the original pinch method over the last decades, increasing its capability to deal with a number of specific issues; the expertise of the analyst, however, remains determinant in achieving optimal results. In this paper a procedure for retrofit of existing networks is proposed, based on an integrate use of several techniques (either existing or innovative). The diagnosis of the existing network and of a "Minimum Energy Requirement" configuration emer…
Notice of Violation of IEEE Publication Principles: Distributed Multimedia Digital Libraries on Peer-to-Peer Networks
2007
This paper presents an original approach to image sharing in large, distributed digital libraries, in which a user is able to interactively search interesting resources by means of content-based image retrieval techniques. The approach described here addresses the issues arising when the content is managed through a peer-to-peer architecture. In this case, the retrieval facilities are likely to be limited to queries based on unique identifiers or small sets of keywords, which may be quite inadequate, so we propose a novel algorithm for routing user queries that exploits compact representations of multimedia resources shared by each peer in order to dynamically adapt the network topology to …
Capture Aware Sequential Waterfilling for LoraWAN Adaptive Data Rate
2020
LoRaWAN (Long Range Wide Area Network) is emerging as an attractive network infrastructure for ultra low power Internet of Things devices. Even if the technology itself is quite mature and specified, the currently deployed wireless resource allocation strategies are still coarse and based on rough heuristics. This paper proposes an innovative "sequential waterfilling" strategy for assigning Spreading Factors (SF) to End-Devices (ED). Our design relies on three complementary approaches: i) equalize the Time-on-Air of the packets transmitted by the system's EDs in each spreading factor's group; ii) balance the spreading factors across multiple access gateways, and iii) keep into account the c…
Epidemic spreading and aging in temporal networks with memory
2018
Time-varying network topologies can deeply influence dynamical processes mediated by them. Memory effects in the pattern of interactions among individuals are also known to affect how diffusive and spreading phenomena take place. In this paper we analyze the combined effect of these two ingredients on epidemic dynamics on networks. We study the susceptible-infected-susceptible (SIS) and the susceptible-infected-removed (SIR) models on the recently introduced activity-driven networks with memory. By means of an activity-based mean-field approach we derive, in the long time limit, analytical predictions for the epidemic threshold as a function of the parameters describing the distribution of …
Centrality measures for networks with community structure
2016
Understanding the network structure, and finding out the influential nodes is a challenging issue in the large networks. Identifying the most influential nodes in the network can be useful in many applications like immunization of nodes in case of epidemic spreading, during intentional attacks on complex networks. A lot of research is done to devise centrality measures which could efficiently identify the most influential nodes in the network. There are two major approaches to the problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology in order to find the influential nodes, while on the other end, random strategies are completely agnostic ab…
Immunization Strategies Based on the Overlapping Nodes in Networks with Community Structure
2016
International audience; Understanding how the network topology affects the spread of an epidemic is a main concern in order to develop efficient immunization strategies. While there is a great deal of work dealing with the macroscopic topological properties of the networks, few studies have been devoted to the influence of the community structure. Furthermore, while in many real-world networks communities may overlap, in these studies non-overlapping community structures are considered. In order to gain insight about the influence of the overlapping nodes in the epidemic process we conduct an empirical evaluation of basic deterministic immunization strategies based on the overlapping nodes.…