ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Springer
    Mobile networks and applications 3 (1998), S. 203-220 
    ISSN: 1572-8153
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in mobile ATM (Asynchronous Transfer Mode) networks based on the PNNI (Private Network-to-Network Interface) standard. The route optimization algorithm uses hierarchical route information of the connection and summarized topology and loading information of the network to determine a “crossover node” such that adjusting the connection from that crossover node results in an optimally routed connection. Handoff management schemes that perform local rerouting of connections have been proposed in order to support fast handoffs. These methods result in suboptimally routed connections. In this paper, we demonstrate how this route optimization algorithm can be used to optimize the route of a connection after such a handoff is executed, as the second phase of a two-phase handoff scheme. This route optimization procedure can also be executed as part of the handoff procedure resulting in a one-phase handoff scheme. Applying this route optimization algorithm, we propose two one-phase schemes, the one-phase optimal scheme and the one-phase minimal scheme. A comparative performance analysis of one- and two-phase handoff schemes is presented. Measures of comparison are handoff latency and the amount of network resources used by a connection. Handoff latency in the one-phase optimal scheme is greater than that in the two-phase schemes, and handoff latency in the one-phase minimal scheme is smaller than that in the two-phase schemes. The one-phase methods show a significant increase in efficiency of the connection compared to the two-phase methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1572-8196
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Computer Science
    Notes: Abstract Vector clocks have been used to capture causal dependencies between processes in distributed computing systems. Vector clocks are not suitable for mobile computing systems due to (i) lack of scalability: its size is equal to the number of nodes, and (ii) its inability to cope with fluctuations in the number of nodes. This paper presents two efficient alternatives to vector clock, namely, sets of dependency sequences, and hierarchical clock. Both the alternatives are scalable and are immune to fluctuations in the number of nodes in the system.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Telecommunication systems 7 (1997), S. 59-74 
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract Messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites. Causal ordering allows the cause and effect relations of messages to be maintained. This paper presents an algorithm that ensures that multimedia data with real‐time deadlines are delivered to the application layer in causal order. The algorithm is designed to ensure that any message that arrives at a destination site before its deadline will be delivered to the application before the message expires. In addition, by focusing on a form of causal ordering violations caused by “the triangle inequality”, this algorithm has a low overhead with respect to the amount of information that must be appended to each message.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    The journal of supercomputing 9 (1995), S. 51-70 
    ISSN: 1573-0484
    Keywords: Operating systems ; process synchronization ; semaphores ; disrtributed-memory architectures ; distributed shared memory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Distributed shared memory has increasingly become a desirable programming model on which to program multicomputer systems. Such systems strike a balance between the performance attainable in distributed-memory multiprocessors and the ease of programming on shared-memory systems. In shared-memory systems, concurrent tasks communicate through shared variables, and synchronization of access to shared data is an important issue. Semaphores have been traditionally used to provide this synchronization. In this paper we propose a decentralized scheme to support semaphores in a virtual shared-memory system. Our method of grouping semaphores into semaphore pages and caching a semaphore at a processor on demand eliminates the reliability problems and bottlenecks associated with centralized schemes. We compare the performance of our scheme with a centralized implementation of semaphores and conclude that our system performs better under high semaphore access rates as well as larger numbers of processors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Distributed computing 4 (1991), S. 131-138 
    ISSN: 1432-0452
    Keywords: Deadlocks ; Dynamic information structures ; Mutual exclusion ; Performance ; Starvation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Maekawa-type mutual exclusion algorithms use locking of a set of sites to achieve mutual exclusion. These algorithms are prone to deadlocks because a site is locked by other sites in exclusive mode and the timestamp of requests is not used to order requests while granting locks. These algorithms require additional rounds of message exchanges, like INQUIRE and FAILED, to recover from a possible deadlock. In this paper we present a class of Maekawa-type mutual exclusion algorithms which are free from deadlocks and do not exchange additional messages to resolve deadlocks. We systematically point out the reasons for deadlocks in Maekawa-type algorithms and eliminate them one by one to give a class of Maekawa-type algorithms which are free from deadlocks. It turns out that to prevent deadlocks in Maekawa-type algorithms, locks on sites must be mutable, timestamps must be used judiciously, and communication among sites must be increased. A deadlock-free Maekawa-type algorithm is optimal when the request sets of sites are the smallest possible such that a correctness condition is satisfied. We state the condition of optimality and present a method to construct optimal request sets. We also give a swap operation which allows us to derive an optimal configuration of request sets from another optimal configuration. There are large number of optimal configurations of request sets, which define a class of optimal deadlock-free Maekawa-type algorithms. Freedom from deadlocks is a desirable property because it dispenses with the need of cumbersome deadlock recovery scheme (e.g., exchange of INQUIRE, FAILED, and YIELD messages). Freedom from deadlock has another benefit: simplicity of the implementation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1432-0452
    Keywords: Key words:Causal message ordering – Distributed systems – Synchronization – Concurrency
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary. This paper formulates necessary and sufficient conditions on the information required for enforcing causal ordering in a distributed system with asynchronous communication. The paper then presents an algorithm for enforcing causal message ordering. The algorithm allows a process to multicast to arbitrary and dynamically changing process groups. We show that the algorithm is optimal in the space complexity of the overhead of control information in both messages and message logs. The algorithm achieves optimality by transmitting the bare minimum causal dependency information specified by the necessity conditions, and using an encoding scheme to represent and transmit this information. We show that, in general, the space complexity of causal 0message ordering in an asynchronous system is $\Omega(n^{2})$ , where $n$ is the number of nodes in the system. Although the upper bound on space complexity of the overhead of control information in the algorithm is $O(n^{2})$ , the overhead is likely to be much smaller on the average, and is always the least possible.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Netnomics 2 (2000), S. 221-245 
    ISSN: 1573-7071
    Keywords: stock market ; transaction ; protocol ; real-time ; verification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Economics
    Notes: Abstract Stock markets constitute the largest electronic commerce market in the world. The tremendous growth in trading volume and the need for fast and accurate transaction execution has made the stock market one of the most technology friendly markets. The fastest growing stock exchange, NASDAQ, is a wholly electronic stock exchange with all transactions conducted over computer networks. However, the transaction model used by NASDAQ and other electronic stock markets still borrows heavily from the older traditional models used by non-electronic stock exchanges. Two important requirements of modern day stock market transactions are: (a) customer's ability to place sophisticated transaction orders to buy/sell stock, and (b) customer's ability to detect transaction delays. Modern electronic stock exchanges lack both the ability to place newer, more sophisticated transaction orders and the ability to detect delays in transaction execution. In this paper, we propose a protocol for stock market transaction that can model a new sophisticated model for transaction orders while continuing to support traditional transaction orders. The protocol is augmented with a mechanism to detect delays in transaction execution. It is further shown that the protocol proposed is secure, atomic, anonymous, private, and incurs low overhead costs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Publication Date: 2013-08-27
    Print ISSN: 0956-5515
    Electronic ISSN: 1572-8145
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2020-05-07
    Print ISSN: 1873-9318
    Electronic ISSN: 1873-9326
    Topics: Energy, Environment Protection, Nuclear Power Engineering
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 1994-05-01
    Print ISSN: 0020-0255
    Electronic ISSN: 1872-6291
    Topics: Computer Science
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...