Scheduling policies are playing significant roles in guaranteeing the performance of core routing andswitchingdevices. The limitations in complexities and extensibilities of current combined input and cross-point qu...
详细信息
Scheduling policies are playing significant roles in guaranteeing the performance of core routing andswitchingdevices. The limitations in complexities and extensibilities of current combined input and cross-point queueing switching fabric' scheduling policies are first analyzed. Then, based on this analysis, the principle fordesigning high extensible scheduling policies and the concept of virtual channel are proposed. Based on the principle and virtual channel, it comes up with a dynamic roundrobin scheduling algorithm-Fdr (fair service anddynamic roundrobin), which is simple, high efficiency and fair service. Fdr is based on roundrobin mechanism, whose complexity is only O(1). It allocates the scheduling share for each virtual channel according to its current states, thus, Fdr has gooddynamic andreal-time performance, and it can adapt to unbalanced traffic load network environment. Simulation results under SPES system show that Fdr exhibits gooddelay, throughput and anti-burst performance, which can be deployed in high performance routing andswitchingdevices.
With the development of ASIC technology, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. However, the existing scheme...
详细信息
With the development of ASIC technology, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. However, the existing schemes are either still a little complicated in hardware implementation or low efficient in scheduling performance. In this paper, we propose a simple and high efficient scheduling algorithm called maximum urgency first (MUF). Since the MUF algorithm systematically evaluates the scheduling demands of both the input queues and the crosspoint queues in arbitrations of input scheduling, it not only can sufficiently make use of the output bandwidth, but also can efficiently control the increment of the input queue length. By compressing the queue length of the input queue and the crosspoint queue into the input urgency (IU) and the output urgency (OU), the implementation complexity of the MUF algorithm is largely decreased. Simulation results show that MUF can obtain better stability anddelay performance than traditional scheduling schemes presented for CICQ switches.
Most existeddistributed topology discovery applications deploy multiple probing hosts throughout the network. Paths are then probed from the individual points and the data later is unified into a single topology grap...
详细信息
ISBN:
(纸本)9781424410286
Most existeddistributed topology discovery applications deploy multiple probing hosts throughout the network. Paths are then probed from the individual points and the data later is unified into a single topology graph. This approach relies on the ability to deploy probing hosts throughout the network, which in many cases is not possible. This paper presents MTAS(Multi Tunnel Access system), a system which deploys probing hosts in a single IPv4 subnet. Each probing host creates an IPv6 over IPv4 tunnel to reach an ISATAP (Intra-Site Automatic Tunnel Addressing Protocol) or 6to4 relay router which distributed in the world and provides service for public. In MTAS, ISATAP and 6to4 relay routers just work like probing springboards distributed in different location for IPv6 network topology discovery, so MTAS is a handy distributed application. To avoidretracing the same traceroute paths, MTAS systemdeploys a middle database to store the collected path. We also present some preliminary test results from probing CErNET2, the largest native IPv6 network in China. And the test results illustrate the effectiveness of MTAS.
recent advances in broadbandtechnology have caused forwarding engines to handle pack- ets with over 10 gigabit per second. In this paper, we present a high-speed forwarding pipeline which can finish all of the routin...
详细信息
recent advances in broadbandtechnology have caused forwarding engines to handle pack- ets with over 10 gigabit per second. In this paper, we present a high-speed forwarding pipeline which can finish all of the routing and forwarding tasks in the way of pipelining. We also establish the analysis model of the pipeline with which one can evaluate some key performance parameters of the forwarding engine such as forwarding rate and forwarding delay. We find that the pipeline is of good scalability and can forward unicast packets up to the speed of 40Gbit/s.
With the demand of providing data security and integrity, IPSec is implemented in hardware of router to accelerate processing speed. After analyzing advantages anddisadvantages of two traditional security architectur...
详细信息
ISBN:
(纸本)9780769529431
With the demand of providing data security and integrity, IPSec is implemented in hardware of router to accelerate processing speed. After analyzing advantages anddisadvantages of two traditional security architectures, Look-aside architecture and FlowThrough architecture, we propose parallel security processing architecture to achieve better time efficiency. This parallel security architecture adopts mechanism of processing IP packets and IPSec packets simultaneously, which optimizes the processing flow and improves the processing efficiency. The design of parallel security architecture is based on universal architecture of broadband, thus requires minimal change of hardware architecture when implemented in broadbandrouter Testing results based on Sr1880s routers demonstrate that the proposed parallel security architecture is efficient and satisfies the security need of broadband networks.
The paper presents a power control compensation method in the forward channel for the highersystem capacity of the future Multi-Service hierarchical CdMA system. This method is mainly based on the confidence level an...
详细信息
The paper presents a power control compensation method in the forward channel for the highersystem capacity of the future Multi-Service hierarchical CdMA system. This method is mainly based on the confidence level and the estimation theory. The estimation has two steps, the channel fading estimation and the Mobile Station (MS) traffic amount estimation. The simulating results prove that it is better than the traditional power control methods by the great reduction of outage probability about 15%.
reducing communication overhead is extremely important for parallelizing compiler to generate efficient codes fordistributed memory machines. In this paper, a redundant parallel execution model (rPEM) is used as the ...
详细信息
reducing communication overhead is extremely important for parallelizing compiler to generate efficient codes fordistributed memory machines. In this paper, a redundant parallel execution model (rPEM) is used as the model for target programs. The extenddata flow graph is introduced, and optimization algorithms based on the data-flow analysis are discussed. The overhead of data flow analysis can be reduced by performing analysis on the extenddataflow graph. The analysis helps to reduce the redundant communication overhead. These optimization algorithms are able to perform inter-loop and inter-procedure analysis. Experimental results prove that these optimizations algorithms are effective in reducing both the number of communications and the communication volume.
A Single-Buffered (SB) router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued (CIOQ) router where a central switch f...
详细信息
A Single-Buffered (SB) router is a router where only one stage of shared buffering is sandwiched between two interconnects in comparison of a Combined Input and Output Queued (CIOQ) router where a central switch fabric is sandwiched between two stages of buffering. The notion of SB routers was firstly proposed by the High-Performance Networking Group (HPNG) of Stanford University, along with two promising designs of SB routers: one of which was Parallel Shared Memory (PSM) router and the other was distributed Shared Memory (dSM) router. Admittedly, the work of HPNG deserved full credit, but all results presented by them appeared to relay on a Centralized Memory Management Algorithm (CMMA) which was essentially impractical because of the high processing and communication complexity. This paper attempts to make a scalable high-speed SB router completely practical by introducing a fully distributed architecture for managing the shared memory of SB routers. The resulting SB router is called as a Virtual Output and Input Queued (VOIQ) router. Furthermore, the scheme of VOIQ routers can not only eliminate the need for the CMMA scheduler, thus allowing a fully distributed implementation with low processing and commu- nication complexity, but also provide QoS guarantees and efficiently support variable-length packets in this paper. In particular, the results of performance testing and the hardware implementation of our VOIQ-basedrouter (NdSC~ Sr1880-TTM series) are illustrated at the end of this paper. The proposal of this paper is the first distributed scheme of how to design and implement SB routers publicized till now.
In this paper, the closed-form expressions of signal-to-interference-plus-noise ratio (SINr) and the bit errorrate (BEr) are derived for a maximal ratio combining (MrC) two-dimensional (2-d)-rAKE receiver with imperf...
详细信息
In this paper, the closed-form expressions of signal-to-interference-plus-noise ratio (SINr) and the bit errorrate (BEr) are derived for a maximal ratio combining (MrC) two-dimensional (2-d)-rAKE receiver with imperfect channel estimation in frequency-selective Nakagami fading channels. The impact of doppler frequency shift, the low pass filters (LPF) and the spatial-temporal diversity on the channel estimation and the performance of the receiver has been analyzed. Theoretical analysis and computer simulation results indicate that the performance degradation of 2-d-rAKE receivers due to imperfect channel estimation can be improved by using appropriate LPF taps and increasing the antenna numbers.
Mismatching between overlay and physical network in structured P2P system leads to overlap of links crossed on backbone network, thus it brings link waste and congestion. A method used fordetecting andresolving the ...
详细信息
Mismatching between overlay and physical network in structured P2P system leads to overlap of links crossed on backbone network, thus it brings link waste and congestion. A method used fordetecting andresolving the link overlap problem is proposed in this paper. It introduces TTL as the measurement of distance, and adjusts the routing table of node according to redirect message achieved from TTL calculation and comparison. This method is protocol- independent and easy to be built on any structured P2P system. It avoids the inaccuracy problem that the time latency or IP information method contained. Through illustration, it is proved to indeeddecrease the number of links crossed in routing procedure, thus resolves the waste of link bandwidth and useless flow over the backbone network brought by mismatching problem.
暂无评论