Proceedings 15th International Conference on Information Networking最新文献_第4页

Fast update of forwarding tables in Internet router using AS numbers 利用AS号快速更新Internet路由器中的转发表

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905449

Heo-Seong. Lee, Seokjae Ha, Yanghee Choi

引用次数: 2

Performance study of AAL2 protocol for low-bit-rate multimedia services 低比特率多媒体业务中AAL2协议的性能研究

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905578

Jean-Lien C. Wu, Chi-Hong Huang, R. Sheu

引用次数: 7

Constraint-based LSP setup by message reversing of CR-LDP CR-LDP消息反转建立基于约束的LSP

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905622

Byeongsik Kim, Woojik Chun, Jaeho Yoo

引用次数: 5

Guaranteed versus controlled load: implications for service subscribers and providers in RSVP networks 保证负载与控制负载:RSVP网络中服务订阅者和提供者的含义

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905469

Y. Lai, Ying-Dar Lin, Chih-Yu Chen, Huan-Yun Wey

{"title":"Guaranteed versus controlled load: implications for service subscribers and providers in RSVP networks","authors":"Y. Lai, Ying-Dar Lin, Chih-Yu Chen, Huan-Yun Wey","doi":"10.1109/ICOIN.2001.905469","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905469","url":null,"abstract":"The IETF Integrated Service Working Group has specified two service classes: guaranteed quality (GQ) service and controlled load (CL) service. What concerns service subscribers and providers most is the cost of these two services and their performance. For service subscribers, the question is which application deserves which service. For service providers, the question is how to charge their users reasonably to obtain the maximum revenue and what kinds of mechanisms can achieve better resource utilization. We try to answer the above questions under conservative and well-performed admission control schemes, respectively. Simulation results based on the common models of traffic, signaling protocol, policer, classifier, and packet scheduler are presented. When the traffic burstiness increases, the cost difference between GQ and CL increases significantly but the average performances do not have much difference. Thus, subscribers are suggested to use the CL service when the traffic burstiness is high and the delay bound is not critical, and vice versa. For providers, a well-performed admission control scheme is important, especially when the traffic burstiness is high, in limiting the cost difference between GQ and CL. It is observed that, with well-performed admission control, the cost difference can be reduced from 20 times to 1.41 times and 8 times to 1.14 times for bursty and less-bursty traffic, respectively.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040731","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}

引用次数: 2

The A/sup 3/ fault-tolerant framework for distributed computing with multiple mobile agents over sizeable networks A/sup 3/容错框架，用于大规模网络上具有多个移动代理的分布式计算

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905451

Allan K. Y. Wong, Wilfred W. K. Lin

{"title":"The A/sup 3/ fault-tolerant framework for distributed computing with multiple mobile agents over sizeable networks","authors":"Allan K. Y. Wong, Wilfred W. K. Lin","doi":"10.1109/ICOIN.2001.905451","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905451","url":null,"abstract":"We are proposing the A/sup 3/ fault-tolerant framework for distributed computing with multiple mobile agents over sizeable networks. A/sup 3/ fault tolerance includes three objectives, namely, access security, agent persistence, and avoidance of long queuing time. The last two objectives are achieved by agent mobility. The prototype for this framework was verified over the Internet, a typical sizeable network, with selected sites that include part of our university's intranet and other local Internet sites, as well as the stable Java-based Aglets mobile-agent platform. Results from the verification exercise with this prototype indicate unanimously that the A/sup 3/ framework is indeed a fault-tolerant solution for distributed computing with multiple mobile agents over sizeable networks. Access security is achieved by formation of communes, namely, villages and public intranets. These communes protect themselves by denying accesses by non-members to the shared communal resources. The smallest commune is a village, and different villages are interconnected automatically by mediators or connectors into a larger commune known as the public intranet, which has a different connotation from the conventional one that is formed for institutional privacy and integrity. Agent mobility for achieving agent persistence and avoidance of long queuing time depends on the instantaneous values of the migration indices, which are computed from the specific sets of run-time parameters.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917529","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}

引用次数: 1

Design of gateway system between different signalling protocols of the multimedia session on the Internet Internet上多媒体会话不同信令协议之间的网关系统设计

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905443

K. Takei, K. Okamura, K. Araki

引用次数: 4

A study of AF and EF services interaction AF与EF服务交互研究

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905470

T. Yang, Zhao Chen, D. Makrakis, A. Hafid

引用次数: 2

Graphical techniques in intrusion detection systems 入侵检测系统中的图形技术

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905436

Boaz Gelbord

{"title":"Graphical techniques in intrusion detection systems","authors":"Boaz Gelbord","doi":"10.1109/ICOIN.2001.905436","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905436","url":null,"abstract":"As coordinated attacks on networks become more frequent, the study of systems that can identify unlawful attempts to penetrate a network, or so called intrusion detection systems (IDS), has become increasingly popular. IDS traditionally suffer from an inability to detect an attack that is built from a sequence of valid network activity. For this reason it is important to develop a system capable of analyzing the global nature of the network activity. One such system is GrIDS-a graph based intrusion detection system for large networks, being developed at the University of California, Davis, California. This system constructs graphs based on the network activity and then detects attacks based on an analysis of the characteristics of these graphs. One of the bottlenecks in this process is the inability to efficiently compare characteristics of very large networks. This often becomes necessary because the increasing complex nature of network traffic generates graphs with multiple nodes and edges. We propose using a new result on subgraph isomorphism due to Eppstein (see Journal of Graph Algorithms and Applications, vol.3, no.3, p.1-27, 1999) to maximize the efficiency of this analysis. This provides the IDS with the ability to analyze traffic on a broader level and thus increases the overall performance of the system.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130943738","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}

引用次数: 11

Design of a real-time interactive tele-exercise classroom for computer exercises over a Gigabit Network 基于千兆网络的计算机实时交互式远程练习教室设计

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905564

A. He, Zixue Cheng, Tongjun Huang, Ryouhei Nakatani, Yuichi Amadatsu, A. Koyama, Yue Zhao, S. Noguchi

引用次数: 9

The performance of QoS-aware IP multicast routing protocols qos感知IP组播路由协议的性能

Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905426

Chih-Jen Tseng, Chyouhwa Chen

引用次数: 6