Relevant bibliographies by topics / Multicasting (Computer networks) Network processors

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Multicasting (Computer networks) Network processors'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multicasting (Computer networks) Network processors.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multicasting (Computer networks) Network processors"

1

GONZALEZ, TEOFILO F. "Improved Communication Schedules with Buffers." Parallel Processing Letters 19, no. 01 (March 2009): 129–39. http://dx.doi.org/10.1142/s0129626409000110.

Full text
Abstract:
We consider the multimessage multicasting over the n processor complete (or fully connected) static network when there are l incoming (message) buffers on every processor. We present an efficient algorithm to route the messages for every degree d problem instance in d2/l + l - 1 total communication rounds, where d is the maximum number of messages that each processor may send (or receive). Our algorithm takes linear time with respect to the input length, i.e. O(n + q) where q is the total number of messages that all processors must receive. For l = d we present a lower bound for the total communication time. The lower bound matches the upper bound for the schedules generated by our algorithm. For convenience we assume that the network is completely connected. However, it is important to note that each communication round can be automatically translated into one communication round for processors interconnected via a replication network followed by a permutation network (e.g., two adjacent Benes networks), because in these networks all possible one-to-many communications can be performed in a single communication round.
APA, Harvard, Vancouver, ISO, and other styles
2

Shorfuzzaman, Mohammad, Rasit Eskicioglu, and Peter Graham. "In-Network Adaptation of Video Streams Using Network Processors." Advances in Multimedia 2009 (2009): 1–20. http://dx.doi.org/10.1155/2009/905890.

Full text
Abstract:
The increasing variety of networks and end systems, especially wireless devices, pose new challenges in communication support for, particularly, multicast-based collaborative applications. In traditional multicasting, the sender transmits video at the same rate and resolution to all receivers independent of their network characteristics, end system equipment, and users' preferences about video quality and significance. Such an approach results in resources being wasted and may also result in some receivers having their quality expectations unsatisfied. This problem can be addressed, near the network edge, by applying dynamic, in-network adaptation (e.g., transcoding) of video streams to meet available connection bandwidth, machine characteristics, and client preferences. In this paper, we extrapolate from earlier work of Shorfuzzaman et al. 2006 in which we implemented and assessed an MPEG-1 transcoding system on the Intel IXP1200 network processor to consider the feasibility of in-network transcoding for other video formats and network processor architectures. The use of “on-the-fly” video adaptation near the edge of the network offers the promise of simpler support for a wide range of end devices with different display, and so forth, characteristics that can be used in different types of environments.
APA, Harvard, Vancouver, ISO, and other styles
3

Engbersen, Ton. "Network processors." Computer Networks 41, no. 5 (April 2003): 545–47. http://dx.doi.org/10.1016/s1389-1286(02)00457-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wolf, Tilman. "Network processors." ACM SIGCOMM Computer Communication Review 32, no. 1 (January 2002): 65. http://dx.doi.org/10.1145/510726.510739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

XU, YINLONG, LI LIN, GUOLIANG CHEN, YINGYU WAN, and WEIJUN GUO. "MULTICASTING AND BROADCASTING IN UNDIRECTED WDM NETWORKS AND QoS EXTENTIONS OF MULTICASTING." International Journal of Foundations of Computer Science 15, no. 01 (February 2004): 187–203. http://dx.doi.org/10.1142/s0129054104002376.

Full text
Abstract:
This paper addresses multicasting and broadcasting in undirected WDM networks and QoS extensions of multicasting. It is given an undirected network G=(V, E), with Λ is the set of the available wavelengths in G, and associated with each edge, there is a subset of wavelengths on it. For a multicast request r=(s, D) with a source s and a set D of destinations, it is to find a tree rooted at s including all nodes in D such that the cost of the tree is minimized in terms of the cost of wavelength conversion at nodes and the cost of using wavelength on edges. This paper proves that multicasting in this model of networks is NP-Hard and cannot be approximated within a constant factor, unless P=NP. Furthermore, an auxiliary graph is constructed for the original WDM network, the multicasting is reduced to a group Steiner tree problem on the auxiliary graph and an approximate algorithm based on the group Steiner tree algorithm proposed by M. Charikar et al. with performance ratio of O( log 2(nk) log log (nk) log p) is provided, where k=|Λ| and p=|D∪{s}|. At last, some QoS extensions of multicasting are discussed.
APA, Harvard, Vancouver, ISO, and other styles
6

TAYU, SATOSHI, TURKI GHAZI AL-MUTAIRI, and SHUICHI UENO. "COST-CONSTRAINED MINIMUM-DELAY MULTICASTING." Journal of Interconnection Networks 09, no. 01n02 (March 2008): 141–55. http://dx.doi.org/10.1142/s0219265908002205.

Full text
Abstract:
We consider a problem of cost-constrained minimum-delay multicasting in a network, which is to find a Steiner tree spanning the source and destination nodes such that the maximum total delay along a path from the source node to a destination node is minimized, while the sum of link costs in the tree is bounded by a constant. The problem is NP-hard even if the network is series-parallel. We present a fully polynomial time approximation scheme for the problem if the network is series-parallel.
APA, Harvard, Vancouver, ISO, and other styles
7

Lua, Eng Keong, Xiaoming Zhou, Jon Crowcroft, and Piet Van Mieghem. "Scalable multicasting with network-aware geometric overlay." Computer Communications 31, no. 3 (February 2008): 464–88. http://dx.doi.org/10.1016/j.comcom.2007.08.046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rathore, Prateek, Kalpana Dhaka, and Sanjay K. Bose. "Network coding assisted multicasting in multi-hop wireless networks." Computer Communications 138 (April 2019): 45–53. http://dx.doi.org/10.1016/j.comcom.2019.02.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wolf, Tilman, Prashanth Pappu, and Mark A. Franklin. "Predictive scheduling of network processors." Computer Networks 41, no. 5 (April 2003): 601–21. http://dx.doi.org/10.1016/s1389-1286(02)00452-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Peng, Yunfeng, Weisheng Hu, Weiqiang Sun, Xiaodong Wang, and Yaohui Jin. "Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing." Photonic Network Communications 13, no. 1 (September 9, 2006): 93–102. http://dx.doi.org/10.1007/s11107-006-0018-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multicasting (Computer networks) Network processors"

1

Tarigopula, Srivamsi Mohanty Saraju. "A cam-based, high-performance classifier-scheduler for a video network processor." [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-6045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Diler, Timur. "Network processors and utilizing their features in a multicast design." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FDiler.pdf.

Full text
Abstract:
Thesis (M.S. in Computer Science and M.S. in Electrical Engineering)--Naval Postgraduate School, March 2004.
Thesis advisor(s): Su Wen, Jon Butler. Includes bibliographical references (p. 53-54). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
3

Tarigopula, Srivamsi. "A CAM-Based, High-Performance Classifier-Scheduler for a Video Network Processor." Thesis, University of North Texas, 2008. https://digital.library.unt.edu/ark:/67531/metadc6045/.

Full text
Abstract:
Classification and scheduling are key functionalities of a network processor. Network processors are equipped with application specific integrated circuits (ASIC), so that as IP (Internet Protocol) packets arrive, they can be processed directly without using the central processing unit. A new network processor is proposed called the video network processor (VNP) for real time broadcasting of video streams for IP television (IPTV). This thesis explores the challenge in designing a combined classification and scheduling module for a VNP. I propose and design the classifier-scheduler module which will classify and schedule data for VNP. The proposed module discriminates between IP packets and video packets. The video packets are further processed for digital rights management (DRM). IP packets which carry regular traffic will traverse without any modification. Basic architecture of VNP and architecture of classifier-scheduler module based on content addressable memory (CAM) and random access memory (RAM) has been proposed. The module has been designed and simulated in Xilinx 9.1i; is built in ISE simulator with a throughput of 1.79 Mbps and a maximum working frequency of 111.89 MHz at a power dissipation of 33.6mW. The code has been translated and mapped for Spartan and Virtex family of devices.
APA, Harvard, Vancouver, ISO, and other styles
4

Ekici, Eylem. "Routing and multicasting in satellite IP networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15605.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Donahoo, Michael J. "Application-based enhancement to network-layer multicast." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/9230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Montgomery, Michael Charles. "Managing complexity in large-scale networks via flow and network aggregation /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Zaichen, and 張在琛. "Network-supported internet multicast congestion and error control." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31243915.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Quick, Christopher Verald. "An evaluation of the network efficiency required in order to support multicast and synchronous distributed learning network traffic." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03sep%5FQuick.pdf.

Full text
Abstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003.
Thesis advisor(s): Geoffrey Xie, John H. Gibson. Includes bibliographical references (p. 149-151). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
9

Tamer, Murat Tevfink. "Internetworking multicast and ATM network prerequisites for distance learning /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA321343.

Full text
Abstract:
Thesis (M.S. in Computer Science) Naval Postgraduate School, September 1996.
Thesis advisor(s): D.P. Brutzman, Michael J. Zyda. "September 1996." Includes bibliographical references: (p. 119-121). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
10

Wong, Wan-Ching. "SALM : an efficient application-level multicast protocol for dynamic groups /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20WONGW.

Full text
Abstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 75-79). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Multicasting (Computer networks) Network processors"

1

Lekkas, Panos C. Network Processors. New York: McGraw-Hill, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Comer, Douglas. Network systems design: Using network processors : Agere version. Upper Saddle River, N.J: Pearson/Prentice Hall, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Building switched networks: Multilayer switching, QoS, IP multicast, network policy, and service level agreements. Reading, Mass: Addison-Wesley, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Giladi, Ran. Network processors: Architecture, programming, and implementation. Amsterdam: Morgan Kaufmann, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Giladi, Ran. Network processors: Architecture, programming, and implementation. Amsterdam: Morgan Kaufmann, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Giladi, Ran. Network processors: Architecture, programming, and implementation. Amsterdam: Morgan Kaufmann, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Comer, Douglas. Network systems design: Using network processors : Intel IXP version. Upper Saddle River, N.J: Pearson/Prentice Hall, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pardalos, P. M. (Panos M.), 1954- and SpringerLink (Online service), eds. Mathematical Aspects of Network Routing Optimization. New York, NY: Springer Science+Business Media, LLC, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

International Workshop on Networked Group Communication (5th 2003 Munich, Germany). Group communications and charges: Technology and business models : 5th COST 264 International Workshop on Networked Group Communications, NGC 2003 and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19, 2003 : proceedings. Berlin: Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

International Workshop on Networked Group Communication (5th 2003 Munich, Germany). Group communications and charges: Technology and business models : 5th COST 264 International Workshop on Networked Group Communications, NGC 2003 and 3rd International Workshop on Internet Charging and QoS Technologies, ICQT 2003, Munich, Germany, September 16-19, 2003 : proceedings. Berlin: Springer, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Multicasting (Computer networks) Network processors"

1

"Accelerated Network Traversal Using Multi/Many-Cores." In Advances in Computer and Electrical Engineering, 59–86. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3799-1.ch003.

Full text
Abstract:
New BSP platforms like TOTEM are following a similar approach to Big Data industry-proven frameworks but applied to exploit the potential of HPC heterogeneous nodes that combine multi-cores and GPUs. The performance of platforms under this new paradigm depends on minimizing the computation time of partitions by increasing the suitability of partitions to processors. However, there is a lack of studies on the suitability of parallel architectures for processing different families of graphs, including small-world and scale-free networks. In this chapter, the authors show how to characterize the performance of multi/many-cores when traversing synthetic networks of varying topology in order to reveal the suitability of multi-cores and GPUs for processing different families of graphs.
APA, Harvard, Vancouver, ISO, and other styles
2

Ashcroft, E. A., A. A. Faustini, R. Jaggannathan, and W. W. Wadge. "High-Performance Implementation." In Multidimensional Programming. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195075977.003.0010.

Full text
Abstract:
In Chapter 1, we saw how Lucid could be used to express solutions to standard problems such as sorting and matrix multiplication. One of the unique characteristics of Lucid is not only that it can be used as a programming language but it can also be used as a “composition” language. That is, instead of using Lucid to specify computations, it can be used to express how computation components (expressed in some other language) can be “glued” together to form a coherent application. By doing so, the resulting application can enjoy some of the practical benefits attributable to Lucid such as high performance through exploitation of implicit parallelism and robustness through software fault tolerance. In this chapter, we discuss one such use of Lucid—as part of a hybrid language to construct parallel applications to be executed on conventional parallel computers. A conventional parallel computer either consists of a number of processors each with local memory interconnected by a network (as in distributed memory architectures) or a number of processors that share memory possibly using an interconnection network (as in shared memory architectures). The past decade has seen the advent of conventional parallel computers starting with the Denelcor HEP evolving to the CM-2 and Intel Hypercube and further evolving to the CM-5, Intel Paragon, Cray T3D, and IBM SP-2. Even networks of workstations (or workstation clusters) are seen as low-cost (“poor man’s”) parallel computers. Programming of conventional parallel computers has proven to be far more challenging than had been expected. Part of the reason is the continued use of low-level, explicitly parallel programming models such as PVM [42], Linda [10]. Two factors have fueled the continuing use of such languages despite their limited success. 1. The need to reuse existing sequential code because the cost of rewriting legacy applications from scratch is considered prohibitive both in economic and technical terms. 2. The need to run on conventional parallel computers that view a “parallel program” at a low level—as consisting of sequential processes that frequently synchronize and communicate with each other using some form of message passing.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multicasting (Computer networks) Network processors"

1

Lu, Hsiao-Chen, and Wanjiun Liao. "Cooperative multicasting in network-coding enabled multi-rate wireless relay networks." In IEEE INFOCOM 2012 - IEEE Conference on Computer Communications. IEEE, 2012. http://dx.doi.org/10.1109/infcom.2012.6195770.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zanko, Avi, Amir Leshem, and Ephraim Zehavi. "Network Coding for Multicasting over Rayleigh Fading Multi Access Channels." In 2013 22nd International Conference on Computer Communication and Networks (ICCCN 2013). IEEE, 2013. http://dx.doi.org/10.1109/icccn.2013.6614159.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Khosravi, Atefeh, Siavash Khorsandi, and Mohammad K. Akbari. "Hyper node torus: A new interconnection network for high speed packet processors." In 2011 International Symposium on Computer Networks and Distributed Systems (CNDS). IEEE, 2011. http://dx.doi.org/10.1109/cnds.2011.5764553.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Multicasting (Computer networks) Network processors"

1

Farhi, Edward, and Hartmut Neven. Classification with Quantum Neural Networks on Near Term Processors. Web of Open Science, December 2020. http://dx.doi.org/10.37686/qrl.v1i2.80.

Full text
Abstract:
We introduce a quantum neural network, QNN, that can represent labeled data, classical or quantum, and be trained by supervised learning. The quantum circuit consists of a sequence of parameter dependent unitary transformations which acts on an input quantum state. For binary classification a single Pauli operator is measured on a designated readout qubit. The measured output is the quantum neural network’s predictor of the binary label of the input state. We show through classical simulation that parameters can be found that allow the QNN to learn to correctly distinguish the two data sets. We then discuss presenting the data as quantum superpositions of computational basis states corresponding to different label values. Here we show through simulation that learning is possible. We consider using our QNN to learn the label of a general quantum state. By example we show that this can be done. Our work is exploratory and relies on the classical simulation of small quantum systems. The QNN proposed here was designed with near-term quantum processors in mind. Therefore it will be possible to run this QNN on a near term gate model quantum computer where its power can be explored beyond what can be explored with simulation.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multicasting (Computer networks) Network processors' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography