• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 640,182
Next 10 →

Scheduling Trees with Communication Delays

by Andreas Jakoby, Rüdiger Reischuk , 1997
"... Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP -complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP -complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown

Communication Delay and Instability in

by Rate-Controlled Networks Priya, Priya Ranjan, Eyad H. Abed, Richard J. La , 2003
"... We analyze the optimization framework for rate allocation problem proposed by Kelly and characterize the oscillations in terms of underlying map's period two orbit in the instability regime with arbitrary communication delay. We show the oscillations can be fairly large by computing the bounds ..."
Abstract - Add to MetaCart
We analyze the optimization framework for rate allocation problem proposed by Kelly and characterize the oscillations in terms of underlying map's period two orbit in the instability regime with arbitrary communication delay. We show the oscillations can be fairly large by computing the bounds

Wireless Communications

by Andrea Goldsmith, Anaïs Nin , 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract - Cited by 1129 (32 self) - Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University

Routing in a delay tolerant network

by Sushant Jain, Kevin Fall, Rabin Patra - Proceedings of ACM Sigcomm , 2004
"... We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract - Cited by 612 (8 self) - Add to MetaCart
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property

A Delay-Tolerant Network Architecture for Challenged Internets

by Kevin Fall , 2003
"... The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme env ..."
Abstract - Cited by 937 (13 self) - Add to MetaCart
The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 556 (20 self) - Add to MetaCart
The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1052 (17 self) - Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or

Requirements for Internet Hosts - Communication Layers

by R. Braden - RFC1812] [RFC2277] Baker, F., "Requirements for IP Version 4 Routers", RFC 1812 , 1989
"... This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This is one RFC of a pair that defines and discusses the r ..."
Abstract - Cited by 521 (6 self) - Add to MetaCart
the requirements for Internet host software. This RFC covers the communications protocol layers: link layer, IP layer, and transport layer; its companion RFC-1123 covers the application and support protocols.

Scheduling Rooted Forests with Communication Delays

by Garth Isaak - Order , 1994
"... We show that a greedy algorithm for scheduling unit time jobs on two machines with unit communication delays produces an optimal schedule when the precedence constraints are given by a rooted forest. We also give a min/max relationship for the length of such a schedule. The min/max result (for fores ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We show that a greedy algorithm for scheduling unit time jobs on two machines with unit communication delays produces an optimal schedule when the precedence constraints are given by a rooted forest. We also give a min/max relationship for the length of such a schedule. The min/max result (for

A simple transmit diversity technique for wireless communications

by Siavash M. Alamouti - IEEE Journal on Selected Areas in Communications , 1998
"... Abstract — This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas. It is also shown that the sch ..."
Abstract - Cited by 2084 (0 self) - Add to MetaCart
processing, baseband processing, diversity, estimation and detection, fade mitigation, maximalratio combining, Rayleigh fading, smart antennas, space block coding, space–time coding, transmit diversity, wireless communications. I.
Next 10 →
Results 1 - 10 of 640,182
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University