发布求助
文献互助 智能选刊 最新文献

Proceedings 1997 International Conference on Network Protocols最新文献

筛选
英文 中文
QoS based routing algorithm in integrated services packet networks 综合业务包网络中基于QoS的路由算法
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643711
C. Pornavalai, G. Chakraborty, N. Shiratori
{"title":"QoS based routing algorithm in integrated services packet networks","authors":"C. Pornavalai, G. Chakraborty, N. Shiratori","doi":"10.1109/ICNP.1997.643711","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643711","url":null,"abstract":"In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present the routing algorithm (called \"QoSR/sub BF/\"), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSR/sub BF/ has better performance compared to the existing QoS routing algorithms.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 94
An experimental study of insider attacks for OSPF routing protocol OSPF路由协议内部攻击的实验研究
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643735
B. Vetter, Feiyi Wang, S. F. Wu
{"title":"An experimental study of insider attacks for OSPF routing protocol","authors":"B. Vetter, Feiyi Wang, S. F. Wu","doi":"10.1109/ICNP.1997.643735","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643735","url":null,"abstract":"It is critical to protect the network infrastructure (e.g., network routing and management protocols) against security intrusions, yet dealing with insider attacks are probably one of the most challenging research problems in network security. We study the security threats, especially internal/insider threats, for the standardized routing protocol OSPF. In OSPF, a group of routers collaborate, exchange routing information, and forward packets for each other. If one (and maybe more than one) router is evil or compromised, how can this router damage the whole network? In this paper, we analyze OSPF and identify its strengths and weakness under various insider attacks. Furthermore, to confirm our analysis, we have implemented and experimented one attack, the max sequence number attack, on our OSPF routing testbed. Our attack is very successful against two independently developed router products as it will block routing updates for 60 minutes by simply injecting one bad OSPF protocol data unit.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127810462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 60
Dynamic host routing for production use of developmental networks 用于开发网络的生产使用的动态主机路由
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643732
J. Touch, T. Faber
{"title":"Dynamic host routing for production use of developmental networks","authors":"J. Touch, T. Faber","doi":"10.1109/ICNP.1997.643732","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643732","url":null,"abstract":"Many high-speed networks are in a development stage, compared to established technologies like Ethernet. Use of these networks for production service provides substantial benefits to the developers, e.g., for large-scale testing. However, most users are not tolerant of pre-production network outages, even in exchange for the higher bandwidth these networks afford. This paper describes ISI's experience in deploying such a network, Myricom's Myrinet, for production service. A configuration is described that encourages participation in advanced deployment, and provides dynamic backup to a conventional, production-quality network. Each machine individually and transparently reverts to a stable backup network in the event that the prototype network fails. The system is composed of existing tools, and requires no operating system modifications. Alternate configurations are discussed, and recommendations presented to support such deployment more easily in the future.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A cooperative packet recovery protocol for multicast video 一种用于多播视频的协作包恢复协议
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643726
N. Maxemchuk, K. Padmanabhan, S. Lo
{"title":"A cooperative packet recovery protocol for multicast video","authors":"N. Maxemchuk, K. Padmanabhan, S. Lo","doi":"10.1109/ICNP.1997.643726","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643726","url":null,"abstract":"In this paper we describe a protocol that improves the quality of multicast video or audio transmissions by recovering lost packets. The protocol is applied to a corporate intranet, and measurements indicate that significant improvements in audio/video quality are achieved. A unique characteristic of this protocol is that it can be used on current MBone sessions without changing the operation of the source or receivers. The improvement in quality can be restricted to a subset of the receivers, so that a service provider, that does not necessarily generate content, can use the protocol to improve reception for its own customers. A second unique characteristic is that only a small fraction of the receivers that obtain the benefits of the protocol are active participants. As a result the problems associated with large multicast groups, such as the number of control messages, is reduced. Finally, because of the differences between data and voice or video communications, many of the network parameters that vary between or during connections are changed rather than predicted. This is a much simpler operation.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
A join-the-shortest-queue prefetching protocol for VBR video on demand VBR视频点播的最短队列预取协议
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643693
M. Reisslein, K. Ross
{"title":"A join-the-shortest-queue prefetching protocol for VBR video on demand","authors":"M. Reisslein, K. Ross","doi":"10.1109/ICNP.1997.643693","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643693","url":null,"abstract":"We present a high-performance prefetching protocol for the delivery of prerecorded VBR video from a server across a packet-switched network to a large number of clients. Not only does the protocol give constant perceptual quality and almost 100% link utilization, but it also allows for immediate commencement of the video upon user request and near instantaneous response to pause/resume and temporal jumps. The protocol requires: (1) that each client have a small amount of memory dedicated to the application; (2) that there is one bottleneck shared link between the server and the clients. Our protocol is based on the observation that there are frequent periods of time during which the shared link's bandwidth is under utilized. During these periods the server can prefetch frames from any of the ongoing videos and can send the frames to the buffers in the appropriate clients. The server chooses prefetched frames according to a join-the-shortest-queue policy. We present simulation results of our prefetch policy that are based on MPEG encoded traces.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124750774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Once-and-forall management protocol (OFMP) 一劳永逸的管理协议
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643695
S. Kulkarni, A. Arora
{"title":"Once-and-forall management protocol (OFMP)","authors":"S. Kulkarni, A. Arora","doi":"10.1109/ICNP.1997.643695","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643695","url":null,"abstract":"OFMP is a hierarchical, network management protocol that enables group operations to be executed on the management information bases of all nodes in the group. As long as no faults occur, OFMP ensures that all nodes execute their local operation exactly once in each group operation. If \"immediately-detectable\" faults occur, it ensures masking fault-tolerance; i.e., all non-failed nodes execute their local operation exactly once in each group operation. And, if \"eventually-detectable\" faults occur, it ensures stabilizing fault-tolerance; i.e., it eventually converges to a state from where all non-failed nodes execute their local operation exactly once in each subsequent group operation. Of special note is the ability of OFMP to detect using only a bounded amount of memory whether nodes have executed in same group operation, in a manner that masks immediately-detectable faults and stabilizes from eventually-detectable faults.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126256532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks ATM网络中高速、可扩展、准确的分组公平排队算法实现
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643677
Jon C. R. Bennett, D. C. Stephens, Hui Zhang
{"title":"High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks","authors":"Jon C. R. Bennett, D. C. Stephens, Hui Zhang","doi":"10.1109/ICNP.1997.643677","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643677","url":null,"abstract":"The fluid generalized processor sharing (GPS) algorithm has desirable properties for integrated services networks and many packet fair queueing (PFQ) algorithms have been proposed to approximate GPS. However, there have been few high speed implementations of PFQ algorithms that can support large number of sessions with diverse rate requirements and at the same time maintain all the important properties of GPS. The implementation cost of a PFQ algorithm is determined by two components: (1) computation of the system virtual time function and (2) maintaining the relative ordering of the packets via their timestamps in a priority queue mechanism. While most of the recently proposed PFQ algorithms reduce the complexity of computing the system virtual time function, the complexity of maintaining the priority queue, and therefore the overall complexity of implementing PFQ, is still a function of the number of active sessions. In addition, while reducing the algorithmic or asymptotic complexity has been the focus of most analysis, to run at high speed, it is also important to reduce the complexity of basic operations. In this paper, we develop techniques to reduce both types of complexities. In particular, we present a novel grouping architecture for implementing PFQ with an algorithmic complexity that is a function of the number of distinct rates supported, but independent of the number of sessions in the system.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123028193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 66
Optimal feedback control for ABR service in ATM ATM中ABR业务的最优反馈控制
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643688
P. Narváez, Kai-Yeung Siu
{"title":"Optimal feedback control for ABR service in ATM","authors":"P. Narváez, Kai-Yeung Siu","doi":"10.1109/ICNP.1997.643688","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643688","url":null,"abstract":"The efficient support of data traffic over ATM networks requires congestion control, whose objectives include maximizing throughput, minimizing switch buffer requirement, and attaining a fair bandwidth allocation. With available bit rate (ABR) service in ATM, congestion control is achieved by requiring data sources to adjust their rates based on the feedback from the network. The difficulties in providing effective ABR service are caused by the burstiness of data traffic, the dynamic nature of the available bandwidth, as well as the feedback delay. Using a new design methodology described in our previous paper, we present here a congestion control algorithm that is provably stable and is optimal in the sense that it has the shortest possible transient response time. Moreover, our algorithm achieves fair bandwidth allocation among contending connections and maximizes network throughput. It also delivers good performance for switches that use a FIFO queuing discipline. Essentially, the algorithm implicitly measures the round-trip delay using resource enhancement cells, and establishes an observer (in the control theoretic sense) to control the flow of data in the network. Rigorous analysis as well as simulation results are presented to substantiate our claims.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116799921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Balanced routing 平衡的路由
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643730
J. Cobb, Mohamed G. Gouda
{"title":"Balanced routing","authors":"J. Cobb, Mohamed G. Gouda","doi":"10.1109/ICNP.1997.643730","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643730","url":null,"abstract":"The distance vector routing protocol satisfies the following property. If this protocol is used to route a sequence of data messages from a source to a destination, then these data messages will follow the same shortest-distance path from the source to the destination. In this paper, we show how to modify this protocol, without adding new messages, in order to satisfy the following load balancing property. If the modified protocol is used to route a sequence of data messages from a source to a destination, then these messages will be uniformly distributed over all k-monotonic paths from the source to the destination, i.e., over all paths whose distance to the destination never increases at each hop, and may remain constant in at most k hops. In particular, by choosing k to be zero, the modified protocol distributes the data messages over all shortest-distance paths from the source to the destination.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"36 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116290820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Improving Internet multicast with routing labels 利用路由标签改进Internet组播
Proceedings 1997 International Conference on Network Protocols Pub Date : 1997-10-28 DOI: 10.1109/ICNP.1997.643723
B. Levine, J. Garcia-Luna-Aceves
{"title":"Improving Internet multicast with routing labels","authors":"B. Levine, J. Garcia-Luna-Aceves","doi":"10.1109/ICNP.1997.643723","DOIUrl":"https://doi.org/10.1109/ICNP.1997.643723","url":null,"abstract":"The IP-multicast architecture is extended with addressing information along multicast routing trees that permits more efficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer protocols. The Addressable Internet Multicast (AIM) architecture is introduced that enables sources to restrict the delivery of packets to a subset of the receivers in a multicast group on a per-pocket basis, permits receivers to listen to subsets of sources on a subscription basis, provides nearest-host routing, and allows higher-layer protocols to place packets into application-defined logical streams, so that hosts may direct the multicast routing of packets based on application-defined contexts. In addition, the Reliable Multicast Architecture (RMA) is introduced to support end-to-end reliable multicasting using heterogeneous reliable multicast protocols and providing acknowledgment trees implicitly, thereby eliminating the ACK implosion problem and allowing NAK-avoidance algorithms to work within local groups.","PeriodicalId":102414,"journal":{"name":"Proceedings 1997 International Conference on Network Protocols","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116421662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 119
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书