Skip to main content

and
  1. No Access

    Article

    Hot Data Identification with Multiple Bloom Filters: Block-Level Decision vs I/O Request-Level Decision

    Hot data identification is crucial for many applications though few investigations have examined the subject. All existing studies focus almost exclusively on frequency. However, effectively identifying hot da...

    Dongchul Park, Wei** He, David H. C. Du in Journal of Computer Science and Technology (2018)

  2. No Access

    Article

    A Lookahead Read Cache: Improving Read Performance for Deduplication Backup Storage

    Data deduplication (dedupe for short) is a special data compression technique. It has been widely adopted to save backup time as well as storage space, particularly in backup storage systems. Therefore, most d...

    Dongchul Park, Ziqi Fan, Young ** Nam in Journal of Computer Science and Technology (2017)

  3. No Access

    Chapter and Conference Paper

    Link Delay Modeling for Two-Way Traffic Road Segment in Vehicular Networks

    This paper proposes expected link delay (i.e., data delivery delay) on a two-way road segment for carry-and-forward data delivery schemes in vehicular networks. Recently, a lot of vehicles are able to communic...

    **ho Lee, Jaehoon (Paul) Jeong in Internet of Vehicles - Safe and Intelligen… (2015)

  4. No Access

    Chapter and Conference Paper

    Pantheon: Exascale File System Search for Scientific Computing

    Modern scientific computing generates petabytes of data in billions of files that must be managed. These files are often organized, by name, in a hierarchical directory tree common to most file systems. As the...

    Joseph L. Naps, Mohamed F. Mokbel in Scientific and Statistical Database Manage… (2011)

  5. Article

    Open Access

    In Situ Key Establishment in Large-Scale Sensor Networks

    Due to its efficiency, symmetric key cryptography is very attractive in sensor networks. A number of key predistribution schemes have been proposed, but the scalability is often constrained by the unavailabili...

    Yingchang **ang, Fang Liu, **uzhen Cheng in EURASIP Journal on Wireless Communications… (2009)

  6. No Access

    Article

    Proxy-assisted periodic broadcast for video streaming with multiple servers

    Large scale video streaming over the Internet requires a large amount of resources such as server I/O bandwidth and network bandwidth. A number of video delivery techniques can be used to lower these requireme...

    Ewa Kusmierek, David H. C. Du in Multimedia Tools and Applications (2008)

  7. No Access

    Article

    Periodic broadcast with dynamic server selection

    Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server offering the best performance. Proper se...

    Ewa Kusmierek, Ying** Lu, David H. C. Du in Multimedia Tools and Applications (2007)

  8. No Access

    Chapter and Conference Paper

    An Efficient Video Prefix-Caching Scheme in Wide Area Networks

    Web proxy caching provides an effective way to reduce access latency and bandwidth requirement. In particular, prefix caching is considered as an alternative for improving video delivery over wide area network...

    Hyotaek Lim, DaeHun Nyang, David H. C. Du in Information Networking. Networking Technol… (2004)

  9. No Access

    Article

    Frame Selection for Dynamic Caching Adjustment in Video Proxy Servers

    By caching video data, a video proxy server close to the clients can be used to assist video delivery and alleviate the load of video servers. We assume a video can be partially cached and a certain number of ...

    Wei-Hsiu Ma, David H.C. Du in Multimedia Tools and Applications (2004)

  10. No Access

    Article

    Performance of a Scalable Multimedia Server with Shared-Storage Clusters

    The existing SCSI parallel bus has been widely used in various multimedia applications. However, due to the unfair bus accesses the SCSI bus may not be able to fully utilize the potential aggregate throughput ...

    Simon S.Y. Shim, Tai-Sheng Chang, David H.C. Du in Multimedia Tools and Applications (2002)

  11. No Access

    Article

    An Efficient Algorithm for Delay Buffer Minimization

    A data flow machine is said to be synchronized if for any vertex u in the underlying data flow graph, all inputs to vertex u arrive at the same time. An unsynchronized data flow machine with an acyclic underly...

    Guoliang Xue, Shangzhi Sun, David H.C. Du in Journal of Combinatorial Optimization (2000)

  12. No Access

    Article

    Two Emerging Serial Storage Interfaces for Supporting Digital Libraries: Serial Storage Architecture (SSA) and Fiber Channel-Arbitrated Loop (FC-AL)

    Digital libraries require not only high storage space capacity but also high performance storage systems which provide the fast accesses to the data. These requirements can not be efficiently supported with th...

    David H.C. Du, Tai-Sheng Chang, Jenwei Hsieh in Multimedia Tools and Applications (2000)

  13. No Access

    Chapter

    Two Emerging Serial Storage Interfaces for Supporting Digital Libraries: Serial Storage Architecture (SSA) and Fiber Channel-arbitrated Loop(FC-AL)

    Digital libraries require not only high storage space capacity but also high performance storage systems which provide the fast accesses to the data. These requirements can not be efficiently supported with th...

    David H. C. Du, Tai-Sheng Chang, Jenwei Hsieh in Digital Libraries and Multimedia (2000)

  14. No Access

    Article

    Scalability of Wavelength Division Multiplexed Optical Passive Star Networks with Range Limited Tunable Transceivers

    The number of stations attached to a single optical passive star is limited by current state of the art in optical technology. Also, the wavelength range of tunable optical transceivers is limited by current t...

    Allalaghatta Pavan, Feng Cao, David H.C. Du in Photonic Network Communication (1999)

  15. No Access

    Article

    Building video‐on‐demand servers

    We have designed and implemented a controllable software architecture for a Video‐on‐Demand (VOD) server. With the proposed software architecture, many system design issues can be investigated. For example, we...

    David H.C. Du, Jonathan C.L. Liu, Jenwei Hsieh in Telecommunication Systems (1998)

  16. No Access

    Article

    Efficient video file allocation schemes for video-on-demand services

    A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the di...

    Yuewei Wang, Jonathan C.L. Liu, David H.C. Du, Jenwei Hsieh in Multimedia Systems (1997)

  17. Chapter

    The Effect of Various ATM Switch Architectures on VBR Video Performance

    One of the most important components of an Asynchronous Transfer Mode (ATM) net- work is the switch. Switch design is not a part of the ATM standards so vendors use a wide variety of techniques to build their ...

    Rose P. Tsang, Jenwei Hsieh, David H. C. Du in High Performance Networking VII (1997)

  18. No Access

    Chapter and Conference Paper

    High Performance Computing over Switch-Based High-Speed Networks

    Communication between processors has long been the bottleneck of distributed network computing. However, recent progress in switch-based high-speed networks including ATM, HIPPI and Fibre Channel may be changi...

    Jenwei Hsieh, David H. C. Du in Workshop on High Performance Computing and… (1997)

  19. No Access

    Article

    Experiments with video transmission over an Asynchronous Transfer Mode (ATM) network

    We present end-to-end performance of digital coded video (JPEG, MPEG-1, and MPEG-2) over a local asynchronuous transfer mode (ATM) network. We discuss performance in terms of both delay (jitter) and frame loss...

    Rose P. Tsang, David H.C. Du, Allalaghatta Pavan in Multimedia Systems (1996)

  20. No Access

    Chapter and Conference Paper

    Achieving the shortest clock period by inserting the minimum amount of delay

    The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagati...

    Shangzhi Sun, David H. C. Du, Guoliang Xue in Algorithms and Computation (1994)