Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6601 - 6630 of 6884

Full-Text Articles in Physical Sciences and Mathematics

Recent Advances In Content-Based Video Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang Jul 2001

Recent Advances In Content-Based Video Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this paper, we present major issues in video parsing, abstraction, retrieval and semantic analysis. We discuss the success, the difficulties and the expectations in these areas. In addition, we identify important opened problems that can lead to more sophisticated ways of video content analysis. For video parsing, we discuss topics in video partitioning, motion characterization and object segmentation. The success in video parsing, in general, will have a great impact on video representation and retrieval. We present three levels of abstracting video content by scene, keyframe and key object representations. These representation schemes in overall serve as a good …

Go to article

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu Jun 2001

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu

Research Collection School Of Computing and Information Systems

We explore the use of GAs for solving a network optimization problem, the degree-constrained minimum spanning tree problem. We also examine the impact of encoding, crossover, and mutation on the performance of the GA. A specialized repair heuristic is used to improve performance. An experimental design with 48 cells and ten data points in each cell is used to examine the impact of two encoding methods, three crossover methods, two mutation methods, and four networks of varying node sizes. Two performance measures, solution quality and computation time, are used to evaluate the performance. The results obtained indicate that encoding has …

Go to article

Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras Jun 2001

Effect Of Exponential Averaging On The Variability Of A Red Queue, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper analyzes how using a longer memory of the past queue occupancy in computing the average queue occupancy affects the stability and variability of a RED queue. Extensive simulation studies with both persistent and Web TCP sources are used to study the variance of the RED queue as a function of the memory of the averaging process. Our results show that there is very little performance improvement (and in fact, possibly significant performance degradation) if the length of memory is increased beyond a very small value. Contrary to current practice, our results show that a longer memory reduces the …

Go to article

Implementation And Performance Evaluation Of Telemip, Kaushik Chakraborty, Archan Misra, Subir Das, Anthony J. Mcauley, Ashutosh Dutta, Sajal K. Das Jun 2001

Implementation And Performance Evaluation Of Telemip, Kaushik Chakraborty, Archan Misra, Subir Das, Anthony J. Mcauley, Ashutosh Dutta, Sajal K. Das

Research Collection School Of Computing and Information Systems

In this paper, we present our implementation of TeleMIP a two-level architecture for IP based mobility management TeleMIP essentially uses an Intra-Domain Mobility Management Protocol IDMP for managing mobility within a domain and Mobile IP for supporting inter-domain global mobility. Unlike other proposed schemes for intra-domain mobility management IDMP uses two care of addresses for mobility management The global care of address is relatively stable and identifies the mobile nodes current domain[1] while the local care of address changes every time the mobile changes subnets and identifies the mobiles current point of attachment. The paper describes our TeleMIP implementation based …

Go to article

Idmp-Based Fast Handoffs And Paging In Ip-Based Cellular Networks, Archan Misra, Subir Das, Ashutosh Dutta, Sajal K. Das May 2001

Idmp-Based Fast Handoffs And Paging In Ip-Based Cellular Networks, Archan Misra, Subir Das, Ashutosh Dutta, Sajal K. Das

Research Collection School Of Computing and Information Systems

We consider the use of our previously proposed Intra-Domain Mobility Management Protocol (IDMP) in fourth-generation mobile networks. On evaluating the heterogeneous access technologies, cellular layouts, and application characteristics of 4G environments, we realize a need to reduce both handoff latency and the frequency of mobility-related signaling. We first present IDMP's fast intradomain handoff mechanism that uses a duration-limited proactive packet multicasting solution. We quantify the expected buffering requirements of our proposed multicasting scheme for typical 4G network characteristics and compare it with alternative IP-based fast handoff solutions. We also present a paging scheme under IDMP that replicates the current cellular …

Go to article

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan Apr 2001

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a class of predictive self-organizing neural networks known as Adaptive Resonance Associative Map (ARAM) for classification of free-text documents. Whereas most sta- tistical approaches to text categorization derive classification knowledge based on training examples alone, ARAM performs supervised learn- ing and integrates user-defined classification knowledge in the form of IF-THEN rules. Through our experiments on the Reuters-21578 news database, we showed that ARAM performed reasonably well in mining categorization knowledge from sparse and high dimensional document feature space. In addition, ARAM predictive accuracy and learning efficiency can be improved by incorporating a set of rules derived from …

Go to article

Tcp Hack: Tcp Header Checksum Option To Improve Performance Over Lossy Links, Rajesh Krishna Balan, Boon Peng Lee, Renjish Kumar, Jacob Lillykutty, Winston Seah, A. L. Ananda Apr 2001

Tcp Hack: Tcp Header Checksum Option To Improve Performance Over Lossy Links, Rajesh Krishna Balan, Boon Peng Lee, Renjish Kumar, Jacob Lillykutty, Winston Seah, A. L. Ananda

Research Collection School Of Computing and Information Systems

Wireless networks have become increasingly common and an increasing number of devices are communicating with each other over lossy links. Unfortunately, TCP performs poorly over lossy links as it is unable to differentiate the loss due to packet corruption from that due to congestion. We present an extension to TCP which enables TCP to distinguish packet corruption from congestion in lossy environments resulting in improved performance. We refer to this extension as the HeAder ChecKsum option (HACK). We implemented our algorithm in the Linux kernel and performed various tests to determine its effectiveness. Our results have shown that HACK performs …

Go to article

Topic Detection, Tracking, And Trend Analysis Using Self-Organizing Neural Networks, Kanagasabai Rajaraman, Ah-Hwee Tan Apr 2001

Topic Detection, Tracking, And Trend Analysis Using Self-Organizing Neural Networks, Kanagasabai Rajaraman, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

We address the problem of Topic Detection and Tracking (TDT) and subsequently detecting trends from a stream of text documents. Formulating TDT as a clustering problem in a class of self-organizing neural networks, we propose an incremental clustering algorithm. On this setup we show how trends can be identified. Through experimental studies, we observe that our method enables discovering interesting trends that are deducible only from reading all relevant documents.

Go to article

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng Feb 2001

Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that …

Go to article

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu Feb 2001

Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu

Research Collection School Of Computing and Information Systems

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].

Go to article

A Framework For Performance And Value Assessment Of E-Business Systems In Corporate Travel Distribution, A.M. Chircu, Robert J. Kauffman Jan 2001

A Framework For Performance And Value Assessment Of E-Business Systems In Corporate Travel Distribution, A.M. Chircu, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

This chapter proposes and illustrates a framework that the authors call the value life cycle for e-commerce systems. Based on recent research results that relate to technology investments in the corporate travel industry and related theoretical and empirical perspectives, the authors lay out the corporate travel e-commerce system solutions value life cycle. The perspective involves estimating the maximum value that that an organization can obtain by implementing an e-commerce system in a specific industry and competitive environment. It also considers multiple factors that act as value contingencies for the implementation process. These create barriers to value accrual and to …

Go to article

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim Jan 2001

Incorporating Window-Based Passage-Level Evidence In Document Retrieval, Wensi Xi, Richard Xu-Rong, Christopher Soo Guan Khoo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

This study investigated whether document retrieval can be improved if documents are divided into smaller sub-documents or passages and the retrieval score for these passages are incorporated in the final retrieval score for the whole document. The documents were segmented by sliding a window of a certain size across the document and extracting the words displayed each time the window stopped. A retrieval score was calculated for each of the passages extracted and the highest score obtained by a passage of that size was taken as the document’s passage-level score for that window size. A range of window sizes was …

Go to article

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan Jan 2001

Ontologies And Electronic Commerce, Dieter Fensel, Deborah L. Mcguinness, Ellen Schulten, Wee-Keong Ng, Ee Peng Lim, Guanghao Yan

Research Collection School Of Computing and Information Systems

Ontologies are the first step toward realizing the full power of online e-commerce. Ontologies enable machine-understandable semantics of data, and building this data infrastructure will enable completely new kinds of automated services. Software agents can search for products, form buyer and seller coalitions, negotiate about products, or help automatically configure products and services according to specified user requirements. The combination of machine-processable semantics of data based on ontologies and the development of many specialized reasoning services will bring the Web to its full power. The authors discuss: taxonomies; information sources; future issues; business viewpoints; the e-marketplace; and B2B e-commerce standardisation …

Go to article

An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng Dec 2000

An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng

Research Collection School Of Computing and Information Systems

It is commonly acknowledged that customers’ privacy in electronic commerce should be well protected. The solutions may come not only from the ethics education and legislation, but also from cryptographic technologies. In this paper we propose and analyze a privacy protection scheme for e-commerce of digital goods. The scheme takes cryptography as its technical means to realize privacy protection for online customers. It is efficient in both computational cost and communication cost. It is very practical for real e-commerce systems compared with previous solutions. The cryptographic technique presented in this paper is rather simple. But the scheme has great application …

Go to article

Generalized Tcp Congestion Avoidance And Its Effect On Bandwidth Sharing And Variability, Archan Misra, John Baras, Teunis Ott Dec 2000

Generalized Tcp Congestion Avoidance And Its Effect On Bandwidth Sharing And Variability, Archan Misra, John Baras, Teunis Ott

Research Collection School Of Computing and Information Systems

To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN (explicit congestion notification), we formulate a generalized version of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the assured service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows, To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under …

Go to article

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu Dec 2000

Collaborative Model And Algorithms For Supporting Real-Time Distribution Logistics Systems, Hoong Chuin Lau, Qi Zhang Liu

Research Collection School Of Computing and Information Systems

We study a complex optimization problem that arises due to an emerging trend in distribution logistics. The problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. We describe a collaborative approach to solve this problem in real-time. The novelty of our approach lies in the tight algorithmic integration between two sub-problems, and suggests an elegant scheme to deal with other integrated optimization problems of the same nature. For first sub-problem, we will present two algorithms: a complete mathematical model integrating integer programming with constraint …

Go to article

Using 'Drop-Biasing' To Stabilize The Occupancy Of Random-Drop Queues With Tcp Traffic, Archan Misra, Teunis Ott, John Baras Nov 2000

Using 'Drop-Biasing' To Stabilize The Occupancy Of Random-Drop Queues With Tcp Traffic, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper describes how the use of ‘drop-biasing’, a technique to control the distribution of the gap between consecutive packet losses in random drop queues (such as RED) can be used to reduce the variability of the queue occupancy with TCP traffic. Reducing the variance of the queue occupancy reduces delay jitter for buffered packets, as well as decreases the likelihood of buffer underflow. We find that modifying the packet drop probabilities to ensure a minimum separation between consecutive packet drops serves to decrease the variability in the queue occupancy. This is really achieved as a result of the increased …

Go to article

Extensible Mpeg-4 Textual Format (Xmt), Michelle Kim, Steve Wood, Lai-Tee Cheok Nov 2000

Extensible Mpeg-4 Textual Format (Xmt), Michelle Kim, Steve Wood, Lai-Tee Cheok

Research Collection School Of Computing and Information Systems

This paper describes the Extensible MPEG-4 Textual format (XMT), a framework for representing MPEG-4 scene description using a textual syntax. The XMT allows the content authors to exchange their content with other authors, tools or service providers, and facilitates interoperability with both the X3D, developed by the Web3D consortium, and the Synchronized Multimedia Integration Language (SM1L) from the W3C consortium.

Go to article

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe Oct 2000

Side Collision Warning System For Transit Buses, Sue Mcneil, David Duggins, Christoph Mertz, Arne Suppe, Chuck Thorpe

Research Collection School Of Computing and Information Systems

Transit buses are involved in many more accidents than other vehicles. Collision warning systems (CWS) are therefore placed most efficiently on these buses. In our project, we investigate their operating environment and available technologies to develop performance specifications for such CWS. The paper discusses our findings of transit buses driving through very cluttered surroundings and being involved in many different types of accidents where currently available CWS no not work effectively. One of the focuses of our work is pedestrians around the bus and their detection.

Go to article

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Sep 2000

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …

Go to article

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das Aug 2000

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das

Research Collection School Of Computing and Information Systems

This article first surveys existing protocols for supporting IP mobility and then proposes an extension to the mobile IP architecture, called TeleMIP. Our architecture attempts to achieve smaller handoff latency by localizing the scope of most location update messages within an administrative domain or a geographical region. TeleMIP is intended for use in evolving third-generation wireless networks, and introduces a new logical entity, called the mobility agent, which provides a mobile node with a stable point of attachment in a foreign network. While the MA is functionally similar to conventional foreign agents, it is located at a higher level in …

Go to article

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng Jul 2000

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Research Collection School Of Computing and Information Systems

Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …

Go to article

Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Jun 2000

Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

This paper describes an approach to characterize camera and object motions based on the analysis of spatio temporal image volumes. In the spatio-temporal slices of image volumes, motion is depicted as oriented patterns. We propose a tensor histogram computation algorithm to represent these oriented patterns. The motion trajectories in a histogram are tracked to describe both the camera and object motions. In addition, we exploit the similarity of the temporal slices in a volume to reliably partition a volume into motion tractable units.

Go to article

Justifying Electronic Banking Network Expansion Using Real Option Pricing: An Empirical Illustration, Michel Benaroch, Robert J. Kauffman Jun 2000

Justifying Electronic Banking Network Expansion Using Real Option Pricing: An Empirical Illustration, Michel Benaroch, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The application of real options analysis to information technology investment evaluation problems recently has been proposed in the IS literature (Chalasani et al. 1997; Dos Santos 1991; Kambil et al. 1993; Kumar 1996; Taudes 1998). The research reported on in this paper illustrates the value of applying real options analysis in the context of a case study involving the deployment of point-of-sale (POS) debit services by the Yankee 24 shared electronic banking network of New England. In the course of so doing, the paper also attempts to operationalize real options analysis concepts by examining claimed strengths of this analysis approach …

Go to article

Dtd-Miner: A Tool For Mining Dtds From Xml Documents, Moh Chuang Hue, Ee Peng Lim, Wee-Keong Ng Jun 2000

Dtd-Miner: A Tool For Mining Dtds From Xml Documents, Moh Chuang Hue, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

XML documents are semistructured and the structure of the documents is embedded in the tags. Although XML documents can be accompanied by a DTD that defines the structure of the documents, the presence of a DTD is not mandatory. The difficulty in deriving the DTD for XML documents lies in the fact that DTDs are of different syntax as XML and that prior knowledge of the structure of the documents is required. In this paper, we introduce DTD-Miner, an automatic structure-mining tool for XML documents. Using a Web-based interface, the user will be able to submit a set of similarly …

Go to article

Re-Engineering Structures From Web Documents, Moh Chuang Hue, Ee Peng Lim, Wee-Keong Ng Jun 2000

Re-Engineering Structures From Web Documents, Moh Chuang Hue, Ee Peng Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

To realize a wide range of applications (including digital libraries) on the Web, a more structured way of accessing the Web is required and such requirement can be facilitated by the use of XML standard. In this paper, we propose a general framework for reverse engineering (or re-engineering) the underlying structures i.e.,the DTD from a collection of similarly structured XML documents when they share some common but unknown DTDs. The essential data structures and algorithms for the DTD generation have been delveloped and experiments on real Web collections have been conducted to demonstrate their feasibilty. In addition, we also proposed …

Go to article

Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao Jun 2000

Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

In this paper, we first review the existing IPv4 based multicast protocols and identify their shortcomings. We then proposed a new multicast protocol, called Multicast Internet Protocol (MIP), which is both scalable and flexible. The design principle of MIP is fundamentally different from the existing IPv4 based multicast protocols. The issues related to MIP routing and implementations are also studied in this paper.

Go to article

Predictive Adaptive Resonance Theory And Knowledge Discovery In Databases, Ah-Hwee Tan, Hui-Shin Vivien Soon May 2000

Predictive Adaptive Resonance Theory And Knowledge Discovery In Databases, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This paper investigates the scalability of predictive Adaptive Resonance Theory (ART) networks for knowledge discovery in very large databases. Although predictive ART performs fast and incremental learning, the number of recognition categories or rules that it creates during learning may become substantially large and cause the learning speed to slow down. To tackle this problem, we introduce an on-line algorithm for evaluating and pruning categories during learning. Benchmark experiments on a large scale data set show that on-line pruning has been effective in reducing the number of the recognition categories and the time for convergence. Interestingly, the pruned networks also …

Go to article

Decision Support Methods In Diabetic Patient Management By Insulin Administration Neural Network Vs. Induction Methods For Knowledge Classification, B. V. Ambrosiadou, S. Vadera, Venky Shankaraman, D. Goulis, G. Gogou May 2000

Decision Support Methods In Diabetic Patient Management By Insulin Administration Neural Network Vs. Induction Methods For Knowledge Classification, B. V. Ambrosiadou, S. Vadera, Venky Shankaraman, D. Goulis, G. Gogou

Research Collection School Of Computing and Information Systems

Diabetes mellitus is now recognised as a major worldwide public health problem. At present, about 100 million people are registered as diabetic patients. Many clinical, social and economic problems occur as a consequence of insulin-dependent diabetes. Treatment attempts to prevent or delay complications by applying ‘optimal’ glycaemic control. Therefore, there is a continuous need for effective monitoring of the patient. Given the popularity of decision tree learning algorithms as well as neural networks for knowledge classification which is further used for decision support, this paper examines their relative merits by applying one algorithm from each family on a medical problem; …

Go to article

Load Sharing In Distributed Multimedia-On-Demand Systems, Y. C. Tay, Hwee Hwa Pang May 2000

Load Sharing In Distributed Multimedia-On-Demand Systems, Y. C. Tay, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Service providers have begun to offer multimedia-on-demand services to residential estates by installing isolated, small-scale multimedia servers at individual estates. Such an arrangement allows the service providers to operate without relying on a highspeed, large-capacity metropolitan area network, which is still not available in many countries. Unfortunately, installing isolated servers can incur very high server costs, as each server requires spare bandwidth to cope with fluctuations in user demand. The authors explore the feasibility of linking up several small multimedia servers to a (limited-capacity) network, and allowing servers with idle retrieval bandwidth to help out servers that are temporarily overloaded; …

Go to article

First Prev Next Last