Log in

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

To see the other types of publications on this topic, follow the link: Network processors. Multicasting (Computer networks).

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

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Network processors. Multicasting (Computer networks).'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

GONZALEZ, TEOFILO F. "Improved Communication Schedules with Buffers." Parallel Processing Letters 19, no. 01 (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 comm

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 n

APA, Harvard, Vancouver, ISO, and other styles

3

Engbersen, Ton. "Network processors." Computer Networks 41, no. 5 (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 (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 (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 t

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 (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 (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 (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 (2006): 93–102. http://dx.doi.org/10.1007/s11107-006-0018-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

TEL, GERARD. "Network Orientation." International Journal of Foundations of Computer Science 05, no. 01 (1994): 23–57. http://dx.doi.org/10.1142/s0129054194000037.

Full text

Abstract:

This paper analyses how the symmetry of a processor network influences the existence of a solution for the network orientation problem. The orientation of hypercubes and tori is the problem of assigning labels to each link of each processor, in such a way that a sense of direction is given to the network. In this paper the problem of network orientation for these two topologies is studied under the assumption that the network contains a single leader, under the assumption that the processors possess unique identities, and under the assumption that the network is anonymous. The distinction betw

APA, Harvard, Vancouver, ISO, and other styles

12

HEMMINGER, THOMAS L., and CARLOS A. POMALAZA-RAEZ. "USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS." International Journal of Neural Systems 07, no. 05 (1996): 617–26. http://dx.doi.org/10.1142/s0129065796000609.

Full text

Abstract:

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the pa

APA, Harvard, Vancouver, ISO, and other styles

13

Alsmadi, Izzat, Abdallah Khreishah, and Dianxiang Xu. "Network slicing to improve multicasting in HPC clusters." Cluster Computing 21, no. 3 (2018): 1493–506. http://dx.doi.org/10.1007/s10586-017-1561-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

LEE, KEVIN, and GEOFFREY COULSON. "SUPPORTING RUNTIME RECONFIGURATION ON NETWORK PROCESSORS." Journal of Interconnection Networks 07, no. 04 (2006): 475–92. http://dx.doi.org/10.1142/s0219265906001818.

Full text

Abstract:

Network Processors (NPs) are set to play a key role in the next generation of networking technology. They have the performance of ASIC-based routers whilst offering a high degree of programmability. However, the programmability potential of NPs can only be realised with appropriate software. In this paper we argue that specialised software to support runtime reconfiguration is needed to fully exploit the potential of NPs. We first justify supporting runtime reconfiguration on NPs by offering real-world scenarios and discussing the issues associated with these. We then demonstrate how runtime r

APA, Harvard, Vancouver, ISO, and other styles

15

Bao, Haizhou, Chuanhe Huang, Zhongzheng Tang, et al. "Coded multicasting in cache-enabled vehicular ad hoc network." Computer Networks 159 (August 2019): 157–70. http://dx.doi.org/10.1016/j.comnet.2019.05.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Doraipandian, Manivannan, and Periasamy Neelamegam. "Wireless Sensor Network Using ARM Processors." International Journal of Embedded and Real-Time Communication Systems 4, no. 4 (2013): 48–59. http://dx.doi.org/10.4018/ijertcs.2013100103.

Full text

Abstract:

The hardware design of Wireless Sensor Networks (WSN) is the crux of its effective deployment. Nowadays these networks are used in microscopic, secure and high-end embedded products. WSN's potentiality in terms of efficient data sensing and distributed data processing has led to its usage in applications for measurement and tracking. WSN comprises of small number of embedded devices known as sensor nodes, gateways and base stations. Sensor nodes consist of sensors, processors and transceivers. The property of embedded sensor devices, also called motes, is to determine the strength of WSN. Thus

APA, Harvard, Vancouver, ISO, and other styles

17

Sun, Shimin, Xinchao Zhang, Wentian Huang, Aixin Xu, Xiaofan Wang, and Li Han. "QoS-Based Multicast Routing in Network Function Virtualization-Enabled Software-Defined Mobile Edge Computing Networks." Mobile Information Systems 2021 (April 15, 2021): 1–12. http://dx.doi.org/10.1155/2021/5590963.

Full text

Abstract:

Mobile Edge Computing (MEC) technology brings the unprecedented computing capacity to the edge of mobile network. It provides the cloud and end user swift high-quality services with seamless integration of mobile network and Internet. With powerful capability, virtualized network functions can be allocated to MEC. In this paper, we study QoS guaranteed multicasting routing with Network Function Virtualization (NFV) in MEC. Specifically, data should pass through a service function chain before reaching destinations along a multicast tree with minimal computational cost and meeting QoS requireme

APA, Harvard, Vancouver, ISO, and other styles

18

Vin, H., and R. Yovatkor. "Network processors [Guest editorial]." IEEE Network 17, no. 4 (2003): 10–11. http://dx.doi.org/10.1109/mnet.2003.1220690.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

ZHANG, LIN, DONGXU SHEN, XIUMING SHAN, and VICTOR O. K. LI. "AN ANT-BASED MULTICASTING PROTOCOL IN MOBILE AD-HOC NETWORK." International Journal of Computational Intelligence and Applications 05, no. 02 (2005): 185–99. http://dx.doi.org/10.1142/s1469026805001568.

Full text

Abstract:

Multicasting protocols deliver data packets from a source node to multiple receivers, and serve a very important function in mobile ad-hoc networks (MANETs). In this paper, a novel receiver-initiated soft-state probabilistic multicasting protocol (RISP) for MANETs is proposed. RISP is inspired by the ant colony's route-seeking mechanism, in which an individual ant chooses the optimal path to its destination through cooperation with others in a totally distributed manner. Imitating the behaviour of ants in nature, RISP introduces probabilistic forwarding and soft-state for making relay decision

APA, Harvard, Vancouver, ISO, and other styles

20

Rathore, Prateek, Kalpana Dhaka, and Sanjay K. Bose. "Network coding assisted reliable multi-source multicasting over a multi-hop wireless mesh network." Computer Communications 172 (April 2021): 130–41. http://dx.doi.org/10.1016/j.comcom.2021.03.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Szarkowicz, Krzysztof, Gábor Fodor, András Faragó, and Tamás Henk. "Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks." SIMULATION 68, no. 1 (1997): 34–43. http://dx.doi.org/10.1177/003754979706800108.

Full text

Abstract:

This paper begins with an overview of multicast algorithms, which are the most promising candidates to be in wide use in first generation Asynchronous Transfer Mode (ATM) based Broadband Integrated Services Digital Networks (B-ISDN). Since the Multiple Destination Routing (MDR) problem and the associated Steiner Tree problem are known to be NP-complete and therefore a number of heuristic algorithms have been proposed in the literature, we first need to establish which of these are the best candidates for the B-ISDN. We conclude that the weighted greedy -type algorithms are promising ones, and

APA, Harvard, Vancouver, ISO, and other styles

22

KING, FOO SHOU, P. SARATCHANDRAN, and N. SUNDARARAJAN. "ANALYSIS OF TRAINING SET PARALLELISM FOR BACKPROPAGATION NEURAL NETWORKS." International Journal of Neural Systems 06, no. 01 (1995): 61–78. http://dx.doi.org/10.1142/s0129065795000068.

Full text

Abstract:

Training set parallelism and network based parallelism are two popular paradigms for parallelizing a feedforward (artificial) neural network. Training set parallelism is particularly suited to feedforward neural networks with backpropagation learning where the size of the training set is large in relation to the size of the network. This paper analyzes training set parallelism for feedforward neural networks when implemented on a transputer array configured in a pipelined ring topology. Theoretical expressions for the time per epoch (iteration) and optimal size of a processor network are deriv

APA, Harvard, Vancouver, ISO, and other styles

23

BRANDT, RUSSELL, and TEOFILO F. GONZALEZ. "WAVELENGTH ASSIGNMENT IN MULTIFIBER OPTICAL STAR NETWORKS UNDER THE MULTICASTING COMMUNICATION MODE." Journal of Interconnection Networks 06, no. 04 (2005): 383–405. http://dx.doi.org/10.1142/s0219265905001484.

Full text

Abstract:

This paper examines the wavelength assignment problem for single, dual, and multimessage multicasting over a star network with optical switching between fibers along the same wavelength. The specific problem we consider is given any star network, a predetermined number of fibers that connect its nodes, and a set of multicasts (or multidestination messages) to be delivered in one communication round, find a conflict free message transmission schedule that uses the least number of wavelengths per fiber. When the least number of wavelengths, λmin, exceeds the number available, λavl, one may trans

APA, Harvard, Vancouver, ISO, and other styles

24

BATAINEH, SAMEER. "DIVISIBLE LOAD DISTRIBUTION IN A NETWORK OF PROCESSORS." Journal of Interconnection Networks 09, no. 01n02 (2008): 31–51. http://dx.doi.org/10.1142/s021926590800214x.

Full text

Abstract:

The paper presents a closed form solution for an optimum scheduling of a divisible job on an optimum number of processor arranged in an optimum sequence in a multilevel tree networks. The solution has been derived for a single divisible job where there is no dependency among subtasks and the root processor can either perform communication and computation at the same time. The solution is carried out through three basic theorems. One of the theorems selects the optimum number of available processors that must participate in executing a divisible job. The other solves the sequencing problem in l

APA, Harvard, Vancouver, ISO, and other styles

25

Ying-Dar Lin, Yi-Neng Lin, Shun-Chin Yang, and Yu-Sheng Lin. "Network, processors: implementation and evaluation." IEEE Network 17, no. 4 (2003): 28–34. http://dx.doi.org/10.1109/mnet.2003.1220693.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

CAMPA, ALESSANDRO, PAOLO DEL GIUDICE, JEAN-PIERRE NADAL, and NESTOR PARGA. "NEURAL NETWORKS AS OPTIMAL INFORMATION PROCESSORS." International Journal of Modern Physics C 05, no. 05 (1994): 855–62. http://dx.doi.org/10.1142/s0129183194000994.

Full text

Abstract:

We explore the properties of a feed-forward neural network whose couplings are chosen in such a way as to maximize the input-output mutual information, in the case in which the input-output channel is affected by noise.

APA, Harvard, Vancouver, ISO, and other styles

27

DRĂGOI, CEZARA, and FLORIN MANEA. "ON THE DESCRIPTIONAL COMPLEXITY OF ACCEPTING NETWORKS OF EVOLUTIONARY PROCESSORS WITH FILTERED CONNECTIONS." International Journal of Foundations of Computer Science 19, no. 05 (2008): 1113–32. http://dx.doi.org/10.1142/s0129054108006170.

Full text

Abstract:

In this paper we consider, from the descriptional complexity point of view, a model of computation introduced in [1], namely accepting network of evolutionary processors with filtered connections (ANEPFCs). First we show that for each morphism h : V → W*, with V ∩ W = ∅, one can effectively construct an ANEPFC, of size 6 + |W|, which accepts every input word w and, at the end of the computation on this word, obtains h(w) in its output node. This result can be applied in constructing two different ANEPFCs, with 27 and, respectively, 26 processors, recognizing a given recursively enumerable lang

APA, Harvard, Vancouver, ISO, and other styles

28

Vlaeminck, Koert, Tim Stevens, Wim Van de Meerssche, Filip De Turck, Bart Dhoedt, and Piet Demeester. "Efficient packet classification on network processors." International Journal of Communication Systems 21, no. 1 (2007): 51–72. http://dx.doi.org/10.1002/dac.885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Foag, Jurgen, and Thomas Wild. "Queuing algorithm for speculative Network Processors." International Journal of High Performance Computing and Networking 4, no. 5/6 (2006): 241. http://dx.doi.org/10.1504/ijhpcn.2006.013479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kencl, Lukas, and Jean-Yves Le Boudec. "Adaptive Load Sharing for Network Processors." IEEE/ACM Transactions on Networking 16, no. 2 (2008): 293–306. http://dx.doi.org/10.1109/tnet.2007.909839.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Nikolaidis, I. "Network Systems Design Using Network Processors [Book Review]." IEEE Network 18, no. 3 (2004): 5. http://dx.doi.org/10.1109/mnet.2004.1301013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Weifa Liang and Xiaoxing Guo. "Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks." IEEE Transactions on Mobile Computing 5, no. 9 (2006): 1215–27. http://dx.doi.org/10.1109/tmc.2006.133.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Engel, Jacob, and Taskin Kocak. "Off-chip communication architectures for high throughput network processors." Computer Communications 32, no. 5 (2009): 867–79. http://dx.doi.org/10.1016/j.comcom.2008.12.043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Guo, Yijun, Jing Gao, and Jianjun Hao. "Exploiting the User-Level Interference Based on Network Coding in D2D Underlaid Cellular Networks." Mobile Information Systems 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/142967.

Full text

Abstract:

Interference is an important and challenging problem faced by the D2D underlaid cellular networks. In this paper, we focus on the user-level interference under multicasting scenarios. Rather than the traditional pairwise way of D2D communications, we propose to implement the information exchanging through a groupwise way. Through introducing the idea of network coding, the proposed scheme is able to utilize the interference as valid signals to enhance the receiving performance, instead of only managing or controlling it. Both theoretical analysis and simulation results prove that the proposed

APA, Harvard, Vancouver, ISO, and other styles

35

Chatmen, Med fehmi, Adel Baganne, and Rached Tourki. "Low latency multicasting architecture implemented using new network topology." Microprocessors and Microsystems 68 (July 2019): 47–57. http://dx.doi.org/10.1016/j.micpro.2019.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wu, Xiaoban, Peilong Li, Yongyi Ran, and Yan Luo. "Network measurement for 100 GbE network links using multicore processors." Future Generation Computer Systems 79 (February 2018): 180–89. http://dx.doi.org/10.1016/j.future.2017.04.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ge, Min, Srikanth V. Krishnamurthy, and Michalis Faloutsos. "Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol." Ad Hoc Networks 4, no. 2 (2006): 283–300. http://dx.doi.org/10.1016/j.adhoc.2004.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

ANDO, EI, HIROTAKA ONO, KUNIHIKO SADAKANE, and MASAFUMI YAMASHITA. "THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS." International Journal of Foundations of Computer Science 21, no. 03 (2010): 427–40. http://dx.doi.org/10.1142/s0129054110007349.

Full text

Abstract:

The leader election problem is unsolvable for some anonymous networks. A leader election algorithm for anonymous networks thus elects a leader whenever it is possible; if it is impossible, the algorithm reports this fact. This paper investigates the space complexity of the leader election problem in anonymous networks, where the space complexity is measured by the size (in the number of bits) of memory per processor used by a leader election algorithm. We first observe that Ω(M + log d) bits are necessary and then show that O(n log d) bits are sufficient to construct a leader election algorith

APA, Harvard, Vancouver, ISO, and other styles

39

FERREIRA, A., A. GOLDMAN, and S. W. SONG. "BROADCASTING IN BUS INTERCONNECTION NETWORKS." Journal of Interconnection Networks 01, no. 02 (2000): 73–94. http://dx.doi.org/10.1142/s0219265900000068.

Full text

Abstract:

In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point interconnection network, usually modeled by a graph where processors are nodes and communication links are edges. Since interprocessor communication frequently constitutes serious bottlenecks, several architectures were proposed that enhance point-to-point topologies with the help of multiple bus systems so as to improve the communication efficiency. In this paper we study parallel architectures where the communication means are constituted solely by buses. These architectures can use the power of bus

APA, Harvard, Vancouver, ISO, and other styles

40

Osemwegie, Omoruyi, Samuel John, Adewale Adeyinka, Etinosa Noma-Osaghae, and Kennedy Okokpujie. "Comparative analysis of routing techniques in chord overlay network." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 5 (2021): 4361. http://dx.doi.org/10.11591/ijece.v11i5.pp4361-4372.

Full text

Abstract:

Overlay networks are not a new field or area of study. This domain of computing will someday drive P2P systems in various application areas such as block-chain, energy trading, video multicasting, and distributed file storage. This study highlights the two widely known methods of routing information employed in one of such overlay networks called chord. In this study, simulations of both routing modes (iterative and recursive) and their variations under no-churn (leaving and joining of nodes) and churn conditions was carried out. The routing parameter (successor list size) was varied for each

APA, Harvard, Vancouver, ISO, and other styles

41

Sánchez Couso, José Ramón, José Angel Sanchez Martín, Victor Mitrana, and Mihaela Păun. "Simulations between Three Types of Networks of Splicing Processors." Mathematics 9, no. 13 (2021): 1511. http://dx.doi.org/10.3390/math9131511.

Full text

Abstract:

Networks of splicing processors (NSP for short) embody a subcategory among the new computational models inspired by natural phenomena with theoretical potential to handle unsolvable problems efficiently. Current literature considers three variants in the context of networks managed by random-context filters. Despite the divergences on system complexity and control degree over the filters, the three variants were proved to hold the same computational power through the simulations of two computationally complete systems: Turing machines and 2-tag systems. However, the conversion between the thre

APA, Harvard, Vancouver, ISO, and other styles

42

Grosse, E., and Y. N. Lakshman. "Network processors applied to IPv4/IPv6 transition." IEEE Network 17, no. 4 (2003): 35–39. http://dx.doi.org/10.1109/mnet.2003.1220694.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Srinivasan, Deepa, and Wu-chang Feng. "Performance analysis of multi-dimensional packet classification on programmable network processors." Computer Communications 28, no. 15 (2005): 1752–60. http://dx.doi.org/10.1016/j.comcom.2004.12.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Martin, S., and G. Leduc. "A practical bytecode interpreter for programmable routers on IXP network processors." Computer Networks 53, no. 15 (2009): 2740–51. http://dx.doi.org/10.1016/j.comnet.2009.06.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Zheng, Bo. "A Queue Management Algorithm Fit for Network Processors." Journal of Computer Research and Development 42, no. 10 (2005): 1698. http://dx.doi.org/10.1360/crad20051009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Polaczyk, Bartosz, Piotr Chołda, and Andrzej Jajszczyk. "Peer-to-Peer Multicasting Inspired by Huffman Coding." Journal of Computer Networks and Communications 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/312376.

Full text

Abstract:

Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distrib

APA, Harvard, Vancouver, ISO, and other styles

47

KIM, M., T. J. LEE, and H. CHOO. "On Multicasting Based on Nested Mobile Router Information in Network Mobility." IEICE Transactions on Communications E89-B, no. 10 (2006): 2794–801. http://dx.doi.org/10.1093/ietcom/e89-b.10.2794.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Tekli, Joe, Ernesto Damiani, and Richard Chbeir. "Using XML-Based Multicasting to Improve Web Service Scalability." International Journal of Web Services Research 9, no. 1 (2012): 1–29. http://dx.doi.org/10.4018/jwsr.2012010101.

Full text

Abstract:

Web services’ (WS) emphasis on open standards provides substantial benefits over previous application integration techniques. A major WS feature is SOAP, a simple, robust and extensible XML-based protocol for the exchange of messages. For this reason, SOAP WS on virtual hosts are now widely used to provide shared functionalities on clouds. Unfortunately, SOAP has two major performance-related drawbacks: i) verbosity, related to XML, that leads to increased network traffic, and ii) high computational burden of XML parsing and processing, that leads to high latency. In this paper, we address the

APA, Harvard, Vancouver, ISO, and other styles

49

Lin, Yi-Neng, Ying-Dar Lin, and Yuan-Cheng Lai. "Thread allocation in CMP-based multithreaded network processors." Parallel Computing 36, no. 2-3 (2010): 104–16. http://dx.doi.org/10.1016/j.parco.2010.01.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Li, Dapeng, Haitao Zhao, Feng Tian, Huang Bo, Youyun Xu, and Guanglin Zhang. "Multipath network coding and multicasting for content sharing in wireless P2P networks: A potential game approach." Computer Communications 96 (December 2016): 17–28. http://dx.doi.org/10.1016/j.comcom.2016.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!