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 a new cover traffic generation algorithm for flow-based anonymity systems and compare it with other algorithms from the literature. Our algorithm is based on four ideas: fixed time rounds, flow classification with different protection methods for different classes, protection depending on the potential cost and finally, use of history. Simulation results show that our solution...
The increase in network traffic has lead to the concept of congestion in computer networks. The problem of network congestion control remains a major issue in today's computer networks. Despite various methods and algorithms that has been proposed, however due to the dynamic nature of computer networks, no universal control method has been widely accepted. This paper reviews various conventional methods...
Traffic measurements from communication networks have shown that network traffic is exhibiting self similar as well as long range dependence properties. In telecommunication networks, congestion events tend to persist, producing large delays and packet loss resulting in performance degradation. In order to guarantee quality of service to diverse Internet services, congestion prediction became a fundamental...
The non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA...
This paper studies a topical capacitated network design problem that arises in the telecommunication industry. In this problem, given point-to-point demand between various pairs of nodes, a minimum cost survivable network must be designed by installing capacitated equipments (routers, line cards, ...) on nodes as well as link facilities on arcs. This realistic problem finds its motivation in the rapidly...
This paper addresses the static output feedback (SOF) Hinfin control for continuous-time linear systems with an unknown input delay from a novel perspective. New equivalent characterizations on the stability and Hinfin performance of the closed-loop system are established in terms of nonlinear matrix inequalities with free parametrization matrices. These delay-dependent characterizations possess a...
Monitoring and measuring various metrics of high data rate and high capacity networks produces a vast amount of information over a long period of time. Characteristics such as throughput and delay are derived from packet level information and can be represented as time series signals. This paper looks at the Embedded Zero Tree algorithm, proposed by Shapiro, in order to compress computer network delay...
We propose a new TCP-friendly multicast congestion control for very large groups of receivers. This protocol named M2C is layered and receiver-driven. Like TCP, M2C is composed of a congestion avoidance and a slow start state. However, M2C can re-activate the Slow Start when the current rate is far below the fair one. This protocol is well designed for continuous and long lived data streams, such...
Quickest detection of an abrupt distribution change with an unknown time varying parameter is considered. A novel adaptive approach is proposed to tackle this problem, which is shown to outperform the celebrated parallel CUSUM test. Performance is evaluated through theoretical analysis and numerical simulations.
In this paper we propose a novel strategy for converging dynamic policies generated by adaptive agents, which receive and accumulate rewards for their actions. The goal of the proposed strategy is to speed up the convergence of such agents to a good policy in dynamic environments. Since it is difficult to have the good value for a state due to the continuous changing in the environment, previous policies...
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called ldquoGreedy Forwarding with VIrtual Position (ViP)rdquo. We introduce virtual position as the middle position of all direct neighbors of a node....
Statistical static timing analysis (SSTA) is indispensable for nanometer manufacturing under process variability. The process variations cause significant uncertainty in VLSI circuit timing and this makes yield control and timing verification a very difficult challenge. SSTA is suitable for timing estimation and design for manufacturability under process variation. However, most of the existing SSTA...
The principal service of distributed hash tables (DHTs) is route(id, data), which sends data to a peer responsible for id, using typically O(log(# of peers)) overlay hops. Certain applications like peer-to-peer information retrieval generate billions of small messages that are concurrently inserted into a DHT. These applications can generate messages faster than the DHT can process them. To support...
This research proposed an effective mechanism for an effective solution to tackle missing data problem in the handoff delay. The focus of this research is the effective combination of multicast-base and forecast enhancement prediction mechanism. This solution will help future network management for bandwidth reservation for mobile users in motion.
In the design process of digital systems, functional verification is a major issue. Generally, formal methods like bounded model checking (BMC) offer the highest quality of the verification results, especially when used in combination with techniques that check if a set of properties forms a complete specification of a design. However, in contrast to simulation-based methods, like random testing,...
Security devices can reveal critical information about the cryptographic key from the power consumption of their circuits. Differential power analysis (DPA) is one of the most effective power analysis techniques. In recent years numerous countermeasures against the DPA attack of hardware implementations of security algorithms have been proposed. In this paper, we investigate the random delay insertion...
In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify such routes based on average channel state information (CSI) only, since this information can be distributed more easily over the network. Such cases allow probabilistic QoS guarantees i.e., we maximize and report the probability...
Ultra-Wideband (UWB) communication system provides high accurate localization due to the high multi-path resolution capacity. For Ultra-Wideband (UWB) Localization systems, time-based schemes namely Time of Arrival (TOA) and Time Difference of Arrival (TDOA) provide very good accuracy due to the high time resolution (large bandwidth) of UWB signals. Due to the inherent suitability and accuracy of...
There are two common network models for network coded traffic: one is the fractional rate model (the primary model for non-coded communication) and the other is the integer rate model used for detailed coding analysis on packet-by-packet behaviors. The existing approach of finding minimum-cost multicast network codes is based on the fractional rate model and solves the corresponding linear-programming...
This paper presents an efficient multicast routing algorithm called DNMA. According to our simulation results, the proposed algorithm outperforms some existing well-known approaches for solving QoS of multicast routing problem in large scale networks.
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.