共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper describes realtime network management support systems which have been developed forntt’s telephone network. In particular, the advanced traffic observation and management information collecting system referred to as Atomics and the traffic congestion control system referred to astcs are presented. The purpose of the development, concept, functions and capabilities of each system are explained. Examples of powerful realtime network management supported by Atomics andTSC are also presented. 相似文献
2.
3.
《Proceedings of the IEEE. Institute of Electrical and Electronics Engineers》1977,65(9):1353-1362
Saturation routing means a flooding of a network with messages which search for a particular subscriber's number without regard to where that subscriber is located in the network. Saturation routing, often thought of as inappropriate in a communication network, can be a useful routing scheme with the use of state-of-the-art design. In this paper, consideration will be spent on the kinds of networks in which saturation routing is applicable, and how it compares with other routing systems. The functional designs of saturation routing will be combined with the appropriate variables to create a mathematical model for performing of saturation routing in a network. The following are some of the variables: i) processor rate; ii) transmission data rate; iii) hierarchy; iv) queuing delays; v) traffic; vi) message size. The paper will be concluded with an example of a realistic network using saturation routing. 相似文献
4.
Presents an overview of the efforts of the 13 participating carriers that comprise the Worldwide Intelligent Network (WIN) Dynamic Routing Group to introduce dynamic routing internationally. The authors propose that the introduction of dynamic routing could be accomplished in stages, starting with the deployment of flexible overflow routing for bilateral networks. Then the authors examine performance feasibility issues associated with multiple carrier transit routing and analyze data items that need to be exchanged by international carriers to realize dynamic traffic control. They also review major conclusions that can be made based on the results of the first WIN dynamic routing trials. Finally, they review a proposal for standardization of certain signaling messages that enables the realization of real-time state-dependent routing in a multiple carrier environment 相似文献
5.
The authors consider the problem of traveling with least expected delay in networks whose link delays change probabilistically according to Markov chains. This is a typical routing problem in dynamic computer communication networks. Several optimization problems, posed on infinite and finite horizons, are formulated, and they are considered with and without using memory in the decision-making process. It is proved that all these problems are, in general, intractable. However, for networks with nodal stochastic delays, a simple polynomial optimal solution is presented. This is typical of high-speed networks, in which the dominant delays are incurred by the nodes. For more general networks, a tractable ∈-optimal solution is presented 相似文献
6.
In this article, the problem of load balance in hierarchical routing network is studied. Since conventional shortest path first (SPF) algorithm over aggregated topology in hierarchical routing network may result in worse routing performance, a traffic sharing path selection algorithm and a variable weight scheme are put forward for hierarchical routing network, which can equilibrate the utilities of link resources and reduce the blocking probability of connections with the improvement on survivability. Simulations are conducted to evaluate proposed variable weight and traffics balance (VWTB) algorithm, which combines traffic sharing and variable weight. From the simulation results, it can be found that the proposed VWTB algorithm can balance the traffics and equilibrate the utilities of link resources significantly. 相似文献
7.
Coding-aware routing can create more coding opportunities by selecting the proper routing path. The main challenge in exploiting network coding is how to develop an effective network coding conditions. In this paper, we develop the active intersession network coding (AINC) which can create more intersession network coding opportunities than the general intersession network coding (GINC) by actively exploiting the redundancy information in the network with the deliberately built bridge links. With the aim to find multiple candidate parallel paths for each unicast, the conventional Bellman–Ford algorithm is enhanced. Built on AINC and the enhanced Bellman-Ford algorithm, we propose the active intersession network coding-aware routing (AINC-AR) scheme for the wireless network which supports multiple unicasts. The basic idea of AINC-AR is to select the path from all available candidate ones by jointly considering the effects of network coding gains and path costs on the overall network costs, so as to minimize the total network costs. Simulations are conducted to demonstrate the advantages of AINC-AR over GINC-AR and the conventional routing scheme without considering network coding. 相似文献
8.
随着科学技术的不断发展与进步,计算机网络的功能越来越多,使得网络路由的发展面临着更多的挑战。目前,计算路由的方式有很多种,目的就是为了使其运行满足路径传递信息的需求,不仅提高了服务质量,还使网络资源的利用率得以提高。 相似文献
9.
HOU Jian SHEN Jin-yuan CHANG Sheng-jiang ZHANG Yan-xin 《光电子快报》2005,1(3):217-220
The main goal of routing solutions is to satisfy the requirements of the Quality of Service (QoS) for every admitted connection as well as to achieve a global efficiency in resource utilization. In this paper proposes a solution based on Hopfield neural network (HNN) to deal with one of representative routing problems in uni-cast routing, i. e. the multi-constrained(MC) routing problem. Computer simulation shows that we can obtain the optimal path very rapidly with our new Lyapunov energy functions. 相似文献
11.
12.
This paper presents the results of a study carried out at CNET on the gradual digitalization of a large telecommunication network, SATINcomputes the traffic routing and the trunk groups in the hierarchical switched networks and minimizes its global cost. An experimental network comprising approximately 770 centres, where the percentage of digital switching centres is increased from 0 % up to 100 % is used. The paper points out the most important effects of digitalization and analyzes the grounds for these effects. 相似文献
13.
内容中心网络状态感知路由设计 总被引:1,自引:0,他引:1
为了提高内容中心网络的内容分发效率及降低网络开销,提出了网络状态感知的路由机制NSAR(network status aware routing)。NSAR利用从内容服务节点返回的数据分组收集当前网络状态信息,并在回传过程中对路径上各节点上匹配端口的转发概率进行更新,在对后续的兴趣分组进行转发决策时引入转发概率,从而提高内容分发效率。仿真实验表明,与传统内容中心网络路由算法相比,NSAR可以有效地降低内容请求平均时延,减少网络流通分组数以及降低网络带宽开销。 相似文献
14.
Zhen Chen Zeng-Ji Liu Zhi-Liang Qiu 《Communications Letters, IEEE》2003,7(3):121-123
We enhance the general shuffle-exchange network (GSEN) with bidirectional links. For bidirectional links, the bidirectional GSEN can be divided into two dependent networks, forward network and backward network. Based on the idea of inversely using the forward tag, we propose a tag-based routing algorithm for the backward network, so as to reduce the computation of the shuffle-exchange operation. 相似文献
15.
16.
17.
本文介绍了传输网络在某一节点建设第三条光缆路由时的设备解决方案.同时对OLP技术、OLP各种实现方式及工程中应注意的事项进行论述.对于利用交叉单元实现第三路由的接入,本文着重阐述了SDH网络及OTN网络光、电层面交叉技术的实现方式和局限,并最终提出两种技术的应用思路. 相似文献
18.
19.
20.
Pioro M. Lubacz J. Tomaszewski A. Bursztynowski D. 《Selected Areas in Communications, IEEE Journal on》1994,12(7):1192-1198
The Warsaw metropolitan network is undergoing a radical architectural and technological transformation. The transformation, forced by the large unrealized demand for telephone stations, and structural traffic bottlenecks, is based on the installation of eight digital transit switches of high capacity. The so-formed upper transit layer gives an opportunity for the deployment of an efficient traffic routing system, for carrying the growing traffic well beyond the year 2000 without additional investments. A step-wise strategy is presented far the deployment of a modern traffic routing system in the Warsaw network, adapted to, and taking advantage of the fast transformation of the network. The choice of the strategy is based on a case study of the traffic handling efficiency of various routing systems in a model of the Warsaw metropolitan network 相似文献