基于可编程路由技术的 MPLS 单标签分流传输算法

为提高数据传输的QoS(服务质量),运用MPLS(多协议标签交换)、并发多路径和可编程路由技术,提出了multipathMPLS算法,实现了单个转发等价类标签进行多个标签交换路径并行分流的传输算法。NS2仿真实验证明,该算法具备MPLS高速转发,并发多路径较高吞吐量,可编程路由器灵活部署等优点。     

基于标签交换的Ad Hoc网络研究

研究基于标签交换的Ad Hoc网络，目的是提高网络的快速转发能力，减小数据包的转发时延，在功能上实现路由与交换功能的分离，本文研究通过在Ad Hoc网络中建立标签交换路径，实现数据包的标签交换，燕详细叙述了基于标签交换的Ad Hoc网络的基本架构和实现过程。     

结合集成服务、差分服务和MPLS实现端到端QoS保证

文章论述了当前流行的多种Qos（服务质量）解决方案，详细分析了这些方案的优缺点。最后综合这些方案优点．提出了一种新的端到端的QoS解决方案。该方案通过在MPLS（协议标签交换）的基础上结合集成服务、差分服务以及流量工程的思想，在实现端到端QoS保证的同时实现了优化路由和负载均衡。     

内嵌MPLS的多业务传送平台

为了提高多业务传送平台(MSTP)组网的路由能力、交换能力和服务质量(QoS)处理能力,需要将多协议标签交换(MPLS)的固有优势引入MSTP.方法是通过内嵌MPLS的MSTP,实现将以太网业务适配到MPLS层,然后映射到SDH通道中传送.MPLS技术通过将交换的概念引入MSTP,实现了数据流的统计复用和负载均衡;通过将QoS引入MSTP,实现了对各种新兴业务的支持;通过基于二层和三层技术的解决方案,在MSTP中实现了MPLS虚拟专用网(VPN);通过支持单向1 1、1:1标签交换路径(LSP)和MPLS快速重路由保护倒换,在MSTP中实现了MPLS的保护倒换机制.     

基于GMPLS的自动交换光网络生存性技术研究

能够提供高效快速的生存性是自动交换光网络的重要特点.介绍了自动交换光网络的生存性实现的过程和各种生存性机制,提出了基于通用多协议标签交换的自动交换光网络中标签交换路径端到端生存性的实现方案,并对恢复的时间具体的分析.     

Broadcom推出千兆以太网IP电话芯片

近日，Broadcom公司推出了IP电话芯片。该种芯片把千兆以太网(GE)交换、端到端安全、先进服务质量(QoS)技术和增强处理性能集成在一块芯片设计中。这种高度集成的IP电话芯片具有以太网交换能力，能够使配置在千兆以太网上的IP电话实现最大吞吐量。为了支持语音、视频和数据一体化通信对带宽的更高要求，千兆以太网(GE)技术正在被广泛地应用在企业网络中。     

BCM1103：千兆以太网IP电话芯片

博通公司发布一枚互联网协议(IP)电话芯片BCM1103。该芯片把干兆以太网(GbE)交换、端到端安全、先进服务质量(QoS)技术和增强处理性能集成在一块芯片设计中。这种高度集成的IP电话芯片具有新的以太网交换能力，它能够使配置在干兆以太网网络上的IP电话实现最大吞吐量。     

MPLS在城域MSTP中的应用

为解决QoS等IP网络存在的问题，每个ISP都渴望寻求一种能够结合快速交换技术和IP路由技术优势的网络解决方案．MPLS(多协议标签交换技术)应运而生。标签交换技术就是致力于把L2层交换技术的最优属性(通常由ATM或帧中继具体实现)与L3层路由技术的最优属性(由IP具体实现)紧密结合起来，其中多协议标签交换(MPLS)是目前标准最统一、最具发展前景的标签交换技术。MPLS由因特网工程任务小组(IETF)制定，始于1997年初．其目标是实现在大规模IP网内通过ATM和帧中继等多种媒介实现保证QoS的快速交换。     

MPLSLDP的设计与实现

MPLS作为一种可以提供高性价比和多业务能力的技术，MPLS必将成为NGN(下一代网络)的关键技术之一。LDP(标签分发协议)作为MPLS主要信令协议之一，定义了一整套规程，LSR(标签交换路由器)通过这些规程来实现对于标签的分配、绑定和分发，从而支持MPLS沿着正常路由路径的转发。这篇论文中，我们将主要讨论MPLS LDP的设计与实现。     

在基于GMPLS的无源光网络中支持端到端QoS

文章首先对下一代网络技术的发展趋势以及IETF服务质量（QoS）机制进行了简单介绍,然后对现有无源光网络技术对端到端QoS支持的不足进行了总结,提出了基于通用多协议标签交换（GMPLS）的无源光接入网QoS服务模型。通过在接入网中引入GMPLS通用控制和管理平台,建立了统一的QoS服务模型,实现了对端到端QoS的有效支持。     

Cross-Layer Design of 2D Queuing Model for Multi-hop Wireless Networks

Based on cross-layer design, a modified 2-dimensional queuing model (2DQM) is proposed in this paper to tackle the problem of end-to-end quality of service (QoS) metric calculation. This model exploits the traffic arrival process, multi-rate transmission in the physical layer and error recovery technology with the protocol of truncated automatic repeat request in the data link layer. Based on this model, QoS metrics of wireless links can be evaluated hop by hop. The model can be used in more realistic scenarios of multi-hop wireless networks, although the computational complexity of 2DQM is slightly higher compared with existing 1-dimensional queuing model. Simulation results indicate that the proposed model can estimate the end-to-end packet loss-rate and average delay more accurately than existing models, and a model based QoS routing algorithm can find routes with better QoS performance (with lower end-to-end packet loss-rate and delay).     

A flexible and distributed architecture for adaptive end-to-end QoS provisioning in next-generation networks

A novel distributed end-to-end quality-of-service (QoS) provisioning architecture based on the concept of decoupling the end-to-end QoS provisioning from the service provisioning at routers in the differentiated service (DiffServ) network is proposed. The main objective of this architecture is to enhance the QoS granularity and flexibility offered in the DiffServ network model and improve both the network resource utilization and user benefits. The proposed architecture consists of a new endpoint admission control referred to as explicit endpoint admission control at the user side, the service vector which allows a data flow to choose different services at different routers along its data path, and a packet marking architecture and algorithm at the router side. The achievable performance of the proposed approach is studied, and the corresponding results demonstrate that the proposed mechanism can have better service differentiation capability and lower request dropping probability than the integrated service over DiffServ schemes. Furthermore, it is shown that it preserves a friendly networking environment for conventional transmission control protocol flows and maintains the simplicity feature of the DiffServ network model.     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

QUORUM—Quality of Service in Wireless Mesh Networks

Wireless mesh networks (WMNs) can provide seamless broadband connectivity to network users with low setup and maintenance costs. To support next-generation applications with real-time requirements, however, these networks must provide improved quality of service guarantees. Current mesh protocols use techniques that fail to accurately predict the performance of end-to-end paths, and do not optimize performance based on knowledge of mesh network structures. In this paper, we propose QUORUM, a routing protocol optimized for WMNs that provides accurate QoS properties by correctly predicting delay and loss characteristics of data traffic. QUORUM integrates a novel end-to-end packet delay estimation mechanism with stability-aware routing policies, allowing it to more accurately follow QoS requirements while minimizing misbehavior of selfish nodes.     

无建立无状态QoS路由

本文提出了无建立无状态QoS路由的概念,并认证了实现无状态QoS路由的关键在于:(1)如何将应用的QoS要求嵌入IP分组头中;(2)如何有效地设计路由器的分组转发策略.本文结合特定的路由算法,提出了多种新颖的无建立无状态QoS路由具体实现方案.本文提出的无状态QoS路由方案最大限度地利用了目前IP网络中采用的"尽力传送"路由表风格,具有良好的可扩展性、鲁棒性、简单性和有效性.     

QoS routing based on mobile agent for LEO satellite IP networks

Current quality of service (QoS) routing schemes for low earth orbit (LEO) satellites IP networks either neglect the varying population density or fail to guarantee end-to-end delay. As a remedy, QoS routing protocol based on mobile agent (QoSRP-MA) is proposed. QoSRP-MA is a source-based routing protocol. Once connection requests arrive, QoS mobile agents are dispatched from ingress satellite to explore routes, which migrate using satellite routing tables. Upon arriving in egress satellite, QoS mobile agents migrate back towards ingress satellite to reserve bandwidth. To construct satellite routing tables, load balancing routing algorithm based on mobile agent (LBRA-MA) is presented. In LBRP-MA, at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing tables. Moreover, path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link (ISL) cost. Furthermore, ISL congestion index is considered to update routing table. Through simulations on a Courier-like constellation, it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput, lower connection failing ratio and signaling overhead compared to high performance satellite routing (HPSR) scheme.     

A Lagrangean relaxation approach for QoS networks CFA problems

This paper is about design methodologies for packet networks, under the constraints of end-to-end quality of service (QoS) metrics. The network modeling also considers the dynamics of today's packet networks. We are particularly considering the problem of capacity and flow assignment where the routing assignments and capacities are considered to be decision variables. An efficient Lagrangean relaxation-based heuristic procedure is developed to find bounds and solutions for a corporate virtual private network (VPN), where the traffic is mostly based on TCP connections. Numerical results for a variety of problem instances are reported.     

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.     

Routing Strategies to Minimize Packet Loss in an Optical Packet Switched Network with Recirculating FDL Buffers

The major goal of optical packet switching (OPS) is to match switching technology to the huge capacities provided by (D)WDM. We study optical packet switches with recirculating fiber delay line (FDL) buffers. Through simulation, we have assessed the logical performance of a single optical packet router (OPR), focusing on packet loss rate (PLR). By verifying that our scheduling algorithm does not alter the traffic profile characteristics from in- to output, we illustrate how the single node results can be used to assess network-wide performance. We use the capability of assessing end-to-end PLRs to develop network-wide routing algorithms designed to minimize the maximal PLR occurring in the network. In case studies on pan-European networks, we first compare two algorithm variants and thereafter we compare the PLR-based routing algorithm with both load balancing and shortest path routing. While load balancing achieves PLRs that are multiple orders of magnitude lower than shortest path routing, the PLR-based algorithm can reach PLRs up to two orders of magnitude better. The improvement in PLR comes at the price of only a small increase in used bandwidth (a few percent). Subsequently we show that the discussed PLR-based routing algorithm can be easily extended to multiple priorities. By introducing multiple priorities we can keep the loss rates for high priority traffic very low. However, it may lead to an increase of the obtained minimal max-PLR value for low priority traffic. But as we prove this increase to be limited, the cost of introducing multiple priorities is small.