共查询到18条相似文献,搜索用时 656 毫秒
1.
野战分组交换网的性能分析 总被引:3,自引:2,他引:1
本文提出了一种评价野战分组交换性能的分析方法,其基本原理是根据网络的拓扑结构和每个节点产生的业务量计算出每个节点的总业务量以及每条链路上的业务流量,然后依据排队理论计算野战分组交换网的性能,本文对一种规划的栅格状网络进行了理论分析,并分别针对两种路由准则,采用递归方法推导出了评价网络性能的计算公式。 相似文献
2.
野战分组交换网性能的仿真分析 总被引:1,自引:0,他引:1
本文采用计算机仿真的方法研究了野战分组交换网的性能,讨论了影响网络性能的主要因素,通过对仿真结果进行分析,得出了一些有益的结论,为实际野战分组交换网的网络设计提供了理论依据。 相似文献
3.
本文从野战分组交换网的具体特点出发,对几种可供选择的路由算法进行了理论分析和计算机仿真,得出了一些有用的结论。文中根据得出的结论提出了一种新的适合于野战分组交换网的路由算法,并且简要指出了它的优缺点。 相似文献
4.
5.
本文详细地阐述了目前存在的几种基于快速分组的ATM交换网络,并介绍了一些解决网络阻塞的可行方法,还给出各种结构网络的性能分析结果。 相似文献
6.
由于当前Internet在处理实时应用和多媒体应用方面的能力不够,以及一些其他的缺陷,需要Internet从技术上有一个跃进。本文先介绍了下一代因特网的一些关键技术,然后重点研究了基于NGI技术之上的分组交换网的网络规划,介绍了网络规划的目标,网络规划的线性模型和立体模型,并给出了多种规划的工具。本文还介绍了网络规划后的性能评估工作,并给出了多种性能评估的方法和工具。 相似文献
7.
8.
文章提出了一种自选路由快速分组交换网络,该网络具有树型结构和独立的输入输出通道,通过将选路功能和集中功能相结合使网络内部通道数减少,从而减少了网络的复杂性,文中介绍了网络的结构,分析了网络的性能,参数的选择及网络实现。 相似文献
9.
CDPD技术和业务探讨 总被引:1,自引:0,他引:1
移动数据通信是数据通信和移动蜂窝技术,计算机紧密结合的产物。对蜂窝状数字式分组数据交换网络(CDPD)的工作原理,系统组成,通信协议,通信过程,使用的频率与速率,技术特点和安全性能进行了较为详细的分析,并对其应用和应采取的业务发展策略进行了探讨。 相似文献
10.
11.
本文先简单说明传统公用电话网的电路交换和数据通信网的分组交换原理。然后介绍语音压缩和分组语音技术在互联网和内部网上的应用 ,以实现互联网电话的新趋向。 相似文献
12.
13.
Tracy Bradley Maples Tatsuya Suda 《International Journal of Satellite Communications and Networking》1991,9(5):247-265
The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks, including a look at NISDN, while focusing on unified approaches to integrated-service networks. The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of ‘bursts’ of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hard-wired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network. 相似文献
14.
Optical networks based on the ‘clockwork’ routing mechanism have significant advantages for high-speed optical packet switched
applications in which latency is critical, such as parallel and distributed computing. The main advantages are that no optical
buffers and no centralized contention arbitration are required. However, the network performance decreases rapidly with increasing
network size. This article proposes the use of wavelength division multiplexing, in combination with clockwork routing, to
provide significant improvements in network scalability and bisection bandwidth, resulting in higher throughput and reduced
latency. 相似文献
15.
16.
子网移动性管理的最终目标是移动网络中的所有节点郝可以通过一个永久的IP地址被访问,并且当移动网络的路由器改变接入点时,内部节点仍然可以保持连续的通信。但当前的移动性管理方案由于其基本协议的切换时延较大,丢包率较高而不能适应实时业务和移动通信的要求,需要对移动性管理策略进行改善。文中介绍一种基于SIP和SCTP协议的混合方法Hybrid—NEMO,解决基于MIPv6的NEMO所存在的问题。通过建立相应模型并进行仿真对比分析,该方案能够保证网络移动切换过程中零丢包率和可控制的时延抖动,完全可以实现网络无缝移动的有关性能指标,从而较好地解决了现有移动网络模型实现无缝移动过程中的不足。 相似文献
17.
任意拓扑结构战术地域分组交换网的性能分析 总被引:1,自引:0,他引:1
本文以战术地域分组交换网为基础建立具有不规则拓扑结构网络模型,在给出网络的拓扑结构、网络用户业务量和路由选择算法的条件下,提出了一种计算网络链路传输业务量的方法,并用于分析网络的传输性能。同时,还用计算机仿真方法对同一网络进行模拟。分析结果说明:这类通信网的路由选择算法的设计应更重视网络内部流量的均匀分配 相似文献
18.
An Efficient Scheduling Discipline for Packet Switching Networks Using Earliest Deadline First Round Robin 总被引:1,自引:0,他引:1
This paper addresses a frame-oriented scheduling discipline, EDF-RR (earliest deadline first round robin), for OQ (output-queued) switch architecture and data traffic consisting of fixed-length cells. Bandwidth reservation for an active session is performed by holding a number of cell slots for the session in a repeatedly-transferred frame. Each cell that is going to be transferred in the frame is assigned a virtual release time and a virtual deadline according to the bandwidth reservation scheme. The transmitting order of the cells in the frame is determined by non-preemptive non-idling EDF algorithm so that cells of a backlogged session in the frame are distributed as uniformly as possible. Through the analysis applying real-time scheduling theory and network calculus as well as network simulation, EDF-RR takes the advantage of O(1) computational complexity, and possesses tight delay bounds and lenient buffer requirements. The proposed scheduling discipline is appropriate for distributed real-time systems as we show that sessions can be configured based on message traffic models and deadline requirements. Also, a modified version of EDF-RR, called EDF-DRR, can be applied as traffic regulator when jitter requirements exist among active sessions.
This work was sponsored in part by the Federal Aviation Administration (FAA) via grant DTFA03-01-C-00042. Findings contained herein are not necessarily those of the FAA. 相似文献