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 most of wireless sensor network (WSN) applications, energy-efficiency and low end-to-end transmission delay (E2ETD) are essential requirements. This paper presents a contention based routing enhanced MAC protocol, named as CR-MAC, for E2ETD reduction in a multi-hop WSN. CR-MAC reduces E2ETD by optimizing the time interval between the successively sent data packets of a node in a scheduled flow...
An online learning problem with side information is considered. The problem is formulated as a graph structured stochastic Multi-Armed Bandit (MAB). Each node in the graph represents an arm in the bandit problem and an edge between two arms indicates closeness in their mean rewards. It is shown that such side information induces a Unit Interval Graph and several graph properties can be leveraged to...
Ancient Bagan is one of the culture heritage region of Myanmar and most tourist attraction areas. The trip planning mobile application of Ancient Bagan region is developed for providing efficient access to location-based information requires on the trip anywhere and anytime. The spatial index structure is an important role for retrieving the two dimensional geographical location effectively and efficiently...
Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work,...
Wireless Sensor Network has constraint with energy and computation. Network Life is based on the way the energy in the battery is used. Continuously sending data along a specific path for long intervals of time, results in large amount of energy consumption. This could eventually lead to network partitioning, which in turn will create a path loss between the sender and receiver. Though several (sensor)...
In this paper, we propose an adaptive routing algorithm for vertically partially connected 3D NoCs to (1) overcome failures in vertical links, and (2) find the nearest available vertical link for rerouting of packets. To track the position of each vertical link and distance to the other nodes, the proposed routing algorithm, named Advertiser Elevator, indexes each vertical link and implements a mechanism...
Ternary Content Addressable Memory (TCAM) is becoming very popular for designing high-throughput forwarding engines on most of today's high-end routers. Despite its capability for line-speed queries, it is very power hungry and capacity inefficient. Many recent research efforts, such as CoolCAMs and SmartPC, were proposed to reduce power consumption by constructing a pre-classifier to activate TCAM...
Benefit from the caching hits on the routers along the request routing path, in-network caching plays an important role in diminishing the distance between the consumers and their desired contents. A content caching model is proposed to intuitively analyze the small world characteristics of in-network caching in information centric networks. A directed long edge from a caching node to the provider...
In this article, the survivable routing problem on elastic optical networks (EONs) for single link-failure is studied. The failure-independent path-protecting p-cycles (FIPP p-cycles) protection scheme is used for request protection. Two heuristic algorithms are proposed to solve this problem.
We propose a highly scalable packet-switching architecture that suits for demanding Data Center Networks (DCNs). The design falls into the category of buffered multistage switches. It affiliates the three-stage Clos-network and the Networks-on-Chip (NoC) paradigm. We also suggest a congestion-aware routing algorithm that shares the traffic load among the switch's central modules via interleaved connecting...
This paper presents HC-LBR routing, the first location-based routing (LBR) mechanism that simultaneously retains high communication efficiency and privacy for Internet of Things (IoT). Existing LBR schemes were originally designed for wireless sensor networks (WSNs). Although they offer attractive efficiency and scalability, their privacy performance presents a vulnerability when being used in IoT...
With global coverage abilities, satellite networks are expected to provide users with ubiquitous data services. However, routing in satellite networks faces more challenges due to the satellite movement. Fortunately, the satellite movement can be predicted by orbit calculation. Based on this characteristic, a lot of existing routing algorithms use Temporal Graph Model (TGM) to calculate instantaneous...
Deadlock avoidance mechanisms for lossless lowdistance networks typically increase the order of virtual channel (VC) index with each hop. This restricts the number of buffer resources depending on the routing mechanism and limits performance due to an inefficient use. Dynamic buffer organizations increase implementation complexity and only provide small gains in this context because a significant...
Due to the coarse granularity of data accesses and the heavy use of latches, indices in the B-tree family are not efficient for in-memory databases, especially in the context of today's multi-core architecture. In this paper, we study the parallelizability of skip lists for the parallel and concurrent environment, and present PSL, a Parallel in-memory Skip List that lends itself naturally to the multi-core...
In this paper, we study the problem of jointly routing and scheduling traffic in an energy harvesting network. To this end, we leverage stochastic dual descent methods to propose a generalization of the well-known backpressure algorithm to energy harvesting networks. We name this policy energy harvesting backpressure (EH-BP) and show that it satisfies the fundamental property of backpressure-type...
The design of embedded systems is becoming continuously more complex such that efficient system-level design methods are becoming crucial. Recently, combined Answer Set Programming (ASP) and Quantifier Free Integer Difference Logic (QF-IDL) solving has been shown to be a promising approach in system synthesis. However, this approach still has several restrictions limiting its applicability. In the...
Empowered by the orthogonal frequency division multiplexing (OFDM) technology, elastic optical networks (EONs) have emerged as a promising solution for future high-speed networks. Routing and spectrum allocation (RSA) is one of the key challenges to the design of EONs. An adaptive RSA is required to meet the robustness objective of EONs. The relative cost concept can be used to implement an adaptive...
Extreme-scale science applications are highly innovative and constantly evolving. They are expected to generate data in the petabyte and exabyte ranges. This data needs to be transferred, processed, and analyzed at remote locations. A flexible data retrieval service is needed, where a user requesting data retrieval from a remote site can have a choice between replicated storage sites. Elastic Optical...
In providing new telecommunication services, the requisition for quality of network is more and more popular and sophisticated with high bandwidth, small value of delay time or packet loss etc. To assure the quality of network, the localized routing schemes have recently been researched as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional...
During recent years, Peer-to-Peer (P2P) Content Sharing Networks (CSNs) have intrigued researchers to measure and analyze them for the dominant proportion of P2P traffic volume and wide applications of the sharing platform. However, to the best of our knowledge, most of the measurement tools have not been updated under the current situations of P2P CSNs. In this paper, we develop an enhanced measurement...
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.