新互联网体系理论及关键技术

互联网在可信(安全、可靠、可控、可管)等方面存在严重弊端。为解决这些问题,文章研究和探索新一代互联网体系的基础理论,给出了新网络的体系结构模型;创造性地提出新网络体系下的交换路由模型与理论,建立接入标识、广义交换路由标识及其映射理论;提出普适服务体系模型与理论,创建服务标识及其映射理论、连接标识及其映射理论;并对新互联网体系中的接入控制管理、可信路由及服务质量、多流传输、网络监测管理等关键技术进行了研究和探讨。     

IEEE1588协议及其在路由交换平台中的实现技术

下一代网络（NGN）是一种融合了IP技术和多媒体通信技术的全新网络,然而当涉及到传统TDM业务应用及需要进行时钟同步分配时,基于IP技术的全新网络则需要具备完善的时钟同步能力来满足相关业务的同步需求。IEEE1588协议标准的出现正好解决了在新一代路由交换平台中的时钟同步问题。这里分析了IEEE1588协议的偏移测量和延时测量时钟同步过程,并给出了IEEE1588协议在路由交换平台中的具体实现过程。     

基于身份与位置分离的嵌套移动网络路由优化机制

基于移动IPv6嵌套移动网络中存在的路由优化问题,本质上是由传统互联网的体系结构造成的.在传统互联网体系结构中,IP地址同时代表了节点的身份标识和位置标识,这种双重功能不利于节点的移动.针对这一问题,本文提出一种身份与位置分离的体系结构,IP地址只作为节点的位置标识,引入端点标识符作为通信双方的身份标识,使得当节点的地址改变时通信双方的连接不中断.在该身份与位置分离体系结构基础上,提出一种嵌套移动网络的路由优化机制,利用封装在IPv6逐跳选项报头中的路由更新选项、路由确认选项和路由删除选项进行路由优化.性能分析结果表明,该机制具有较低的报文开销和路由更新时延.     

Implementation of a geographical routing scheme for low Earth orbiting satellite constellations using intersatellite links

A major problem for low Earth orbit (LEO) constellations with intersatellite links is the efficient routing of the data packets through such a highly dynamic network. In order to achieve a worldwide coverage even in remote areas and Internet access with a limited amount of gateway stations, intersatellite links are a promising approach. Since LEO constellations represent a distinct, highly dynamic routing environment, specific strategies are needed. To this end, a suitable geographical routing scheme is proposed and investigated in two Walker Star constellations. The proposed scheme targets reliable transmissions with low latency and high data rates. The approach is based on a geographical address identifier in Layer 2 of the communication stack. The globe is thus divided into geographical areas that determine this identifier in the MAC address of the terminals. As mobile terminals are considered, the MAC addressing scheme is flexible, whereas the IP addresses of the terminals remain static. This decoupling allows for flexibility in the choice of the address resolution scheme. Moreover, the geographical identifier in the MAC address enables fast routing table lookups and switching. The proposed routing scheme also takes possible overloads of the satellites due to traffic into account and applies a rerouting procedure. When a packet arrives in the geographical area of the destination terminal, a local rerouting scheme is applied if needed. The proposed approaches take handover events that possibly occur during a transmission into account. Furthermore, the scan angles of the satellites have been adapted to the constellations to provide full coverage and high elevation angles. So a robust and adaptable routing scheme is provided for a dynamic environment where satellites and terminals are constantly moving. The proposed definitions and procedures have been implemented in a system level simulator, which allows for comparisons with adjustable parameters in various scenarios. In this work, an Iridium‐like constellation and a megaconstellation are investigated and compared regarding the address resolution procedures, the average end‐to‐end transmission delay, and the dropping and rerouting rates. Additionally, the signaling overhead is compared with other approaches. The simulator and results of the simulations provide grounds for further research w.r.t. the routing in satellite constellations using intersatellite links.     

基于P2P的简单查找算法设计

随着P2P系统的发展.它在Internet上的应用越来越广泛,尤其是对分布式数据对象的查找.为此,提出一种基于对等网络系统的简单查找方法.在假设具有N个固定节点的良好状态P2P网络环境中,利用一致哈希函数把给定的关键字随机方法映射到一个虚拟标识环的节点上,在标识环中每个节点根据自身路由表的信息查找指定关键字的映射.由方法讨论和性能分析可知,该方法是一种正确高效的查找分布式数据方法,用它可缩小存储空间的占用.     

基于对等模型的新型光因特网技术

文章简述一种新的组网技术———对等模型,它为光因特网的实现提供一种新的方式。通用多协议标签交换(GMPLS)支持对等模型网络,GMPLS技术和路由机制是构建对等模型光因特网的关键技术。     

移动自组织网络中可扩展的定位符/标识符分离路由协议

In the traditional Internet Protocol (IP) architecture, there is an overload of IP semantic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks (MANETs). To improve scalability. A routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector (TLDV). The hard core of this routing method is the identifier/locator split by the Distributed Hash Table (DHT ) method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes . Locator space is organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform. Results show that TLDV has better scalability.     

Streamlining the Internet-fiber connection

Discusses the evolution towards WDM optical fiber networks for the development of the Internet. The topics of multiprotocol label switching and multiprotocol lambda switching, together with the client server model, the big fat router model, the peer-peer model and the augmented model are considered. The authors also focus on routing and survivability aspects     

A packet header recognition assigning the position of a signal inthe time axis and its application to all-optical self-routing

We describe an all-optical circuit that recognizes by a packet the header [virtual channel identifier (VCI): 16 bits and virtual path identifier (VPI): 8 bits] extracted from a cell for self-routing. The circuit's operation is confirmed by an experiment in the recognition of four header bits, and an all-optical routing experiment is carried out with a sequence of four cells, which are composed of two header bits. The output from the header recognition circuit appears in a signal assigned In the time axis according to the header information. The signal controls the switch in the switching system. The proposed header recognition and self-routing circuits are successfully demonstrated by the experiments     

Tag switching architecture overview

Tag switching is a way to combine the label-swapping forwarding paradigm with network-layer routing with particular application to the Internet. This has several advantages. Tags can have a wide spectrum of forwarding granularities, so at one end of the spectrum a tag could be associated with a group of destinations, while at the other end, a tag could be associated with a single application flow. At the same time, forwarding based on tag switching, due to its simplicity, is well suited to high-performance forwarding. These factors facilitate the development of a routing system that is both functionally rich and scalable. Last, tag switching simplifies the integration of routers and asynchronous transfer mode switches by employing common addressing, routing, and management procedures     

On wavelength-converted optical routers employing flow routing

Optical networks have been extensively investigated in recent years to provide high capacity for the Internet traffic. Among them the optical packet-switching network deploying buffering, wavelength conversion and multipath routing could be the most suitable one. It cannot only provide high capacity transport for Internet traffic but also achieve high utilization of the network resources. However due to the packet-oriented routing and switching, such a network can result in a large amount of packets out-of-order, packet loss and/or with various delays upon arriving at end systems, causing TCP flows that comprise those packets corrupted. Large amount of corrupted flows can increase the burstiness of the Internet traffic and cause higher-layer protocol to malfunction. This paper presents a novel routing and switching method for optical IP networks-flow routing. Without using a complicate control mechanism flow routing deals with packet-flows to reduce the amount of corrupted flows. The performance of the wavelength-converted optical flow router is investigated, based on a novel analytical model. A performance metric, i.e., good-throughput, is used, measuring the ratio of the amount of packets comprised in the noncorrupted flows to total amount of packets. Comparing with optical packet-switching routers, a remarkable improvement of good-throughput can be obtained by using optical flow routers. More important, using wavelength conversion can greatly improve the good-throughput of optical flow routers.     

Deployment and test of IPv6 services in the VTHD network

This article presents the deployment and test of IPv6 services in the very high broadband IP/WDM (VTHD) [L. Thual, 2003] network for new-generation Internet applications. The VTHD project is partially funded by the French government through the French Research Network for Telecom (RNRT). VTHD supports both IPv4 and IPv6 services, and interconnects research centers and institutions in France. It has a public autonomous system number (AS20603) and a public IPv6 subnet. It is connected to the IPv6 global network via open transit (France Telecom's international IP service for ISPs). VTHD in France compares with Internet2 in the United States. This article focuses on the implementation of the IPv6 service, IPv6 performance (in the context of a high-speed network), the advantages of given technologies, and problems encountered. The following items are developed: VTHD architecture, IPv6 address space and aggregation, transition mechanisms, routing protocols, network test performance, IPSec test performance, naming (DNS), and network management.     

未来光网络中的交换路由器

IP业务的爆炸式增长与DWDM技术的突飞猛进为新的WDM网络直接承载IP业务创造了条件。光交换和交换路由器的发展提供一种集成了智能IP路由技术和大容量光交换网络的交换路由器模型。这种交换路由器支持高QoS保证 ,简化了光核心网络结构 ,是近期光联网的理想解决方案     

Flow-based load-balancing architecture for the agile all-photonic network

A novel routing architecture that balances incoming Internet flows over the agile all-photonic network (AAPN) is proposed. The architecture is based on the adaptive highest random weight (adaptive HRW) algorithm proposed to design load-balanced Internet routers. Extensive numerical evaluation of static and adaptive variations of the routing architecture is studied, and their effect on the network performance in terms of packet drop and flow remapping is presented. The architecture can be seen as a combination of adaptive core node scheduling and adaptive load balancing at the edge nodes. It is stateless and can compute routes quickly based on the packet flow identifier.     

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

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

Flow Routing and its Performance Analysis in Optical IP Networks

Optical packet-switching networks deploying buffering, wavelength conversion and multi-path routing have been extensively studied in recent years to provide high capacity transport for Internet traffic. However due to packet-based routing and switching, such a network could result in significant disorder and delay variation of packets when they are received by end users, thus increasing the burstiness of the Internet traffic and causing higher-layer protocol to malfunction. This paper addresses a novel routing and switching method for optical IP networks — flow routing, and its facilitating protocol. Flow routing deals with packet-flows to reduce flow corruption due to packet out-of-order, delay variation and packet loss, without using complicate control mechanism. Detailed performance analysis is given for output-buffered optical routers adopting flow routing. Two flow-oriented discarding techniques, i.e., flow discard (FD) and early flow discard (EFD), are discussed. Compared with optical packet-switching routers, a remarkable improvement of good-throughput is obtained in the optical flow-routers, especially under high congestion periods. We conclude that EFD behaves as a robust technique, which is more tolerant than FD to the change of traffic and transmission system factors.     

一种WDM全光IP路由器的结构设计与分析

为突破“电子瓶颈”的限制，Internet向波分复用(WDM)全光网络演进已是必然的趋势．在光Internet中，光路由器是最为关键的设备之一．文章提出了一种光路由器实现的结构，该结构是以光突发标记交抉为核心，不需经过多次的O／E／O转换，即可实现边缘到边缘的全光域数据传输和处理．文章还对该结构具体实现中的关键问题：光突发数据的格式和装配、报头的提取和识别、路由及光标记交换和拥塞等进行了详细的分析研究，提出了可行的解决办法．最后设计了一个实验系统，并给出了相应的实验结果．     

Constraint-based routing in the internet: Basic principles and recent research

Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the Internet over the last decade. Constraint-based routing algorithms select a routing path satisfying constraints that are either administrative-oriented (policy routing) or service-oriented (QoS routing). The routes, in addition to satisfying constraints, are selected to reduce costs, balance network load, or increase security. In this article, we discuss several constraint-based routing approaches and explain their requirements, complexity, and recent research proposals. In addition, we illustrate how these approaches can be integrated with Internet label switching and QoS architectures. We also discuss examples of application-level routing techniques used in today's Internet.     

MPLS-Linux体系结构及交换路由性能分析

本文详细介绍了MPLS-Linux的体系结构、核心数据结构、标签交换过程和QoS运行等实现技术，通过对MPLS-Linux组成的交换路由系统进行性能测试和分析，发现：在链路轻载或预留带宽的情况下，交换路由系统对数据流的服务质量优于传统路由系统；只有综合应用策略路由、数据报分类调度和标签交换才能实现Internet环境下对端到端服务质量的控制。     

Novel Packet Switching for Green IP Networks

A green technology for reducing energy consumption has become a critical factor in ICT industries. However, for the telecommunications sector in particular, most network elements are not usually optimized for power efficiency. Here, we propose a novel energy‐efficient packet switching method for use in an IP network for reducing unnecessary energy consumption. As a green networking approach, we first classify the network nodes into either header or member nodes. The member nodes then put the routing‐related module at layer 3 to sleep under the assumption that the layer in the OSI model can operate independently. The entire set of network nodes is then partitioned into clusters consisting of one header node and multiple member nodes. Then, only the header node in a cluster conducts IP routing and its member nodes conduct packet switching using a specially designed identifier, a tag. To investigate the impact of the proposed scheme, we conducted a number of simulations using well‐known real network topologies and achieved a more energy‐ efficient performance than that achieved in previous studies.