The challenge of elimination of redundant handovers is getting more significant while femtocells with small radius are deployed in networks. The utilization of the femtocells results to more frequent initiation of a handover procedure. This paper focuses on an adaptation of actual level of hysteresis margin according to the position of the user in a cell. The hysteresis margin is commonly used parameter for elimination of redundant handovers. The purpose of this paper is to propose mechanism with minimum requirements on conventional network and user’s equipment and with a simple implementation. Evaluations of proposal in term of efficiency of the redundant handovers reduction as well as an impact on the user’s throughput in 4G wireless networks are carried out. The results show significant reduction of the amount of handovers while reducing the impact on the throughput.

/pdf/adaptive-hysteresis-margin-for-handover-in-femtocell-100mvxnm6e.pdf

Adaptive Hysteresis Margin for Handover in Femtocell Networks

With advances in technology, small form-factor sensors are feasible for various kinds of applications. The improvements on communication technology further make it practical to construct a wireless sensor network (WSN). In this paper, we review the works that are related to intelligent sensor network. Because there are no precise definitions of intelligent sensor network, we group them into two categories. One is to solve WSN issues with intelligent algorithms. The other is to design an intelligent application that incorporates sensor networks as the data sources. According to the categorization, the description of WSN issues, intelligent algorithms, and intelligent application technology are also provided in this article.

A survey on intelligent sensor network and its applications

QoE-driven dissemination of real-time videos over vehicular networks

Cuckoo hashing has proven to be an efficient option to implement exact matching in networking applications. It provides good memory utilization and deterministic worst case access time. The continuous increase in speed and complexity of networking devices creates a need for higher throughput exact matching in many applications. In this paper, a new Cuckoo hashing implementation named parallel d-pipeline is proposed to increase throughput. The scheme presented is targeted to implementations in which the tables are accessed in parallel. A parallel implementation increases the throughput and therefore is well suited to high speed applications. Parallel schemes are common for ASIC/FPGA implementations in which the tables are stored in several embedded memories. Using the proposed technique, the throughput can be significantly increased with gains that in practical scenarios can reach 60 percent compared to existing parallel implementations. The new scheme has been evaluated using a case study and detailed results for performance and implementation costs are reported.

Parallel d-Pipeline: A Cuckoo Hashing Implementation for Increased Throughput

We investigate infinite-horizon deterministic optimal control problems with both gradual and impulsive controls, where any finitely many impulses are allowed simultaneously. Both discounted and long-run time-average criteria are considered. We establish very general and at the same time natural conditions, under which the dynamic programming approach results in an optimal feedback policy. The established theoretical results are applied to the Internet congestion control, and by solving analytically and nontrivially the underlying optimal control problems, we obtain a simple threshold-based active queue management scheme, which takes into account the main parameters of the transmission control protocols, and improves the fairness among the connections in a given network.

https://hal.inria.fr/hal-00910064/document

Infinite horizon optimal impulsive control with applications to Internet congestion control

In order to overcome current Internet limitations on overall network scalability and complexity, we introduce a new paradigm of semantic networking for the networks of the future, which brings together flow-based networking, traffic awareness, and self-management concepts to deliver plug-and-play networks. The natural traffic granularity is the flow between packet and circuit and between connection-less and connection-oriented modes. Using flow aggregation capabilities, we simplify traffic processing in the nodes through elastic fluid switching, and simplify traffic control through flow admission control, policing, and implicit quality of service (QoS) routing. By leveraging deep packet inspection and behavioral traffic analysis, network elements can autonomously and efficiently process the traffic flows they transport through real-time awareness gained via semantic analysis. The global consistency of node decisions within the whole network is ensured by self-management, applying the concepts of “knowledge plane” and “network mining.”

Semantic networking: Flow-based, traffic-aware, and self-managed networking

With the introduction of new generation high speed routers, and with the help of “flow-aware” traffic management, it becomes possible to improve the Quality of Service for users as well as the network efficiency for ISPs. An example of the “flow-aware” traffic management is the Alcatel-Lucent “Semantic Networking” framework where short-lived flows are processed with high priority and long-lived flows are controlled on a per flow basis. In order to control efficiently the flows, it is useful to know an estimate of the Round Trip Time (RTT). In the present work, we provide an online RTT estimation algorithm which is passive and needs one-way traffic only. The one-way traffic requirement is essential for the application of the algorithm for “flow-aware” traffic management inside the network. To the best of our knowledge, there was no online one-way traffic RTT estimators. Tests on a controlled testbed and on the Internet demonstrate high accuracy of the proposed estimator.

/pdf/passive-online-rtt-estimation-for-flow-aware-routers-using-2pxjrpcv2v.pdf

Passive online RTT estimation for flow-aware routers using one-way traffic

The switching system comprises input modules (IM 1 , IM 2 , IMi, IMn) each connected to a switching matrix ( 1 ) and to a corresponding controller ( 2 ). Each input module (IMi) organizes packets that it receives into digital data blocks with a fixed size, and makes transfers of these blocks by successive cycles to the matrix ( 1 ). Each of these blocks is organized into groups of digital data, these groups having corresponding modifiable sizes and being stored according to a predetermined order and associated with the corresponding output ports (OP 1 , OP 2 , OPj, OPn) in the system. Each of these groups is formed of packets to be sent to a single corresponding output port. Any block transfer to the matrix ( 1 ) is accompanied by transmission of information representative of the corresponding sizes of the groups of the transferred block to the said controller ( 2 ), and the groups of each transferred block are switched to their corresponding destination output ports as a function of this information representing the sizes. This system makes it possible to satisfy service quality criteria applicable to switched packets, while limiting the quantity of data to be exchanged between the input modules and the controller. To be applied to telecommunication networks, particularly multiservice networks.

Packet switching system for a communication network node

Looking into the future, this paper presents the effects of having packets of large sizes, called XLFrames (XLFs), in a network. The analysis is motivated by the fact that the Internet is soon to witness stupendous amounts of traffic that have to be processed and switched at amplifying line rates; and this brings forth multiple challenges in the form of energy efficiency, network performance and end-host performance. Increasing the size of packets in the Internet has far-reaching incentives that otherwise appear hard to achieve. We foresee an Internet that multiplexes both packets (sand) and XLFs (rocks). As a first step, we analyse the effects of introducing XLFs in a network, and find the following: (i) the amount of packet-header processing is greatly reduced, (ii) while the fair multiplexing of XLFs with standard packets can be achieved using a careful queue management in routers.

/pdf/from-packets-to-xlframes-sand-and-rocks-for-transfer-of-mice-1umxuxynjj.pdf

From Packets to XLFrames: Sand and Rocks for Transfer of Mice and Elephants

The system has input modules (IM1-IMn), each connected to a switching matrix (1) and a controller (2). Each module has processing units for organizing packets into digital data blocks and for transferring the blocks towards the matrix. Each block is organized into multiple digital data groups. The groups are switched towards respective destination output ports according to information representing size of each group of the blocks.

Packet communication system within a communication network node

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Georg Post

Author Tools

Chat about Author