The Experts below are selected from a list of 187206 Experts worldwide ranked by ideXlab platform
J. Gwinn - One of the best experts on this subject based on the ideXlab platform.
-
measurements for enhanced Bandwidth Performance over 62 5 spl mu m multimode fiber in short wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: J Schlager, Petar Pepeljugoski, M.j. Hackert, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
-
Measurements for enhanced Bandwidth Performance over 62.5-/spl mu/m multimode fiber in short-wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: John B. Schlager, M.j. Hackert, Petar Pepeljugoski, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
Marco Pavone - One of the best experts on this subject based on the ideXlab platform.
-
Distributed consensus with mixed time/communication Bandwidth Performance metrics
arXiv: Systems and Control, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithm.
-
distributed consensus with mixed time communication Bandwidth Performance metrics
Allerton Conference on Communication Control and Computing, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity and robustness as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithms.
-
distributed consensus with mixed time communication Bandwidth Performance metrics
arXiv: Systems and Control, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithm.
-
Allerton - Distributed consensus with mixed time/communication Bandwidth Performance metrics
2014 52nd Annual Allerton Conference on Communication Control and Computing (Allerton), 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity and robustness as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithms.
Federico Rossi - One of the best experts on this subject based on the ideXlab platform.
-
Distributed consensus with mixed time/communication Bandwidth Performance metrics
arXiv: Systems and Control, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithm.
-
distributed consensus with mixed time communication Bandwidth Performance metrics
Allerton Conference on Communication Control and Computing, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity and robustness as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithms.
-
distributed consensus with mixed time communication Bandwidth Performance metrics
arXiv: Systems and Control, 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for dense robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithm.
-
Allerton - Distributed consensus with mixed time/communication Bandwidth Performance metrics
2014 52nd Annual Allerton Conference on Communication Control and Computing (Allerton), 2014Co-Authors: Federico Rossi, Marco PavoneAbstract:In this paper we study the inherent trade-off between time and communication complexity for the distributed consensus problem. In our model, communication complexity is measured as the maximum data throughput (in bits per second) sent through the network at a given instant. Such a notion of communication complexity, referred to as Bandwidth complexity, is related to the frequency Bandwidth a designer should collectively allocate to the agents if they were to communicate via a wireless channel, which represents an important constraint for robotic networks. We prove a lower bound on the Bandwidth complexity of the consensus problem and provide a matching consensus algorithm that is Bandwidth-optimal for a wide class of consensus functions. We then propose a distributed algorithm that can trade communication complexity versus time complexity and robustness as a function of a tunable parameter, which can be adjusted by a system designer as a function of the properties of the wireless communication channel. We rigorously characterize the tunable algorithm's worst-case Bandwidth complexity and show that it compares favorably with the Bandwidth complexity of well-known consensus algorithms.
Petar Pepeljugoski - One of the best experts on this subject based on the ideXlab platform.
-
measurements for enhanced Bandwidth Performance over 62 5 spl mu m multimode fiber in short wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: J Schlager, Petar Pepeljugoski, M.j. Hackert, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
-
Measurements for enhanced Bandwidth Performance over 62.5-/spl mu/m multimode fiber in short-wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: John B. Schlager, M.j. Hackert, Petar Pepeljugoski, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
M.j. Hackert - One of the best experts on this subject based on the ideXlab platform.
-
measurements for enhanced Bandwidth Performance over 62 5 spl mu m multimode fiber in short wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: J Schlager, Petar Pepeljugoski, M.j. Hackert, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
-
Measurements for enhanced Bandwidth Performance over 62.5-/spl mu/m multimode fiber in short-wavelength local area networks
Journal of Lightwave Technology, 2003Co-Authors: John B. Schlager, M.j. Hackert, Petar Pepeljugoski, J. GwinnAbstract:The Telecommunications Industry Association (TIA) FO-2.2.1 Working Group on the modal dependence of Bandwidth has conducted industrywide interlaboratory comparisons on measurements aimed at improving the Bandwidth Performance of short-wavelength, laser-based, multimode-fiber local area networks (LANs). Measurements of both transceiver encircled flux and fiber restricted-mode-launch Bandwidth can together successfully predict an enhanced system Performance, provided that the proper limiting criteria are selected. System Performance is determined by a measurement of effective Bandwidth and/or intersymbol interference. Recommendations for source and fiber selection criteria come from a risk analysis based on an extensive multilaboratory comparison involving 95 fibers and 69 laser transceivers. For this paper, enhanced system Performance is defined as a Performance that allows operation at a data rate of at least one gigabit per second over a 500-m length of 62.5/125-/spl mu/m graded-index glass fiber.
