The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose different techniques for message passing and event-driven communication among hierarchically organized objects. Proposed techniques are suitable for dynamic tree-structured applications, where application entities are organized in a tree and added to it in run time. Examples of such applications are modeling and simulation tools where application objects often follow parent-child...
In the area of applied optimisation, heuristics are a popular means to address computational problems of high complexity. Modelling the problem and mapping all variations of its solution into a so-called solution space are integral parts of this process. Representing solutions as graphs is common and, for a special type of graph, Prüfer Code (PC) offers a computationally efficient mapping (algorithms...
We present two geometric routing algorithms that reliably deliver messages to all devices in a geocast region. One algorithm is based on flooding, the other on concurrent geometric routing. They are the fist known stateless geocasting algorithms. We formally prove the algorithms correct, evaluate their performance through abstract and concrete simulation and estimate their message complexity.
A Bike Sharing System (BSS) may be modeled as a graph with two node types: stations with finite bike inventory subject to time-varying demand and intersections to represent the underlying transportation network. Mobile agents (replenishment trucks) travel on the arcs of the graph to reset station inventories and make routing decisions at intersections. One-way rides create inventory imbalances across...
In this paper an approach to the many-to-many carpooling problem with automated passenger aggregation is presented. The proposed solution allows to optimally solve the related routing problem, by relying on a constrained shortest path algorithm, for users travelling within multiple transportation networks, thus enabling multi-modality, and exploits the users' availability to be aggregated into carpools...
In recent years, there has been a dramatic increase in utilization of FPGAs to enhance the speed-performance of many real-time compute and data intensive applications on embedded platforms. FPGA-based designs leverage parallelism in computations to achieve high speed-performance. Parallel computations require multi-ported memories to provide any number of ports for simultaneous multiple read/write...
Autonomic Internet of Things is the creation of self-management capability in the Internet of Things system by embedding certain properties, in order to free human from all detail of the operation and management of the system while providing the system to always operate on the best performance. Some of these properties are self-healing, self-configuring, self-optimization and self-protection which...
Forwarding data by name has been assumed to be a necessary aspect of an information-centric redesign of the current Internet architecture that makes content access, dissemination, and storage more efficient. The Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures are the leading examples of such an approach. However, forwarding data by name incurs storage and communication...
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for network dynamics...
Optical wavelength-routed networks enable parallel transmission of massive datasets on non-overlapping wavelength channels. However, as the sizes of scientific workflows increase, the simple availability of multi-wavelength resources will fall short of supporting application needs. Rather, these resources must be allocated intelligently, efficiently, and flexibly to bear the burden of high-volume...
Advances in microfluidic research have allowed digital microfluidic (DMF) chips to be rapid prototyped using inexpensive materials and simple fabrication processes to the extend where the time spend on chip design can be significantly longer than the time required for fabrication. The growing need for application specific DMF chips challenges efficient handling of the increasing chip design and programming...
Hitchhiking is the oldest ridesharing process without prior arrangements by the ride sharers. It usually involves uncertain waiting times and various combinations of lifts on roads. For this way of traveling, the problem of finding an optimal route is extremely important and has not been studied. We propose the concept of a hitchhiking graph to represent all possible decisions that a hitchhiker can...
Writing network policies for Software Defined Networks (SDNs) is not a straightforward task. Abstractions play a major role in easing this task, but they are typically provided for a particular use case. As a consequence, emerging applications will require the development and implementation of new abstractions, and combining the policies of different abstractions becomes difficult. To offer a simpler...
Middleboxes (Service Functions) have become indispensable part of Enterprise, Mobile and Data Center networks. Network operators rely on middleboxes to enforce network policies and to provide performance optimization, security and other value added services. With the increasing scale of network services and use cases demanding a specific sequence of service functions, the complexity and scale requirements...
Continuous-flow microfluidics rapidly evolved in the last decades as a solution to automate laboratory procedures in molecular biology and biochemistry. Therefore, the physical design of the corresponding chips, i.e., the placement and routing of the involved components and channels, received significant attention. Recently, several physical design solutions for this task have been presented. However,...
The challenge in last-mile supply chains deliveries is to maintain and improve the operational cost-effectiveness by the implementation of efficient procedures while facing increased levels of congestion in cities. One competitive alternative is Horizontal Cooperation (HC). City distribution problems under HC conditions can be modeled as multi-depot vehicle routing problems, which are NP-hard problems...
A coloring of a graph is an assignment of colors to its nodes so that no two adjacent nodes are assigned the same color. Given a graph G, by a Grundy k-coloring of G mean any proper k-vertex coloring of G such that for each two colors i and j, i< j, every vertex of G colored by j has a neighbor with color i. The maximum k for which there exists a Grundy k-coloring is denoted by Γ (G) and called...
Quality of Service (QoS) has held a pivotal role in achieving network performance, but recent advents of software defined networking (SDN), mobility and virtualization require that certain architectural modifications are considered. Domain boundaries are blurred by the fact that end-to-end (E2E) performance should be guaranteed within and beyond domain boundaries. Our work aims to address the limitations...
Moving Target Defense (MTD) is based on the notion of controlling change across various system attributes with the objective of increasing uncertainty and complexity for attackers; the promise of MTD is that this increased uncertainty and complexity will increase the costs of attack efforts and thus prevent or limit network intrusions. As MTD increases complexity of the system for the attacker, the...
In this paper, we present two new problems and a theoretical framework that can be used to route information in heterogeneous communication networks. These problems are the cardinality-constrained and interval-constrained paths problems and they consist of finding paths in a network such that cardinality constraints on the number of nodes belonging to different sets of labels are satisfied. We propose...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.