Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Scalability of Wavelength Division Multiplexed Optical Passive Star Networks with Range Limited Tunable Transceivers (1999)
    Springer
    Photonic network communications 1 (1999), S. 125-146 
    Details
    ISSN: 1572-8188
    Keywords: fiber optic networks ; wavelength division multiplexing ; network scalability ; optical passive star ; tunable transmitter
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract 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 technology. Many high performance computing applications require the use of large size regular topologies for communication between computing nodes. Scalability of passive star networks built with these two limitations becomes an important issue for building larger networks. This is the subject of our study in this paper. In a previous related work we explored the design issues for networks built on a single passive star employing transceivers of a limited tuning range. Here we extend that study by considering the problem of connecting several optical passive stars, each embedded with a given virtual topology, to create larger aggregate networks. The design issues are analyzed and a number of design rules are proposed for building such aggregate networks. We study the scalability of embedded optical passive stars by considering the most commonly employed virtual topologies—complete graph, mesh and hypercube.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1010070922483
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Experiments with video transmission over an Asynchronous Transfer Mode (ATM) network (1996)
    Springer
    Multimedia systems 4 (1996), S. 157-171 
    Details
    ISSN: 1432-1882
    Keywords: Key Words:Asynchronous transfer mode (ATM) – Distributed multimedia systems – Traffic smoothing – Network transport protocols – Video transmission
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. 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 as a function of load. The experimental data reveal that the burstiness of the variable bit-rate-coded video streams degrades the performance significantly when the hosts and the network are stressed. Our results show that traffic smoothing decreases frame loss significantly while maintaining acceptable jitter and loss bounds. We also discuss requirements for system components, such as the network interface and switch, which are necessary to support video services efficiently.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s005300050020
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Efficient video file allocation schemes for video-on-demand services (1997)
    Springer
    Multimedia systems 5 (1997), S. 283-296 
    Details
    ISSN: 1432-1882
    Keywords: Key words: Multimedia – Video-on-demand – Concurrent access – MPEG-II – RAID-3 – Replication – Striping – 2D vector packing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. 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 disk storage subsystem of a VOD server. Due to different demands for different movie titles, the numbers of concurrent accesses to each movie can differ a lot. We define access profile as the number of concurrent accesses to each movie title that should be supported by a VOD server. The access profile is derived based on the popularity of each movie title and thus serves as a major design goal for the disk storage subsystem. Since some popular (hot) movie titles may be concurrently accessed by hundreds of users and a current high-end magnetic disk array (disk) can only support tens of concurrent accesses, it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. The consequence of replication and striping of hot movie titles is the potential increase on the required number of disk arrays. Therefore, how to replicate, stripe, and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate the problem of the video file allocation over disk arrays, demonstrate that it is a NP-hard problem, and present some heuristic algorithms to find the near-optimal solutions. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s005300050061
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Building video‐on‐demand servers (1998)
    Springer
    Telecommunication systems 9 (1998), S. 255-286 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract 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 studied several disk striping schemes in the storage subsystem and examined the impact of the disk striping schemes on the utilization of system resources. In the processing component, we observed that additional concurrent video streams can be supported by using efficient memory interleaving. Buffering with a large memory space in the processing subsystem is a common technique to alleviate the latency variance of accessing different system components. By employing user‐level control and scheduling, the variance can be decreased thereby reducing the resulting buffer space needed for each video stream. In the network subsystem, we adopted a server‐driven approach for investigating MPEG‐2 video delivery over Asynchronous Transfer Mode (ATM) networks. The VOD server controls the pace of video transmission and reduces the complexity of the client. Since the client has limited buffer space (due to cost considerations), we have reduced the buffer requirement by regulating the transmission based on timing information embedded in the MPEG‐2 streams. Our research and experimental results are based on a VOD server which is currently under construction. The prototype server is based on an SGI shared‐memory multiprocessor with a mass storage system consisting of RAID‐3 disk arrays. Using 30 RAID‐3 disk arrays, preliminary experimental results show that the prototype server can potentially support more than 360 high‐quality video streams with careful design and coordination of the different system components.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1019152024565
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    An Efficient Algorithm for Delay Buffer Minimization (2000)
    Springer
    Journal of combinatorial optimization 4 (2000), S. 217-233 
    Details
    ISSN: 1573-2886
    Keywords: VLSI technology ; data flow machine ; optimal delay buffer insertion
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract 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 underlying data flow graph can be transformed into a synchronized system by adding unit delay buffers to the system. This synchronization process can increase pipelining and throughout. Since the addition of delay buffers introduces hardware and area costs, it is desirable to insert the minimum number of delay buffers to synchronize a given data flow machine. Due to important applications in computer design, various delay buffer minimization problems have been studied by many researchers. Several optimal algorithms and heuristic algorithms have been proposed for slightly different models. In this paper, we introduce the concept of extensions of a directed acyclic graph to generalize and formalize several delay buffer minimization problems studied in the literature and present a polynomial time algorithm for computing the minimum delay buffer synchronization of a given data flow machine. Examples are provided to illustrate our algorithm and to show that our algorithm requires fewer delay buffers than previously published optimal algorithms for various models.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009850721462
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Two Emerging Serial Storage Interfaces for Supporting Digital Libraries: Serial Storage Architecture (SSA) and Fiber Channel-Arbitrated Loop (FC-AL) (2000)
    Springer
    Multimedia tools and applications 10 (2000), S. 179-203 
    Details
    ISSN: 1573-7721
    Keywords: serial storage interface ; serial storage architecture ; fiber channel-arbitrated loop ; fairness algorithm ; spatial reuse ; performance evaluation ; simulation model
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract 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 the traditional SCSI interfaces. Several serial storage interfaces have been proposed for constructing storage systems with high transfer bandwidth, large storage capacity, and fault tolerance feature. Among them, Serial Storage Architecture (SSA) and Fibre Channel-Arbitrated Loop (FC-AL) are considered as the next generation storage interfaces with broad industry support. Both technologies support simple cabling, long transmission distance, high data bandwidth, large capacity, fault tolerance, and fair sharing of link bandwidth. In this paper, a tutorial and a comparison of these two technologies are presented. The tutorial examines their interface specifications, transport protocols, fairness algorithms, and capabilities of fault tolerance. The comparison focuses on their protocol overhead, flow control, fairness algorithms, and fault tolerance. The paper also summarizes the recently proposed Aaron Proposal which incorporates features from both SSA and FC-AL and targets at merging these two technologies.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009662702317
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...