基于“块尺寸”的IP寻址、子网划分及路由汇聚的快速算法  

A Block Size-Based Fast Algorithm for IP Addressing, Subnetting and Route Aggregation

作　　者：刘文[1] 闫东升[1] 

机构地区：[1]广东警官学院计算机系,广州510230

出　　处：《现代计算机》2013年第17期11-16,共6页Modern Computer

摘　　要：在《计算机网络》教学与工作实践中,对于IPv4,传统教学主要采用逻辑与运算、进制转换的方法解决IP寻址、IP规划及子网汇聚等问题,过程繁琐且不直观,效率低下。针对这一问题,通过分析关键字节的"块尺寸",提出基于"块尺寸"的IP寻址、子网划分及路由汇聚的的快速算法,直观、快捷地解决IP地址相关问题。In the teaching and practice of computer networking, as far as IPv4 is concerned, such conventional means as logic and operation, and system conversion are adopted for the purposes of IP addressing, IP planning and subnet aggregation, which means complexity, lack of visual effect and low efficiency. To solve this problem, draws on analysis of the block size of key bytes, proposes a block size-based fast algorithm for IP addressing, subnetting and route aggregation, providing a visual and efficient solution to IP-related problems.

关 键 词：块尺寸 掩码 关键字节 IP规划 子网划分 路由汇聚 

分 类 号：TP393-4[自动化与计算机技术—计算机应用技术] G642[自动化与计算机技术—计算机科学与技术]