共查询到19条相似文献,搜索用时 63 毫秒
1.
2.
3.
通过借鉴先进的共享存储交换技术,提出一种建立在定长指针基础之上的交换概念,并由此初步建立一个对技术发展具有一定适应性的分组高速路由和交换系统。 相似文献
4.
5.
6.
王娟 《信息技术与信息化》2014,(8):51-51
近年来,智能光网络出现了新的发展,尤其是ASON的出现。本文主要介绍自动交换光网络ASON的网络结构、连接方式,模块的ASON路由方式以及路由算法的选择。 相似文献
7.
为了适应网络宽带化、分组化的发展趋势,ISTN中的数字程控交换要逐步演进为包含ATM交换和IP功能的综合业务交换平台。ATM交换的综合可有组合、集成与宽带交换模块等方式;IP的综合视需要可包括IP接入、IP选路、VoIP甚至MPLS等功能。综合交换平台将在网络的演进中发挥重要的作用。 相似文献
8.
9.
10.
下一代网络是近来业界积极讨论的一项崭新网络技术,简要分析了下一代网络的特征,进而说明了下一代网络对路由交换技术的基本需求。着重针对几项路由交换关键技术进行了分析、论证和阐述,包括技术体制、宽带路由交换平台、大容量交换,高速数据转发、路由协议、MPLS协议以及业务服务质量保证等,并且概要设计了下一代宽带路由交换平台的整体框架,提出了一种高速数据转发技术的基本流程。 相似文献
11.
Manhattan Street Networks (MSN) are bidimensional linear node sets arranged as the avenues and streets of Manhattan. Deflection routing is performed –either in the synchronous or in the asynchronous mode–by conveying incoming packets towards one of the two outputs. The simulation and analysis of all-optical MS networks is the central target of this paper. In order to avoid using complex electronics and/or optical domain buffers, the deflection routing and the asynchronism are taken into account in the analysis. The obtained results are compared and discussed with respect to some previously described analytic methodologies. 相似文献
12.
Ad hoc network is a kind of infrastructureless and self-organized mobile network. The wireless communication range of mobile nodes is limited in ad hoc network. The nodes can’t communicate with each other directly, but resort to the other adjacent nodes to forward their packets and exchange information of nodes. Every node not only serves as the mobile terminal, but also is able to store and forward packets[1]. Therefore, the node can be regarded as a router in ad hoc network. It finds the p… 相似文献
13.
由于现代网络越来越复杂,想要快速地得到从本地到目标网络的路由信息越来越复杂.基于MFC环境,设计了通过运用Traceroute功能得到一系列本地与目标网络之间各跳路由信息,并结合统计的方法对关键路由进行分析,在终端图形化地得到本地与目标网络的路由拓扑,统计到达一定网段的关键路由.通过在实际中对部分网络的测试,证明了系统在监测和分析网络路由结构上的功能,具有广泛的实用价值. 相似文献
14.
Optical burst switching is a promising switching paradigm for the next IP‐over‐optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider. 相似文献
15.
随着分行网络系统的全面推广和各项业务的不断发展,分行网络系统已经不能满足业务发展的需要。为了提高分行系统的运作效率,为客户提供方便快捷和丰富多彩的服务,增强分行系统的发展力、影响力,提高分行系统的竞争能力,本文提出一种分行网络系统的路由策略设计方案,主要通过对分行网络系统的核心区域、广域网区域、服务器区域和客户端接入区域进行路由设计,达到整个网络系统路由的优化设计。结果表明,该设计满足了分行服务器上收和全行业务系统快速部署、稳定运行的要求,在高可靠性、可扩展性、高安全性、可管理性等方面能够适应新的形势下业务发展的需求。 相似文献
16.
17.
Baert Elise Develder Chris Colle Didier Turck Filip De Pickavet Mario Demeester Piet 《Photonic Network Communications》2004,7(3):279-300
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. 相似文献
18.
互联网规模扩大,相应路由表大小呈指数增加,形成下一代互联网可扩展路由“瓶颈”。基于复杂网络和可扩展路由的相关理论与主要策略,文章对相关研究成果。如小世界效应所表现出来的特性、小世界和无标度网络模型,网格、层次及隐藏度量等3种可扩展路由网络模型,随机游走、贪婪、最大度、优先、本地介数、距离与度及相似性与度混合等多种路由策略等进行了分析与归纳。这些研究结果和方法为因互联网规模不断扩大所带来的路由系统可扩展性问题提供解决方案 相似文献