ImageVerifierCode 换一换
格式:PDF , 页数:10 ,大小:395.46KB ,
资源ID:794963      下载积分:10000 积分
快捷下载
登录下载
邮箱/手机:
温馨提示:
如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝扫码支付 微信扫码支付   
注意:如需开发票,请勿充值!
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【http://www.mydoc123.com/d-794963.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(ITU-T E 170-1992 Traffic Routing (Study Group II) 10 pp《业务选路》.pdf)为本站会员(deputyduring120)主动上传,麦多课文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文库(发送邮件至master@mydoc123.com或直接QQ联系客服),我们立即给予删除!

ITU-T E 170-1992 Traffic Routing (Study Group II) 10 pp《业务选路》.pdf

1、INTERNATIONAL TELECOMMUNICATION UNION CCITT THE INTERNATIONAL TELEGRAPH AND TELEPHONE CONSULTATIVE COMMITTEE TELEPHONE NETWORK AND ISDN OPERATION, NUMBERING, ROUTING AND MOBILE SERVICE E.170 (1 0/92) TRAFFIC ROUTING Recommendation E.170 CCITT RECMN*EmL70 92 4862593 0576787 222 FOREWORD The CCITT (th

2、e Ititertiatioiid Telegraph and Telephone CoiisulLtive Committee) is a pennaiieiit organ of tlie Internatioual Telecnmunication Union (ITU). CCITT is responsible for studying technical, operating and tariff questions and issuing Recommendations o11 them with a view to standardizing telecoininuiiicat

3、ious on a worldwide basis. The Plenary Assembly of CCITT which meets every four years, establishes the topics for study aid approves Recoinineudatiotis prepared by its Study Groups. The approval of Recommendations by the members of CCITT between Plenary Assemblies is covered by the procedure laid do

4、wn in CCITT Resolution No. 2 (Melbourne, 1988). Recomineiidatioii E.170 was revised by Study Group II and was approved under the Resolution No. 2 procedure on the 30th of October 1992. CCIT NOTES 1) telecoinmunication administration and a recognized private operating agency. In this Recommendation,

5、the expression “Administration” is used for conciseness to indicate both a 2) A list of abbreviations used in this Recomendatioii cai be found in Annex A. O ITU 1993 All rights reserved. No part of this publication may be reproduced or utilized in any form or by .my means, electronic or inechxiicai,

6、 iiicludiiig photocopying and microfilm, without permission in writing from the ITU. - - - - - - -_ _ CCITT RECflN*E.370 92 4862593 O576788 369 9 Recommendation E.170 TRAFFIC ROTING (revised 1992) 1 Introduction 1.1 Objective o.ftr S2 indicates that congestion has occurred further downstream, e.g. o

7、n outgoing trunks from D. The choice of action at Exchange A is subject to bilateral agreement. 4 Recommendation E.170 (10/92) - - CCITT RECflN*E.L70 92 4862591 057b792 b9T Traffic stream to a particular destination (e.g. area code) In the exainple of Figure 4E.170, a call from A to D is routed via

8、C because the circuit group B-D is congested (Sl-indicator) aid a call from A to F is routed via E because the circuit group D-F is congested (S2-indicator) A 13% Four outgoing b B 3% rotdingpatterns b C 42% to the destination b D 16% 100% - Originating Terminating exchange exchange TOo202220-91 Abt

9、e - Blockiiig Goni to D activates signal S1 to A. Blocking Goni Dto F activates signal S2 to k FiGURE 4E.170 Adiniiiistratioiis inay wish to consider the increase in signalling load and the number of call Set-up operations resulting froin the use of these signals. If the increase is unacceptable, ad

10、tninistrations may restrict the number of recautiiigs or litnit the signalling capability to fewer exchanges. Finally, cue must he taken to avoid circular routings which return the call to the point at which blocking previously occurred during the call Set-up. 4.3 Loud diciring All routing scheines

11、result in the sharing of traffic load between network elements. Routing schemes can however he developed to ensure that crdl attempts are offered to route choices according to a preplanned distribution. Figure 5E. 170 illustrates this application of load shnring which can be made available as a soft

12、ware function of SPC exchanges. The system works by distributing the call attempts to a particular destination in a fixed ratio between the specified outgoing routing patterns. Note -. Fach outgoing routing pattern (A, B, C, D) may include alternative routing options. FIGURE 5E.170 Recommendation E.

13、170 (10/92) 5 CCITT RECMN*E-L70 92 4862593 0576793 526 4.4 Dytiumic routing 4.4.1 Exmnple of state-dependent routing A centralized routing processor is employed to select optimum routing patterns on the basis of the actual occupancy levels of the circuit groups and exchanges iii the tietwork which a

14、re monitored on a periodical basis (e.& 10 s), see Figure 6E.170. In addition, qualitative traffic parameters may also be taken into consideration in the detennination of the optimal routing pattern. This routing technique inherently incorporates fundamental principles of network maiiagemetit in det

15、enninirig routing patterns. These include: - avoiding occupied circuit groups: - - tiot using overloaded exchanges for transit: in overload circuinstaices, restriction of routing direct connections. Exchanges v., TO203550-93 Data links“. FIGURE 6E.170 4.4.2 Exumple of time-dependent roi&g For each o

16、riginating and terminating exchange pair, a particular route pattern is planned depending on the time of day ,and day of week, see Figure 7E.170. A weekday, for example, can be divided into different time periods, with each the period resulting in different route patterns being defined to route traf

17、fic streams between the same pair of exchanges. This type of routing takes advantge of idle circuit capacity in other possible routes between the originatiiig and terminating exchanges which may exist due to non-coincident busy periods. Crankback may be utilized to identify dowristrenm blocking on t

18、he second link of each two-link alternative path. - C AB, ACB, AD0 6 Recommendation E.170 (10192) T0203560-93 FIGW 7E.170 4.4.3 Example of event-dependent routing Choice 1 2 In a fully connected network, calls between each originating and terminating exchange pair try the direct route with a two-lin

19、k alternative path selected dynamically. Whilst calls are successfully routed on a two-link path, that alternative will be retained. Otherwise a new two-link alternative path will be selected. This updating, for example, could be at r,andom or weighted by the success of previous calls. A to B route

20、pattern Current After cai1 failure AB AB AEB ACB This type of routing scheme routes traffic away from congested links by retaining routing choices where calls are successful. It is simple, adapts quickly to chcanging traffic patterns and requires only local information. i 5 n History First published in 1988 (Blue Book). Revised in 1992. ANNEX A (to Recommendation E. 170) Alphabetical list of abbreviations used in this Recommendation AAR Autoinatic alternative routing ARR Automatic rerouting ISC Iiiteniutioaal switching centre SPC Stored program controlled 8 Recommendation E.170 (10/92)

copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
备案/许可证编号:苏ICP备17064731号-1