By Topic

Networks, 1999. (ICON '99) Proceedings. IEEE International Conference on

Date 28 Sept.-1 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 53
  • A client caching scheme for interactive video-on-demand

    Publication Year: 1999 , Page(s): 391 - 397
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (72 KB)  

    Video-on-demand trials at Monash University have shown that video in educational applications is used in a highly interactive fashion and that during a single session a significant proportion of video is examined more than once. We propose a caching scheme where video, once retrieved from the server, is cached locally on the client for the remainder of the session. We use statistics of reuse gathered during our trials to show that caching could result in bandwidth savings of up to 36%. In designing cache management schemes, an understanding of the nature of reuse is useful. We obtain this through an analysis of interactive jumps. We show that the distance of interactive jumps and the time between them are both log-normally distributed, and not, as has commonly been assumed, exponentially distributed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Provision of data (IP) services in third generation mobile networks

    Publication Year: 1999 , Page(s): 165 - 171
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB)  

    Third-generation mobile networks will enable services which are regularly available through fixed networks (WWW, Internet) to be offered into the mobile domain. The impact IP data services may have on the base station is, at this time, unclear. Coupled with this is a particularly poor performance characteristic achieved with TCP over (lossy) wireless links. Starting with results from IMT-2000 proposals, this paper makes a preliminary investigation into these issues, indicating that placement of a router in the base station controller is feasible, in terms of both capacity and additional system complexity. Results also indicate that the relationship between goodput and base station capacity (number of users) shows a significant reduction in efficient use of routing capacity, even though the radio resource may be fully occupied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fair queueing algorithm for multiple-streams delay-bounded services

    Publication Year: 1999 , Page(s): 234 - 241
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (912 KB)  

    In this paper, we propose a resource reservation and scheduling algorithm which guarantees the end-to-end delay constraints for the processing of single-source multiple-stream delivery. User applications initiate the requests by specifying the tolerable delay and priorities reflecting the preference for each stream. In order to provide efficient flow scheduling subject to the fairness and delay constraints, we consider a mechanism in which the resource reservation and scheduling are integrated into a framework so that the queueing delay can be taken into the consideration at the reservation phase. Packets are scheduled in a packet-by-packet base, the fairness characteristics in each scheduler is approximated by emulating the max-min fair discipline in the corresponding GPS server. Instead of tracking the fair utilization before the packet can be served in WFQ, the bandwidth share is monitored after the packet is sent. This approach can significantly reduce the computational complexity resulting from WFQ while maintaining the long-term fairness. The end-to-end delay is derived from the latency in each link and the worst-case waiting time at each scheduler. Examples are illustrated to show the performance, the results lead to high satisfaction in terms of delay and fairness. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random early marking: an optimisation approach to Internet congestion control

    Publication Year: 1999 , Page(s): 67 - 74
    Cited by:  Papers (5)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (468 KB)  

    In this paper we present an optimisation approach to congestion flow control. The initial context of this approach was as a rate-based flow control in ATM networks. We describe techniques that enable us to implement this flow control in an explicit congestion notification-capable TCP/IP network. These techniques require only minimal changes to existing TCP host behaviour and RED active queue management routers. We call the collection of techniques random early marking (REM). We present the results of a simulation study that looks at the dynamic behaviour of REM and compares it to that of TCP-ECN with RED and drop-tail queue management. We also show how REM can be used to provide differential service between different users. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of Web browsing over hybrid fiber coaxial broad-band networks

    Publication Year: 1999 , Page(s): 372 - 382
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (180 KB)  

    The phenomenal growth of the Internet in recent years has motivated a number of cable operators to upgrade their wide installed base of cable networks to offer broadband data services to residential subscribers. This enables them to access a variety of local community content as well as the Internet. Current state-of-the-art cable modems implement sophisticated modulation demodulation techniques that offer services with several-fold increase in access speeds from homes compared to conventional dial-up access. But experiences show that the performance of the Web browsing may be severely hampered if the overall network configuration and its connectivity to the external world is not well-studied, e.g., connection to the USA backbone. This paper investigates the performance of Web browsing in such an environment by taking a case study of the Singapore-ONE broadband network. We present a simple model for estimating the bandwidth of overseas links for a large user base by considering HTTP as the prime application. We later analyze the performance of the HTTP protocol over such a network and propose simple modifications including changes in access subnet for better performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive transmission parameters optimisation in wireless multi-access communication

    Publication Year: 1999 , Page(s): 91 - 95
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (64 KB)  

    The purpose of this paper is to optimize a wireless link which uses forward error correction (FEC), modulation gain, and for data services, automatic repeat request (ARQ) protocols, with the aim to minimize the bandwidth required. Simulations are used to derive bit error rate values for a range of modulation and FEC code rate parameters. These parameters are optimized to maximize efficiency. We demonstrate that optimal adaptive modulation provides significant efficiency gains. We actually question the use of FEC for a wide (practical) range of signal-to-noise ratios, and demonstrate that in the case of data traffic, optimal adaptive modulation together with ARQ retransmission, in the absence of FEC, provides better efficiency, and/or QoS, than the same system with FEC. Similar results are achieved also for video, where ARQ is not used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network calculus and service curve scheduling in heterogeneous networks

    Publication Year: 1999 , Page(s): 250 - 254
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (80 KB)  

    We describe a generalised framework for analysing the delay and backlog bounds in lossless packet networks using the techniques of network calculus. We outline network calculus in terms of matrix operators acting on functions, and couple these operations with the concept of service-curve scheduling. We describe how this combined framework is used to determine delay bounds imposed on packets as they traverse example networks, and compare the results with standard FIFO and virtual clock scheduling algorithms. This comparison highlights the QoS advantages to be gained from the use of network calculus and service-curve scheduling. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel scheme of transporting pre-stored MPEG video in ATM networks

    Publication Year: 1999 , Page(s): 398 - 405
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (200 KB)  

    This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning in the transporting of pre-stored MPEG video data from a source to a playback destination. This is one of the most important issues to support video-on-demand service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real-life MPEG video traces. The obtained results have shown its significant performance improvement on the required capacity of playback buffer, the start-up playback delay, and the network multiplexing gain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of per-flow and aggregate QoS in scalable QoS networks

    Publication Year: 1999 , Page(s): 289 - 294
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (168 KB)  

    The future Internet will support a large variety of services whose QoS requirements may vary widely. In order to provide scalable quality of service traffic aggregation may be necessary. We examine several approaches to providing scalable QoS services which includes soft QoS with relative performance guarantees, and hard performance guarantees signaled by RSVP over an aggregated cell switched core. In these approaches QoS is based on aggregate traffic. The question then arises as to what level of QoS is perceived by individual flows within the aggregate. This has an important implication on QoS guarantees which the network can make to individual users. To provide answers to the above question we analyse per-flow and aggregate QoS in an ATM virtual path (VP) which is used as an example of a cut-through handling IP flows. Using cell loss as a measure of QoS, our analysis allows us to investigate the impact of the parameters of individual flows on per-flow QoS. We then compare per-flow QoS against the QoS experienced by the aggregate flow in the VP. Based on numerical tests we find that cell loss experienced by individual flows may be very different from cell loss experienced by the aggregate flow. Thus if aggregate cell loss is used as a QoS constraint in dimensioning of VP this may lead to unfair treatment of flows and hence to potential user dissatisfaction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical user mobility prediction algorithm for supporting adaptive QoS in wireless networks

    Publication Year: 1999 , Page(s): 104 - 111
    Cited by:  Papers (15)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB)  

    A number of user mobility prediction algorithms have been reported in the literature. These may be used for resource reservation and service pre-configuration/adaptation in future wireless networks to provide QoS guarantees. However, our analysis of some of these techniques using measured cellular performance shows that these models do not accurately represent the mobility patterns of users. As a result, resource reservation schemes need to reserve excessive resources, and the pre-configuration/adaptation does not work well. To overcome this, we propose an adaptive user mobility prediction algorithm that limits the reservation and configuration procedure to a subset of cells around the user. The viability and effectiveness of the proposed scheme is then demonstrated through a simulation based on measured data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An intelligent buffer management approach for GFR services in IP/ATM internetworks

    Publication Year: 1999 , Page(s): 156 - 162
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (180 KB)  

    In ATM networks, the guaranteed frame rate (GFR) service has been designed to accommodate non-real-time applications, such as TCP/IP-based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this article, we propose a buffering strategy called intelligent fair buffer allocation (IFBA) that provides MCR (minimum cell rate) guarantees and fair sharing to GFR VC (virtual circuits). From the simulation results, we demonstrate that IFBA fulfils the requirements of GFR service as well as improves the TCP throughput using FIFO scheduling. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data spread: a novel authentication and security technique

    Publication Year: 1999 , Page(s): 335 - 339
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (48 KB)  

    This paper describes an authentication and security protocol called data spread for use on the Internet. The protocol applies address space diversity to outgoing messages, and when combined with reasonable (but not necessarily strong) encryption techniques, offers fast, secure and authentic-able information exchange between communicating entities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter adaptive congestion control of ABR traffic in ATM networks

    Publication Year: 1999 , Page(s): 227 - 233
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (108 KB)  

    Congestion control is an important issue in resource management of ATM networks. It is therefore necessary to develop stable rate-based ABR congestion control schemes that minimise or prevent cell loss, require small buffer sizes and minimise end to end delay. Although there are some excellent congestion control methods reported in the literature that use formal control theory, the issues of ensuring minimum cell rate (MCR) and guaranteeing global asymptotic stability have not been handled successfully. In a recent paper, we proposed a method to alleviate these problems. However, the development of the controller and the proof of the stability was based on an approximate model of the system. When the cell rate within a time slot is not uniform, this model does not hold true. In this paper, we propose a parameter adaptive congestion avoidance method that uses a one step ahead predictor. It has been shown analytically and by simulation that the proposed method performs better than our former method while guaranteeing global asymptotic stability. However, as the controller is adaptive, the computational burden is increased. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User plane architecture of 3rd generation mobile telecommunication network

    Publication Year: 1999 , Page(s): 270 - 278
    Cited by:  Patents (22)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (136 KB)  

    This paper presents modifications that are proposed to the 3rd-generation packet data network in 3GPP (3rd Generation Partnership Project). The scope of the paper is the user plane of the packet data network. The UMTS (Universal Mobile Telecommunications System) network architecture is based on the GPRS (General Packet Radio Service). In this paper, the proposed UMTS packet data network is presented and compared to the GPRS. In the comparison, modifications are highlighted and tasks of different protocols and their differences are evaluated. The comparison of protocols concentrates on the user plane or parts that affect to the user plane data transfer. A comparison of the advantages and drawbacks is made. Finally, the paper concludes the network modifications and changes on functional split. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive admission control and scheduling for wireless packet communication

    Publication Year: 1999 , Page(s): 178 - 185
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    This paper describes a new admission control and scheduling scheme that enables adaptive control of resource usage. The new scheme has been designed for wireless networks that put high demands on resource reservation due to their inherent lack of sufficient bandwidth, high error probability and frequent resource overload due to the users' mobility. The scheme deploys bandwidth adaptation on the application level and combines these methods with admission control and packet scheduling on the network layer by taking into account packet error rates measured on the link layer. The scheme makes use of the so-called "enriched packet streams" that allow for congestion prediction and forms the basis of delay-sensitive bandwidth adaptation at network nodes. Measurements received from simulation studies show up the benefits gained from the proposed concepts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of polling strategy on capacity of 802.11 based wireless multimedia LANs

    Publication Year: 1999 , Page(s): 96 - 103
    Cited by:  Papers (11)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (116 KB)  

    Wireless local area networks are a viable technology to support multimedia traffic. One of the prominent wireless local area network standards being adopted as a mature technology is the IEEE 802.11 standard. In wireless multimedia networks, mobile stations will be capable of generating a heterogeneous traffic mix and therefore it is crucial to devise an efficient bandwidth allocation scheme to satisfy the quality of service requirements of each traffic class. In this paper we present a distributed fair queuing scheme which is compatible with the 802.11 standard and can manage bandwidth allocation for delay-sensitive traffic. The performance of the proposed scheme is evaluated by simulation, showing that a distributed version of deficit round robin outperforms the standard round robin service discipline from a capacity viewpoint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A call handling capacity of base station controller group for mobile originated calls in the CDMA mobile system

    Publication Year: 1999 , Page(s): 279 - 285
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (84 KB)  

    In this paper, we first describe the architecture of the base station (BS) in the CDMA mobile system (CMS) and then model one base station controller group (BSCG) as a queueing network. By using an analytic method for the given queueing network model, we evaluate the mean waiting time at each transmission node in the packet networks between the traffic channel element (TCE) in the base station transceiver subsystem (BTS) and selector in the base station controller (BSC). As the transmission technology for the traffic data from TCE to BSC during the call conversation time, we consider two kinds of transmission schemes such as the frame non-staggering scheme and the frame staggering scheme. Then, we evaluate the delay time of traffic data from the TCE to the selector and the quality degradation probability by simulation. Based on these results, we present the call handling capacity of one BSC group for mobile-originated calls in the CMS (CDMA mobile system). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of the M/Pareto process to modeling broadband traffic streams

    Publication Year: 1999 , Page(s): 53 - 58
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (112 KB)  

    In this paper we examine the usefulness of the M/Pareto process as a model for broadband traffic. We show that the queueing performance of the M/Pareto process depends upon the level of aggregation in the process. When the level of aggregation is high, the M/Pareto converges to a long-range-dependent Gaussian process. For lower levels of aggregation, the M/Pareto is capable of modeling the queueing performance of real broadband traffic traces. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-delay heuristic algorithms for wavelength assignments in WDM networks

    Publication Year: 1999 , Page(s): 3 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (80 KB)  

    In order to decrease the overall wavelength number required in a wavelength division multiplexed (WDM) network, new heuristic algorithms for wavelength assignment are proposed in this paper. We also define a new parameter called one-wavelength-decrease cost, which may be used to evaluate the efficiency of these algorithms. Comparative simulation studies have been carried out to investigate the effectiveness of the proposed algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for group multicast routing with bandwidth reservation

    Publication Year: 1999 , Page(s): 43 - 49
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (180 KB)  

    Multicasting refers to the transmission of data from a source node to multiple destination nodes in a network. Group multicasting is a generalisation of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. The routing problem in this case involves the construction of a set of low-cost multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. In this paper we first prove that to find a feasible solution to the group multicast routing problem is NP-complete. Following that we propose a new heuristic algorithm to generate a set of low-cost multicast trees with bandwidth reservation. Simulation results show that our proposed algorithm performs better in terms of cost and utilization of bandwidth compared with an existing algorithm that was proposed by Jia and Wang (1997). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information scheduling in a military satellite broadcast system

    Publication Year: 1999 , Page(s): 313 - 323
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (88 KB)  

    This paper presents a linear time complexity scheduling algorithm developed for military satellite broadcast systems carrying heterogenous traffic types. The objective of the algorithm is to maximise the total military value of information delivered by the system. To achieve this, each task to be scheduled is categorised as either a discrete-benefit or a contiuous-benefit. The categories describe the proportion of total data that must be delivered before an increase in value is achieved. Each discrete-benefit task is described by a time-value function which defines the value in completing that task at any instant. Continuous-benefit tasks are described by a bandwidth-value function which relates the value of that task as a function of instantaneous bandwidth assigned to it. The total military value as a function of bandwidth assigned to each task can be readily computed as the sum of discrete-benefit and continuous-benefit values. The total military value can then be maximised using dynamic programming techniques. Simulation results presented in this paper show the efficacy of the algorithm compared to other common schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic buffer allocation scheme for nrt-traffics in ATM switches

    Publication Year: 1999 , Page(s): 151 - 155
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (224 KB)  

    In this paper we propose a dynamic buffer allocation scheme for nrt-traffic in ATM switches that accommodates various service classes using a common buffer. This scheme dynamically controls thresholds of the buffer not to drop cells for loss-specified services and fairly allocates the buffer space among best-effort services. When the buffer occupancy exceeds a certain threshold level, it begins the early packet discard (EPD) mechanism for unspecified bit rate (UBR) and guaranteed frame rate (GFR). By dynamically sharing the buffer space among different services, this scheme can improve both fairness and buffer utilization to support various qualities of service (QoS) requirements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enabling alarm correlation for a mobile agent based system and network management - a wrapper concept

    Publication Year: 1999 , Page(s): 125 - 132
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (104 KB)  

    Solutions for system and network management given today are afflicted with two main shortcomings, namely the centralised approach they are based on and the inadequate addressing of heterogeneous environments. While the latter is the main concern of, for example, Web-based management activities, the aspect of centralisation is not being covered to full extend. With regard to the explosive growth of computer systems and networks both in size and complexity, new approaches therefore have to be evaluated which address all problems caused by complexity and heterogeneity. Mobile agent technology is being discussed as a promising new technology for various application areas, with management being one of the most promising. In this paper, problems arising when trying to apply this new technology to system and network management are identified and discussed. The focus is on how to handle the overall complexity with mobile agents, which are limited in size, knowledge, and functionality. An architecture is presented which introduces various types of mobile agents. By determining the required correlation sequence and identifying the co-operation of agents, it is shown how an alarm correlation with mobile agents can be established, which forms the basis for addressing management tasks with mobile agent technology. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic multicast trees

    Publication Year: 1999 , Page(s): 29 - 36
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (96 KB)  

    We present a family of protocols to build a multicast tree in a network of processes. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of a pair of messages with their parent in the tree. To choose the processes that constitute the tree, we take advantage of the existing multicast routing tables. In addition, our protocol family distinguishes itself from other protocols in three ways. First, the protocols are proven correct. Second, the integrity of the multicast tree is preserved as the tree adapts to changes in the unicast routing table. Third the protocols are self-stabilizing, i.e., they tolerate all transient faults. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal base station placement and fixed channel assignment applied to wireless local area network projects

    Publication Year: 1999 , Page(s): 186 - 192
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (108 KB)  

    The project of a wireless local area network (WLAN) has two major issues: determining the best placement of the base stations (BS) and assigning the frequency channels for the stations. The correct BS placement minimizes the number of stations necessary to cover the desired attendance area, reducing installation costs. The channel assignment determines the frequency band to be used by each BS, minimizing interference signals between them and improving the network throughput. This work relates a real experience where we applied the concepts of two outdoor environment classic problems, the optimal base placement problem for indoor environments and the fixed channel assignment problem, to build a wireless local area network in an indoor environment. We describe the hardware we used, the integer linear programming models developed and the results obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.