6.1. 介绍

Jürgen Freudenberger
{"title":"6.1. 介绍","authors":"Jürgen Freudenberger","doi":"10.1515/9783112472668-013","DOIUrl":null,"url":null,"abstract":"LANs: • Bus or ring topology • Each packet is sent to all terminals. • By evaluation of destination address: Destination terminal reads packet, other terminals ignore it. • No routing function needed; unique addressing scheme is sufficient. LANs interconnected by bridges: • Stupid bridge (promiscuous mode): Copy all packets from on LAN to the other respecting the (possibly different) medium access schemes. • Self-learning bridge: Observe traffic in both LANs, to learn addresses of terminals located on either side. Copy packets only to other LAN, if destination terminal located there or if its location is unknown. Tasks in routing: 1) Gathering information on the network (terminals, switches, and their interconnections). 2) Search a route for a connection or a datagram. 3) Controlling the switching matrix; i.e. execution of the packet forwarding from an incoming line to the correct outgoing line (to the next node towards the packet's destination). Examples: 1) Information about network (graph)","PeriodicalId":354899,"journal":{"name":"Parametric Integer Optimization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"6.1. Introduction\",\"authors\":\"Jürgen Freudenberger\",\"doi\":\"10.1515/9783112472668-013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"LANs: • Bus or ring topology • Each packet is sent to all terminals. • By evaluation of destination address: Destination terminal reads packet, other terminals ignore it. • No routing function needed; unique addressing scheme is sufficient. LANs interconnected by bridges: • Stupid bridge (promiscuous mode): Copy all packets from on LAN to the other respecting the (possibly different) medium access schemes. • Self-learning bridge: Observe traffic in both LANs, to learn addresses of terminals located on either side. Copy packets only to other LAN, if destination terminal located there or if its location is unknown. Tasks in routing: 1) Gathering information on the network (terminals, switches, and their interconnections). 2) Search a route for a connection or a datagram. 3) Controlling the switching matrix; i.e. execution of the packet forwarding from an incoming line to the correct outgoing line (to the next node towards the packet's destination). Examples: 1) Information about network (graph)\",\"PeriodicalId\":354899,\"journal\":{\"name\":\"Parametric Integer Optimization\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parametric Integer Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/9783112472668-013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parametric Integer Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/9783112472668-013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

局域网:•总线或环拓扑•每个数据包发送到所有终端。•目的地址求值:目的终端读取报文,其他终端忽略。•无需路由功能;唯一的寻址方案就足够了。通过网桥连接的局域网:愚蠢网桥(混杂模式):将一个局域网的所有数据包复制到另一个尊重(可能不同的)介质访问方案的局域网。•自学习网桥:观察两个局域网的流量,学习两端终端的地址。如果目的终端位于另一个局域网,或者目的终端的位置未知,则只将数据包复制到另一个局域网。路由的任务:1)收集网络信息(终端、交换机及其互联)。2)为连接或数据报搜索路由。3)控制切换矩阵;即执行数据包从入线转发到正确的出线(到数据包目的地的下一个节点)。示例:1)网络信息(图)
本文章由计算机程序翻译,如有差异,请以英文原文为准。
6.1. Introduction
LANs: • Bus or ring topology • Each packet is sent to all terminals. • By evaluation of destination address: Destination terminal reads packet, other terminals ignore it. • No routing function needed; unique addressing scheme is sufficient. LANs interconnected by bridges: • Stupid bridge (promiscuous mode): Copy all packets from on LAN to the other respecting the (possibly different) medium access schemes. • Self-learning bridge: Observe traffic in both LANs, to learn addresses of terminals located on either side. Copy packets only to other LAN, if destination terminal located there or if its location is unknown. Tasks in routing: 1) Gathering information on the network (terminals, switches, and their interconnections). 2) Search a route for a connection or a datagram. 3) Controlling the switching matrix; i.e. execution of the packet forwarding from an incoming line to the correct outgoing line (to the next node towards the packet's destination). Examples: 1) Information about network (graph)
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信