{"title":"Enhancing the fairness of TCP over Internet using an improved hierarchical packet fair queueing scheme","authors":"H. Chiou, Sheng-Der Chin, Z. Tsai","doi":"10.1109/ICON.2000.875843","DOIUrl":"https://doi.org/10.1109/ICON.2000.875843","url":null,"abstract":"We proposed an improved hierarchical packet pair queueing (H-PFQ) mechanism, using ACK Spacing, for effective bandwidth management of TCP traffic over ATM networks. According to the pre-determined bandwidth sharing and the class hierarchy of all TCP sessions, we design on algorithm to calculate the required time intervals between consecutive ACK packets of each TCP session to avoid packet drops due to buffer overflow. We demonstrated via computer simulations that the proposed improvement techniques may result in much better performance than the original H-PFQ mechanism used in the forward direction in the sense that not only the effective throughput of the bottleneck link is improved but also the fairness among TCP sessions can be maintained.","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":"115490086","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":"Resource reservation and packet scheduling for prioritized delay-bounded multicast","authors":"L. Lin, M. Liu, Lih-Chyau Wuu","doi":"10.1109/ICON.2000.875811","DOIUrl":"https://doi.org/10.1109/ICON.2000.875811","url":null,"abstract":"A resource reservation algorithm and a packet scheduling algorithm for the prioritized delay-bounded problem are presented. The basic notion is to employ RSVP reservation messages to establish the multicast tree and reserve bandwidth en route. Routing RSVP messages with the assistance of the priority and delay information provided by receivers is intended to optimize the resource utilization of the network. As the tree gradually builds up, the latest departure time at each node is estimated using the delay associated with the reserved bandwidth. The latest departure time is used to compute the timestamp for packets that arrives at the node, which is in turn used by the the scheduling algorithm for scheduling the packets. Fairness is achieved by monitoring the bandwidth shared after each packet is sent out, instead of tracking fairness before a packet can be served. This approach abstains from sorting the backlogged connections and hence reduces to constant scheduling time complexity.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"182 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120866901","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":"Management solutions for WDM networking","authors":"Jorge Tellez, T. B. Meriem","doi":"10.1109/ICON.2000.875778","DOIUrl":"https://doi.org/10.1109/ICON.2000.875778","url":null,"abstract":"This paper proposes network management solutions for wavelength division multiplexing (WDM) networking. These solutions start from the specification following the open distributed processing (ODP) to the implementation using the latest management technologies. Our development cycle began with the model design and specification, then it continued with the creation of a simulation platform, and finally ended with the model implementation. The most relevant standards such as the telecommunications management network (TMN), the simple network management protocol (SNMP) were considered, and also new technologies like the common object request broker architecture (CORBA) and the extended markup language (XML). To implement the model we developed a Java based platform able to simulate different WDM network topologies and equipment. The platform provides configuration protection and performance management applications including event and alarm management. The platform also implements CORBA, mobile agents and XML that enriches and opens the management interfaces towards an open and standardized Web management.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"38 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":"127224697","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}
J. Chan, B. Landfeldt, A. Seneviratne, P. Sookavatana
{"title":"Integrating mobility prediction and resource pre-allocation into a home-proxy based wireless Internet framework","authors":"J. Chan, B. Landfeldt, A. Seneviratne, P. Sookavatana","doi":"10.1109/ICON.2000.875763","DOIUrl":"https://doi.org/10.1109/ICON.2000.875763","url":null,"abstract":"This paper provides a novel home-proxy based framework which integrates the mobility management and QoS management techniques that have been adopted in the Internet environment. It then combines a mobility prediction and resource pre-allocation scheme with the above home-proxy based framework to provide an efficient mobility management environment capable of supporting real-time services. The viability and efficiency of the scheme is demonstrated through a simplistic analysis.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"13 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":"123692434","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":"Bottleneck branch marking for noise consolidation in multicast networks","authors":"J. Ros, W. Tsai, Mahadeven Iyer","doi":"10.1109/ICON.2000.875769","DOIUrl":"https://doi.org/10.1109/ICON.2000.875769","url":null,"abstract":"The noisy feedback consolidation problem in point-to-multipoint ATM multicast networks is studied. A new algorithm, which keeps track of the M smallest available rates (AR) from the branches at each branching point, is proposed. This algorithm has zero response delay, noise stability (defined in the present paper), and small probability of noise. The probability model assumes no knowledge of the distribution of the available rate from the branches. Both analytical and simulation results demonstrate the superiority of the new algorithm.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"62 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":"114961776","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":"Heterogeneous on-off sources in the bufferless fluid flow model","authors":"Guoqiang Mao, D. Habibi","doi":"10.1109/ICON.2000.875806","DOIUrl":"https://doi.org/10.1109/ICON.2000.875806","url":null,"abstract":"There are several methods to analyze the cell loss in a network: queuing analysis, large deviation approximation and bufferless fluid flow approximation. Bufferless fluid flow approximation is frequently used in the literature for its simplicity. However there is no effective means to investigate the cell loss in the bufferless fluid flow model. In this paper we define the cell loss rate function (CLRF) and suggest it for studying the cell loss of traffic sources in the bufferless fluid flow model. Properties of the CLRF are discussed. These properties enable us to decompose the complex analysis of the aggregation of several traffic sources into the simpler analysis of the individual sources. An important theorem about heterogeneous on-of sources is proved using the CLRF. The applications of the CLRF and the theorem in cell loss analysis and connection admission control are presented. A real-time CAC scheme using on-line measurements is designed. This CAC scheme needs only simple information about traffic sources. Simulation studies are presented which are indicative of good performance of the CAC scheme.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"195 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":"116459676","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":"Scalable and reliable multicast ACK tree construction with the token repository service","authors":"C. Maihofer","doi":"10.1109/ICON.2000.875813","DOIUrl":"https://doi.org/10.1109/ICON.2000.875813","url":null,"abstract":"Reliable multicast is realized in a scalable way by tree based approaches, where the receivers are organized in an ACK tree. Usually, expanding ring search (ERS) is used to create such ACK trees. However ERS has some shortcomings like poor scalability, strong dependency on the multicast routing protocol and the need for bidirectional multicast capable network, which makes it difficult to use ERS as the Internet standard mechanism. In this paper we propose the token repository service (TRS), which is based on a token repository and a modification of ERS. The TRS stores tokens, which represents the right for a joining node to connect to a certain parent node in the ACK tree. Performance evaluations show that the TRS approach has several advantageous compared to ERS, like improved scalability and independence of the routing protocol.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"16 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":"122179530","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}
Y. Chstikapong, H. Cruickshank, Zhili Sun, B. Evans
{"title":"Network architecture and performance evaluation of broadband satellite systems","authors":"Y. Chstikapong, H. Cruickshank, Zhili Sun, B. Evans","doi":"10.1109/ICON.2000.875841","DOIUrl":"https://doi.org/10.1109/ICON.2000.875841","url":null,"abstract":"Summary form only given. Satellites are unique components of communication systems that possess singular properties. Some of these properties breadth of broadcast 'reach', ubiquitous access, low-cost global coverage, large capacity, etc. represent significant advantages. Some others such as propagation delay, and wireless channel quality are disadvantages. For broadband access in particular, satellites offer substantial bandwidth that can support transmission at Gbps rates. At the same time, significant difficulties arise at these rates that stem mainly from the delay and error characteristics of the satellite channel. In a network environment these characteristics impact adversely some of the broadband network protocols from ATM to TCP and the network security. We outline three particular examples of services well suited for broadband satellite systems: asymmetric TCP/IP to support Internet applications via satellite; multicast over satellite; and Web page caching.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"15 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":"121839970","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 MARINER trial platform: a model of a load control system for intelligent networks","authors":"Navinder S. Wathan, T. Curran","doi":"10.1109/ICON.2000.875771","DOIUrl":"https://doi.org/10.1109/ICON.2000.875771","url":null,"abstract":"There has been much interest in increasing the deployment of telecommunication services due to the opportunity to exploit the current developments in network convergence and the inherent advantages offered by the intelligent network. A critical component in ensuring that the performance and reliability of these services meet the expectations of end users is a flexible and efficient load control strategy that takes into account the network-wide view of resource usage demands. The ACTS project MARINER has developed an platform for distributed load control in telecommunications networks and applied it to intelligent networks. This paper demonstrates and evaluates the MARINER load control strategy for intelligent networks by presenting and analysing the results of an exhaustive set of evaluation experiments.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"110 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":"127948254","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":"QoS-based routing methods for multi-hop LEO satellite networks","authors":"A. Jukan, H. Nguyen, G. Franzl","doi":"10.1109/ICON.2000.875821","DOIUrl":"https://doi.org/10.1109/ICON.2000.875821","url":null,"abstract":"We propose QoS-based routing methods for multi-hop LEO satellite networks aiming at minimising the number of link handovers per connection, while at the same time satisfying the QoS requirements. For the representation of the network topology as well as for the minimisation of connection re-routing attempts due to the connectivity changes, a graph-theoretical approach is used, where a new metric for inter-satellite links, called lifetime, is introduced. In addition to a QoS-based routing strategy where the best feasible path is found under multiple constraints, e.g. lifetime and delay, we also propose a distributed QoS-routing strategy, where a choice between a number of selected paths can be made based on particular QoS requirements.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"11 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":"133282544","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}