✦ LIBER ✦

Data structures for virtual-circuit implementation

✍ Scribed by Neil Stewart

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 508 KB
Volume: 5
Category: Article
ISSN: 0140-3664
DOI: 10.1016/0140-3664(82)90116-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Virtual transformations of data structur

Virtual transformations of data structures

✍ V. K. Evtimov 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 608 KB

An implementation base for efficient dat

An implementation base for efficient data structuring

✍ D. S. Wile; C. M. Geschke 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 849 KB

Compartmental models for virtual circuit

Compartmental models for virtual circuit networks

✍ Mario R. Garzia; Clayton M. Lockhart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Implementing persistent data structures

Implementing persistent data structures using C++

✍ Allen Parrish; Brandon Dixon; David Cordes; Susan Vrbsky; John Lusth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

Persistent data structures allow efficient access to, and modification of, previous values of the data structure. In this paper, we illustrate a class-based implementation of persistence. Our implementation provides a mechanism to transform a given (non-persistent) class to a persistent form without

Greedy online algorithms for routing per

Greedy online algorithms for routing permanent virtual circuits

✍ Havill, Jessen T.; Mao, Weizhen 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

We analyze the competitive ratio of two greedy online algorithms for routing permanent virtual circuits in a network with arbitrary topology and uniform capacity links. We show that the competitive ratio of the first algorithm, with respect to network congestion, is in ⍀( ͌ Ᏸm) and O( ͌ Ᏸᏸm), where

Multimedia virtual circuit model for MPE

Multimedia virtual circuit model for MPEG on ATM networks

✍ Anna Hać; Johnny On 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB