Min Liu, Zhongcheng Li, Jinglin Shi, E. Dutkiewicz, R. Raad
{"title":"An on-demand QoS routing protocol for mobile ad hoc networks","authors":"Min Liu, Zhongcheng Li, Jinglin Shi, E. Dutkiewicz, R. Raad","doi":"10.1109/ICON.2000.875784","DOIUrl":"https://doi.org/10.1109/ICON.2000.875784","url":null,"abstract":"We propose a on-demand bandwidth routing protocol for QoS (quality of service) support in mobile ad hoc networks. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone mobile ad hoc network for real-time applications. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real time applications. In addition, it enables more efficient call admission control. In case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit service to the mobile network with possible renegotiation of QoS parameters at the gateway. Simulation results suggest distinct performance advantages of our protocol calculating the bandwidth information. It is particularly useful in call admission control. Furthermore, \"on-demand\" routing enhances the performance in the mobile environment because the source can keep more connectivity to a receiver in the path-finding duration. Simulation experiments show this improvement.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407360","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}
{"title":"The study of applying the ODP/UML for the VPN service management information modeling","authors":"Qiu Xuesong, Lei Youxun, Meng Luoming","doi":"10.1109/ICON.2000.875836","DOIUrl":"https://doi.org/10.1109/ICON.2000.875836","url":null,"abstract":"The shortage of the current management information modeling methods in the network/service management is analyzed and the advantage of the ODP/UML modeling method is given. The applying the ODP/UML for management information modeling in VPN service management is studied in detail.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111950","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}
{"title":"Handover schemes for QoS guarantees in LEO-satellite ATM networks","authors":"H. Nguyen, J. Schuringa, H. R. As","doi":"10.1109/ICON.2000.875820","DOIUrl":"https://doi.org/10.1109/ICON.2000.875820","url":null,"abstract":"We present the effects of mobility on QoS provisioning in multi-hop low Earth orbit (LEO) satellite ATM networks and the necessity of inter-satellite handover. Based on the LEO-satellite ATM network characteristics, different feasible inter-satellite handover schemes are proposed regarding the QoS handover requirements. A combination of the schemes is suggested as an efficient handover management scheme for LEO-satellite ATM networks. In addition, handover protocols are described in terms of signaling flows and control sequences. Finally, several performance metrics are evaluated by simulation of the studied traffic and system configuration.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127174265","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}
{"title":"Fault diagnosis and recovery scheme for Web server using case-based reasoning","authors":"Jungmee Yun, Seongjin Ahn, Jin-Wook Chung","doi":"10.1109/ICON.2000.875846","DOIUrl":"https://doi.org/10.1109/ICON.2000.875846","url":null,"abstract":"This paper proposes the fault items incurred Web server management and the rules for fault diagnosis and recovery scheme by INBANCA technology. We have defined the fault items which are daemon process fault, server overload, network interface fault, configuration and performance fault and formulated system-level fault diagnosis production rule and service-level fault diagnosis rule by translating expertise into active network for management. Also, an adaptive recovery mechanism for Web server is applied to defining the recovery rules and constructing the case library for case-based Web server fault recovery.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131629504","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}
{"title":"TCP-like flow control algorithm for real-time applications","authors":"Seung-Gu Na, Jong-Suk Ahn","doi":"10.1109/ICON.2000.875775","DOIUrl":"https://doi.org/10.1109/ICON.2000.875775","url":null,"abstract":"This paper proposes an efficient flow control algorithm for RTP/RTCP which has been employed as a transport layer protocol for real-time applications over the Internet. As the Internet becomes a common transport vehicle for various applications, some of them require a new flow control different from TCP since they do not need the expensive error recovery inseparable from the current TCP. The new flow control algorithm for real-time applications should efficiently utilize network bandwidth and also minimize the delay jitter while not hampering the performance of the existing TCP applications. This paper introduces a flow control algorithm which dynamically adjusts the sending rate similarly to TCP based on the network status evaluated by two network parameters; packet loss and round trip time (RTT) reported by RTP/RTCP. For the reduction of delay jitters, the algorithm tries to maintain RTTs periodically reported by RTCP within a predetermined range by either additively increasing or multiplicatively decreasing the sending rate as much aggressively as TCP. For evaluation, we compare the behavior of our algorithm to that of RAP, one of representative flow control algorithms for real-time applications. The simulation experiments show that our algorithm achieves the same degree of performance for TCP as RAP but without overloading the network with ack packets like RAP.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415535","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}
M. C. Chia, D. Hunter, Ivan Andonovic, P. Ball, I. Wright
{"title":"Optical packet switches: a comparison of designs","authors":"M. C. Chia, D. Hunter, Ivan Andonovic, P. Ball, I. Wright","doi":"10.1109/ICON.2000.875815","DOIUrl":"https://doi.org/10.1109/ICON.2000.875815","url":null,"abstract":"Many optical packet switches have been proposed to facilitate the widespread deployment of broadband integrated services digital networks. Although optical packet switches offer data rate and format transparency, and high switching speed, their performance strongly depends on optical device technology. This paper discusses the fundamental limitations of a selected number of guided wave optical packet switches; a comparison in terms of the number of components, buffering capability, control complexity and switching technology is made. The main limitation of these optical packet switches is optical splitting/combining loss. One approach to reduce this loss is the use of arrayed-waveguide gratings (AWGs). An AWG having a crosstalk level as low as -30 dB can be used as a demultiplexer, a multiplexer and an interconnect. An AWG is proposed as the core of an optical packet switch.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116165065","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}
{"title":"Design of the packet forwarding architecture of the ATM based MPLS edge node","authors":"Jaeho You, Sun-Moo Kang, Woojik Chun","doi":"10.1109/ICON.2000.875826","DOIUrl":"https://doi.org/10.1109/ICON.2000.875826","url":null,"abstract":"In multi-protocol label switching (MPLS) domains, the speed-up by eliminating the IP header lookup and the support of QoS are basic roles of label switch routers (LSRs). Core LSRs inside MPLS network forward packets at the network-specific link layer. However, edge LSRs on the MPLS network boundary would forward packets at the link layer and at the network layer. The support of both high-speed forwarding and the guarantee of QoS at the edge LSRs are very important. This paper proposes the packet forwarding architecture of the ATM-label edge router (ATM-LER), which is an MPLS edge LSR on the public ATM network boundary, to support the high-speed forwarding. The forwarding control procedures and the related works of the ATM-LER are also discussed.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122967452","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}
{"title":"GPRS-features and packet random access channel performance analysis","authors":"A. Gyasi-Agyei, S. J. Halme, M. J. Sarker","doi":"10.1109/ICON.2000.875762","DOIUrl":"https://doi.org/10.1109/ICON.2000.875762","url":null,"abstract":"Mobile data communications (Internet-mobile communication convergence) seems natural as the popularity of both technologies increase. Our purpose in this article was twofold. First, we reviewed GSM, HSCSD (high speed circuit switched data), GPRS and EDGE (enhanced data rate for GSM evolution). Second, the performance of the packet random access channel (PRACH) was analyzed with respect to quality of service parameters: network access delay, throughput, and failure probability. We derived the overall GPRS traffic channel utilization as a function of the throughput and channel holding time. EDGE introduction will decrease the holding time of GPRS terminals due to multilevel encoding and result in higher throughput. Thus, in order to maintain GPRS channel efficiency, PRACH efficiency must be boosted. Thus packet-capturing is introduced to offset access collisions on (P)RACH and increase its efficiency. We noted that the capture effect decreases with access throughput contrary to access delay and failure rate. These QoS parameters are indicative of network performance, hence crucial for novel network planning.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"493 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580347","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}
{"title":"Policy based access control framework for large networks","authors":"Haixin Duan, Jianping Wu, Li Xing","doi":"10.1109/ICON.2000.875800","DOIUrl":"https://doi.org/10.1109/ICON.2000.875800","url":null,"abstract":"This paper focus on the issues of management and throughput of firewalls (or screening routers) applied in transit networks. On the one hand, manual configuration of a large amount of firewalls distributed in many access points can not meet the global security requirements in the open and dynamic environment. On the other hand, the ordinal lookup of filtering rules in each individual firewall results in great decrease of throughput. Aimed at a typical transit network and its security policy requirements, a policy-based access control framework (PACF) is proposed. This framework is based on three levels of abstract access control policy: organizational access control policy (OACP), global access control policy (GACP) and local access control policy (LACP). The GACP, which comes from the results of IDSes and search engines according to OACP, is automatically and dynamically distributed to firewalls as LACPs. Each LACP is then enforced by an individual firewall. Some key algorithms for distribution of GACP and enforcement of LACP are described. A hash-based algorithm is proposed, for lookup of filtering rules in LACP. Under an environment with policy requirements described in this paper the new algorithm reduces the time complexity of lookup from O(N) of the traditional sequential algorithm to O(1), which therefore increases largely the throughput of firewalls.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128792162","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}
{"title":"Traffic measurement-based admission control using rate envelope in ATM networks","authors":"F. Zhao, M. Hanawa, M. Takahara","doi":"10.1109/ICON.2000.875793","DOIUrl":"https://doi.org/10.1109/ICON.2000.875793","url":null,"abstract":"This paper reports a traffic measurement-based bandwidth allocation mechanism using the minimum envelope rate (MER) technique in ATM networks. The rate envelope technique simplifies the bandwidth allocation for higher bursty sources and can improve substantially the utilization of network resources. In the proposed approach, we measure the MER and the average arrival rate using traffic observations with a slide time window, and then a virtual source of which the peak rate and average rate are equal to the measured MER and the measured average rate is composed. From the virtual source, we can get all of required parameters for bandwidth allocation and admission control. The proposed admission control approach based on the minimum envelope rate technique is confirmed by various computer simulations. We demonstrate that the minimum envelope rate technique can be applied to the real time admission control. Consequently, it becomes clear that the proposed scheme shows high efficiency for higher bursty sources.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"116 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134128459","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}