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.
Robust and load-balanced routing protocol for traffic engineering is very important to stabiLity of Internet. A novel adaptive load-balanced routing algorithm(ALB) based on minimum interference and cross-layer design principle is proposed. The least interference path algorithm principle is introduced briefly, and the implementation of adaptive load-balanced routing algorithm is elaborated in detail...
Content-addressable memories (CAMs) are hardware search engines that are much faster than algorithmic approaches for search-intensive applications. CAMs are composed of conventional semiconductor memory (usually SRAM) with added comparison circuitry that enables a search operation to complete in a single clock cycle. In case of advanced applications we need large sized CAM but it has the disadvantage...
MAC protocol is an important topic in Wireless Sensor Network, which plays a decisive role in network performance. The current MAC protocol has many problems such as highly dependent on time synchronization, low throughputs or data delay. With multi-channel allocation strategy, the paper put forward a dynamic route allocation algorithm, which reduced data delay and increased the throughputs. The simulation...
Through analyzing of the delay composition of message transmission in CAN bus, it discusses the two main parts of information delay in CAN network??Fthe frame delay and media access delay. The frame delay is determined by frame length and baud rate, so we can reach different frame delay under the different frame structure and different baud rate. Through the latitudinal and longitudinal comparison,...
Dynamic phasors have been introduced to the HVDC model to analyze its dynamic behavior. Dynamic phasor method featured by high accuracy and calculation speed has many advantages, representing the switch state of the valve with switching function and flexibly selecting the proper time-varying Fourier coefficient based on the need of actual analysis. Based on analysis of influence exerted by thyristor...
We present an algorithm to assign time slots to nodes in a TDMA network that minimizes the jitter in time slot assignments. By reducing the jitter in time slots around the TDMA frame, we can provide more consistent network access and reduce the overall delay seen by an application with time-varying traffic patterns, such as normal web traffic. Our algorithm can reduce the average delay seen by all...
Recent collapses of SIP servers in the real carrier networks indicate that the built-in SIP overload control mechanism cannot mitigate overload effectively. In this paper, we investigate the root cause of SIP server crash by studying the impact of the retransmission on the queuing delay of the overloaded server. The transient overload may introduce the excessive queuing delay, thus triggering unnecessary...
The Resilient Packet Ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies such as SONET and Ethernet. The key performance objectives of RPR are to achieve high bandwidth utilization, optimum spatial reuse on the...
With rapidly growing deployment, SIP has become a main signaling protocol for IP telephony and multimedia sessions in the Internet. SIP employs a retransmission mechanism to maintain its reliability. Recent server collapse due to emergency-induced call volume in carrier networks indicates that message retransmissions triggered by various SIP timers make the overload worse. The built-in overload control...
Routing in Wireless Mesh Algorithm is concerned with finding “good” source destination paths and has been an active research area since many years. Much of the work is focused on the improvement of global resources, or on the performance of individual transfers. Either case, the routing problem can be casted as a multi-objective with objectives such as load-balancing, end-to-end delay, and path capacity...
The Resilient Packet Ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies, SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilization, optimum spatial reuse...
IEEE 802.16 mesh mode is positioned to be used as a wireless backbone network. In coordinated distributed scheduling (C-DSCH), when nodes transmit control messages to compete for channel access, they need to wait for some period of time called hold-off time to compete again. Network performance is sharply affected by the hold-off mechanism in the bandwidth reservation procedure. In this paper, a new...
We consider the problem of energy-efficient point-to-point transmission of delay-sensitive data (e.g. multimedia data) over a fading channel. We propose a rigorous and unified framework for simultaneously utilizing both physical-layer centric and system-level techniques to minimize energy consumption, under delay constraints, in the presence of stochastic and unknown traffic and channel conditions...
The multi-carrier proportional fair scheduling (MC-PFS) problem in a multi-user system has been shown to be NP-hard. Carrier by carrier proportional fair scheduling (CC-PFS) is commonly used instead to allocate resources in real-time. Considering the sub-optimal nature of CC-PFS and its popularity, this paper formulates the optimization beyond CC-PFS as a constrained maximum sum rate problem (with...
In this work, the first target is to model and effectively resolve the Arrival Sequencing and Scheduling problem (ASS). The problem is NP-hard and exists in the Air Traffic Control (ATC) for a long time. It has been the hottest topic in transportation research due to the constantly increasing aviation traffic volume around the world. This paper attempts to design a mathematical integer linear model,...
The prevalent assumption in the current utility maximisation-based rate control and scheduling solutions for multihop wireless networks has been that bounded packet end-to-end delay can be attained by guaranteeing a pre-specified bandwidth. However, in addition to the inherent complexities in determining the exact bandwidth, this approach requires an admission control strategy. In this paper we present...
For the non-linearity of TCP fluid-flow model and fluctuations of network load, an active queue management scheme based on variable structure control and neuron equivalent compensation is proposed. This scheme is integration of sliding-mode controller and neuron equivalent compensator, which the variable structure controller is used to guarantee the swiftness of queue response and an adaptive neuron...
Aiming at the problem of stochastic network-induced delay, we use the Dynamic Matrix Control (DMC) prediction technique to design the controller in order to ensure the validity and stability of the control in the Network Control Systems. Based on an overall consideration of the stochastic network-induced delay, a unified modeling approach of stochastic network-induced delay is proposed. We adopt a...
This paper presents a novel approach to address the challenge of planning paths for multi-agent systems operating in complex environments. The algorithm developed, Decentralized Multi-Agent Rapidly-exploring Random Tree (DMA-RRT), is an extension of the Closed-loop RRT (CL-RRT) algorithm to the multi-agent case, retaining its ability to plan quickly even with complex constraints. Moreover, a merit-based...
Modern multiprocessor and multicore architectures adopt shared resources to meet increased performance requirements. Adaptive arbiters, such as FlexRay, have been adopted to grant access to shared resources. While increasing the performance, timing analysis is more challenging with this kind of arbiter. This paper considers real-time tasks that are composed of super blocks, while super blocks themselves...
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.