短波IP网络中IP代理的设计与实现

短波IP网络是未来军事短波通信网络的发展方向,IP代理是短波IP网络的关键组成部分,负责IP数据报和短波报文之间的转换,以及IP地址和短波子网地址间的映射.基于国内外短波网络发展现状,利用Linux系统中的Tun/Tap设备实现了IP代理与系统内核之间的互通,并提出短波网络内IP数据报的转发流程.     

流量工程对IP路由器的要求

流量工程（TE）是目前IETF和大型的Internet服务商正在深入讨论的热门话题,本文介绍了在流量工程环境网络中的IP路由器人有的路由和转发功能,以及目前关于流量工程问题讨论中的主要解决方案。     

一种IP网络路由容错方法

IP网络路由容错是指网络在一个路由器发生故障不能工作时 ,另一个路由器自动接管失效的路由器 ,从而保证网络路由正常进行。介绍一种基于Cisco路由器的路由容错方法     

IP策略路由实现的负载均衡

所谓IP策略路由,顾名思义,就是根据一定的策略进行IP报文转发,因此策略路由是一种比目的路由更灵活的路由机制。在路由器转发一个IP数据报文时,首先根据配置的策略规则对报文进行过滤,匹配成功则按照一定的转发策略进行报文的转发。这种策略规则可以基于标准和扩展访问控制列表,也可以基于报文的长度;而转发策略则是控制报文按照指定的策略路由表进行转发。     

一种IP网络路由容错方法

IP网络路由容错是指网络在一个路由器发生故障不能工作时,另一个路由器自动接管失效的路由器,从而保证网络路由正常进行.介绍一种基于Cisco路由器的路由容错方法.     

华为ISDN路由器Quidway^TM R1003／1004

工作原理 路由器的基本功能是实现异种网互联,在不同的子网协议之间进行转换,并对通过它的报文进行寻径(路由)和转发,它工作在OSI参考模型的第三层(网络层),是一种网络层设备。计算机通信的低层网络技术种类很多,彼此大相径庭,其差异无非体现在协议上,异种网互联即实现不同协议在异种网中具有相同协议的对应层之间进行协议转换。 TCP/IP协议路由器是目前应用最广泛的路由器。IP路由器也称为IP网关,其协议转换模型如图1所示。IP     

IP路由与交换

路由技术是网络互连的基础，IP交换是二层交换技术加三层转发技术。本文描述了交换与路由的基本概念、IP路由协议、组播路由以及IP交换类型和快速IP交换。     

ICMP协议安全问题剖析

ICMP（InternetControlMessageProtocol：因特网控制报文协议）是一个标准的TCP／IP协议,工作在IP层,所有的IP路由器和主机都支持该协议,其功能是在IP主机、路由器之间传递网络通不通、主机是否可达、路由是否可用等反映网络本身状况的控制消息。     

一种基于GEO卫星网络的IP组网方案的设计及仿真

当前,大部分支持IP的卫星系统只是提供了一个连接地面路由器的物理通道,难以满足带宽接入、多媒体服务以及星地网络一体化等新的需求.为此,提出了一个分组传输和交换均基于IP的GEO卫星系统,采用三层路由交换的组网方案,实现了同一交换域内用户信息的链路层快速转发,以及不同交换域间用户IP信息的网络层路由交换处理.最后,研究了最简单的RIP路由协议在此GEO卫星网络中的适应性,利用OPNET仿真软件对其进行了建模仿真及结果分析.     

基于重构的片上网络容错机制

为了保证片上网络的可靠性,本文提出了一种新的容错机制。在片上网络中由于路由器故障将导致与其连接的IP核不能与其他核通信,使片上网络的可靠性降低。本文的方法通过选择最优相邻的路由器来替代故障路由器,从而达到恢复IP核通信的目的。通过为每个路由器配置一个状态寄存器,用来存储相邻路由器的安全度,在路由时采用新的可重构路由算法绕过故障的路由器,以提高片上网络的可靠性。在OPNET平台上对5×52D-Mesh结构的片上网络进行仿真实验,统计了数据传输延时。试验结果表明,本文提出的路由算法与对比文献的路由算法相比,在延迟方面有明显的优势。     

全光网络及其上传送IP的研究

讨论了网络的 IP化及 IP网络全光化趋势 ;讨论了全光网络的四种关键技术 ,包括光分插复用器 (OADM)、光交叉连接设备 (OXC)、高速路由器和全光路由 ;阐述了全光网络的三种网络结构以及在全光网络中传送 IP分组的三种方法。     

Demonstration of the highly reliable Hikari router network based on a newly developed disjoint path selection scheme

Integration of multiprotocol label switching functions and multiprotocol lambda switching functions can enhance the throughput of IP networks and remove bottlenecks that are derived from electrical packet processing. To enhance the packet forwarding capability, NTT proposed a photonic MPLS concept that includes MP/spl lambda/S, and demonstrated IP, MPLS, and photonic MPLS integrated router systems called the photonic MPLS router. This router system is now called the Hikari router. The word Hikari is Japanese meaning beam, light, lightwave, optical, photonic, and sunshine. The amount of IP data traffic has grown remarkably. Massive IP routers and flexible route control mechanisms are now required to cope with the increased amount of traffic. The Hikari router can offer two solutions utilizing photonic switching technologies, and photonic network operation and management technologies. The first solution is utilizing photonic switching technologies realized using optical-switch-based crossconnect systems. The other solution is realized using the MPLS and MP/spl lambda/S signaling protocol and photonic network protection functions. In this article we report on the implementation of the Hikari router systems, propose a newly developed disjoint path selection scheme for generalized MPLS networks with shared risk link group constraints, and demonstrate the signaling protocol and network protection functions. The demonstration system achieves a distributed optical path set-up/tear-down protocol with an extended constraint-based routing label distribution protocol. Fast self-healing through automatic protection switching and a new restoration scheme are also implemented. These functions are successfully implemented, and the performance is verified on a demonstration network. The protection switching scheme achieves protection in less than 20 ms, and the optical path restoration scheme achieves restoration in less than 500 ms.     

Comparative study of two CPU router time management algorithms in cellular IP networks

Providing good quality of service (QoS) in cellular IP networks is an important requirement for performance improvement of the cellular IP network. Resource reservation is one of the methods used in achieving this goal and is proven to be effective. The main resources to be reserved in a cellular IP network are bandwidth, buffer and central processing unit (CPU) cycles. Router CPU cycle is the time taken by the router to process the packet of the flow before forwarding it to the next router (hop). This paper proposes a model for CPU cycle optimization of routers for real‐time flows in a cellular IP network. The model applies both genetic algorithm (GA) and particle swarm optimization (PSO) as soft computing tools to optimize the CPU cycles and reduces the flow processing time at each router in the route taken by a flow. Simulation experiments illustrate a comparative study of the model.     

通信IP网中可靠性策略的部署及问题分析

用通信IP网作为数据业务传输的载体,如何保证不问断的数据传输,提高网络的可靠性成为通信IP网建设的关键问题。针对通信IP网中可靠性策略的部署,通过实际网络环境测试,详细阐述了如何在汇聚交换机和路由器上部署VRRP协议和BFD检测机制,并解决了在部署过程中出现的无法正常发送组播数据、无法实现路由切换等问题,从而实现了路由...     

主动监听中协议欺骗的研究

提出了基于协议欺骗的主动监听框架,大大扩展了网络监听的适用范围。分析了网络访问的具体过程,将其中存在的映射关系分为四种:服务器域名到IP地址、IP到MAC地址、远程服务器的IP地址到本地路由器IP地址、以及客户端界面显示到应用服务器的处理。依据破坏的映射关系不同,本文将能够实现主动监听的协议欺骗分为四大类:ARP欺骗、路由欺骗、DNS欺骗和应用层欺骗,并详细分析了这四类协议欺骗攻击原理、实现方式及其防范策略。     

IP switching and gigabit routers

To cope with the growth in the Internet and corporate IP networks, we require IP routers capable of much higher performance than is possible with existing architectures. This article examines two approaches to the design of a high-performance router, the gigabit router and the IP switch, and then provides some detail on the implementation of an IP switch and the protocols associated with IP switching     

Internet Multicasting of IPTV With Essentially-Zero Delay Jitter

A technology for multicasting packetized multimedia streams such as IPTV over the Internet backbone is proposed and explored through extensive simulations. An RSVP or DiffServ algorithm is used to reserve resources (i.e., bandwidth and buffer space) in each packet-switched IP router in an IP multicast tree. Each IP router uses an Input-Queued (IQ) switch architecture with unity speedup. A recently proposed low-jitter scheduling algorithm is used to pre-compute a deterministic transmission schedule for each IP router. The IPTV traffic will be delivered through the multicast tree in a deterministic manner, with bounds on the maximum delay and jitter of each packet (or cell). A playback buffer is used at each destination to filter out residual network jitter and deliver a very low-jitter video stream to each end-user. Detailed simulations of an IPTV distribution network, multicasting 75 high-definition video streams over a fully-saturated IP backbone are presented. The simulations represent the transmission of 129 billion cells of real video data and where performed on a 160-node cluster computing system. In the steady-state, each IP router buffers approx. 2 cells (128 bytes) of video data per multicast output-port. The observed delay jitter is zero when a playback buffer of 15 milliseconds is used. All simulation parameters are presented.      

光IP路由器原理及关键技术

本文提出了光IP路由器的概念,详细阐述了光IP路由器的工作原理及其关键技术,对其在当前光互联网中的应用进行了深入探讨。     

Novel hardware architecture for fast address lookups

For every packet an IP router receives, it makes a routing decision based on the packet's destination address. The router's forwarding rate is usually limited by the rate at which it can make these decisions. We describe a new method for implementing route lookups in hardware. Our method can be implemented in the forwarding engine of a network processor or router using a small on-chip SRAM and an off-chip DRAM, and it achieves a rate of one lookup per DRAM random access time. We present our method and discuss an implementation that uses a DRAM with 64 ns random access time to give over 15 million lookups per second. Our tests show that the method performs well for realistic routing tables while using only modest amounts of memory.     

Routing with a clue

We suggest a new simple forwarding technique to speed up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IPv6), and performs IP lookup nearly as fast as IP/Tag switching but with a smaller memory requirement and a much simpler protocol. The basic idea is that each router adds a "clue" to each packet, telling its downstream router where it ended the IP lookup. Since the forwarding tables of neighboring routers are similar, the clue either directly determines the best prefix match for the downstream router, or provides the downstream router with a good point to start its IP lookup. The new scheme thus prevents repeated computations and distributes the lookup process across the routers along the packet path. Each router starts the lookup computation at the point its upstream neighbor has finished. Furthermore, the new scheme is easily assimilated into heterogeneous IP networks, does not require routers coordination, and requires no setup time. Even a flow of one packet enjoys the benefits of the scheme without any additional overhead. The speedup we achieve is about 10 times faster than current standard techniques. In a sense, this paper shows that the current routers employed in the Internet are clue-less; namely, it is possible to speed up the IP lookup by an order of magnitude without any major changes to the existing protocols