To see the other types of publications on this topic, follow the link: Packet transport networks.

Journal articles on the topic 'Packet transport networks'

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 'Packet transport 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

TADIĆ, BOSILJKA, and G. J. RODGERS. "PACKET TRANSPORT ON SCALE-FREE NETWORKS." Advances in Complex Systems 05, no. 04 (December 2002): 445–56. http://dx.doi.org/10.1142/s021952590200064x.

Full text
Abstract:
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major kinetic properties of the transport as a function of the network geometry, the packet input rate and the buffer size. We find long-range correlations in the power spectra of arriving packet density and the network's activity bursts. The packet transit time distribution shows a power-law dependence with average transit time increasing with network size. This implies dynamic queuing on the network, in which many interacting queues are mutually driven by temporally correlated packet streams.
APA, Harvard, Vancouver, ISO, and other styles
2

Lometti, Alberto, Italo Busi, Pietro Grandi, Vincenzo Sestito, and Andrea Paparella. "Packet Transport Technologies for Optical Networks." Fiber and Integrated Optics 27, no. 4 (July 31, 2008): 237–48. http://dx.doi.org/10.1080/01468030802191882.

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

Afferton, T. S., R. D. Doverspike, C. R. Kalmanek, and K. K. Ramakrishnan. "Packet-aware transport for metro networks." IEEE Communications Magazine 42, no. 3 (March 2004): 120–27. http://dx.doi.org/10.1109/mcom.2004.1273783.

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

Díaz-Cacho Medina, Miguel, Emma Delgado Romero, and Antonio Barreiro Blas. "Control/Network Codesign Basics for IP-Based Shared Networks." Mathematical Problems in Engineering 2011 (2011): 1–23. http://dx.doi.org/10.1155/2011/239512.

Full text
Abstract:
Network and control relationship is an essential aspect in the design of networked control systems (NCSs). The design parameters are mainly centered in the transmission rate and in the packet structure, and some studies have been made to determine how transmission rate affects the network delay and consequently the stability of the control. In Internet, these analysis are mathematically complex due to the large number of different potential scenarios. Using empirical methods, this work deduces that the transmission scheduling problem of an NCS can be solved by designing an appropriate transport protocol, taken into account high and periodic sampling rates. The transport protocol features are determined by simulation, using a new test platform based on the NS2 network simulation suite, to develop control/network codesign solutions. Conclusions of this paper are that the transport features are packet-loss-based flow control, best effort, and fairness, supplemented by a packet priority scheme.
APA, Harvard, Vancouver, ISO, and other styles
5

Cortés-Polo, David, José-Luis González-Sánchez, Francisco-Javier Rodríguez-Pérez, and Javier Carmona-Murillo. "Mobility management in packet transport networks for network convergence." Transactions on Emerging Telecommunications Technologies 26, no. 5 (September 24, 2013): 749–59. http://dx.doi.org/10.1002/ett.2705.

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

Lavanya, K., Dr R.Kanthavel, and Dr R.Dhaya. "Efficient Streaming of Video Frames over Heterogeneous Wireless Network." International Journal of Engineering & Technology 7, no. 3.34 (September 1, 2018): 226. http://dx.doi.org/10.14419/ijet.v7i3.34.18970.

Full text
Abstract:
Transferring high quality video stream through a heterogeneous wireless network has many challenges due to the varying data rate and round trip time(RTT) involved in the network and the more stringent quality of service(QoS) requirements of the multimedia application such as on time delivery , minimum delay etc. User datagram protocol (UDP), a connectionless, unreliable transport protocol has been widely used for transferring video frames.UDP cannot guarantee reliable information delivery and may lead to packet loss. The packet loss, increases with time varying bandwidth availability in the heterogeneous wireless networks. Transmission control protocol(TCP) can be an alternate transport layer protocol to provide reliable delivery of video information. But, using TCP for wireless networks has limitations due to misinterpretation of packet loss, frequent link failure, asymmetric link behaviour etc.,. which minimizes the throughput and in turn degrades the quality of the video frames transmitted. This paper analyses an efficient scheme to use Heterogeneous Environment Retransmission algorithm with SCTP (HERTS) to transfer video data in the heterogeneous environment. By using multi-homing and multi-streaming feature of Stream control transmission protocol (SCTP), the packet delivery rate, through put and delay requirements can be optimized. The transport layer model suggested in this paper aims at reducing the occupancy of the retransmitted packets in the link, by using a separate end to end path allotted for retransmission.
APA, Harvard, Vancouver, ISO, and other styles
7

LI, KUN, XIAOFENG GONG, SHUGUANG GUAN, and C. H. LAI. "ANALYSIS OF TRAFFIC FLOW ON COMPLEX NETWORKS." International Journal of Modern Physics B 25, no. 10 (April 20, 2011): 1419–28. http://dx.doi.org/10.1142/s0217979211100655.

Full text
Abstract:
We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.
APA, Harvard, Vancouver, ISO, and other styles
8

Shelkovoy, D. V., and A. A. Chernikov. "Simulation modeling of packet switching network segment functioning." Issues of radio electronics, no. 12 (December 28, 2019): 75–82. http://dx.doi.org/10.21778/2218-5453-2019-12-75-82.

Full text
Abstract:
The testing results of required channel resource mathematical estimating models for the for serving the proposed multimedia load in packet-switched communication networks are presented in the article. The assessment of the attainable level of quality of service at the level of data packet transportation was carried out by means of simulation modeling of the functioning of a switching node of a communication network. The developed modeling algorithm differs from the existing ones by taking into account the introduced delay for processing each data stream packet arriving at the switching node, depending on the size of the reserved buffer and the channel resource for its maintenance. A joint examination of the probability of packet loss and the introduced delay in the processing of data packets in the border router allows a comprehensive assessment of the quality of service «end to end», which in turn allows you to get more accurate values of the effective data transmitted rate by aggregating flows at the entrance to the transport network.
APA, Harvard, Vancouver, ISO, and other styles
9

Ben Halima, Nadhir, Dzmitry Kliazovich, and Fabrizio Granelli. "Service-Aware Retransmission Control in Cellular Networks." Journal of Computer Systems, Networks, and Communications 2010 (2010): 1–8. http://dx.doi.org/10.1155/2010/256964.

Full text
Abstract:
This paper proposes a service-aware cross-layer approach between application/transport layers on the mobile terminal and link layer on the wireless base station to enable dynamic control on the level of per-packet error protection for multimedia data streams. Specifically, in the context of cellular networks, the proposed scheme enables the mobile terminal to specify to the base station the desired level of Hybrid ARQ (HARQ) protection by using an in-band control feedback channel. Such protection is dynamically adapted on a per-packet basis and depends on the perceptual importance of different packets as well as on the reception history of the flow. Experimental results demonstrate the potential benefits deriving from the proposed strategy either for audio and video real-time streams as well as for TCP-based data transfers.
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Yi-Bing, Chien-Chao Tseng, and Ming-Hung Wang. "Effects of Transport Network Slicing on 5G Applications." Future Internet 13, no. 3 (March 11, 2021): 69. http://dx.doi.org/10.3390/fi13030069.

Full text
Abstract:
Network slicing is considered a key technology in enabling the underlying 5G mobile network infrastructure to meet diverse service requirements. In this article, we demonstrate how transport network slicing accommodates the various network service requirements of Massive IoT (MIoT), Critical IoT (CIoT), and Mobile Broadband (MBB) applications. Given that most of the research conducted previously to measure 5G network slicing is done through simulations, we utilized SimTalk, an IoT application traffic emulator, to emulate large amounts of realistic traffic patterns in order to study the effects of transport network slicing on IoT and MBB applications. Furthermore, we developed several MIoT, CIoT, and MBB applications that operate sustainably on several campuses and directed both real and emulated traffic into a Programming Protocol-Independent Packet Processors (P4)-based 5G testbed. We then examined the performance in terms of throughput, packet loss, and latency. Our study indicates that applications with different traffic characteristics need different corresponding Committed Information Rate (CIR) ratios. The CIR ratio is the CIR setting for a P4 meter in physical switch hardware over the aggregated data rate of applications of the same type. A low CIR ratio adversely affects the application’s performance because P4 switches will dispatch application packets to the low-priority queue if the packet arrival rate exceeds the CIR setting for the same type of applications. In our testbed, both exemplar MBB applications required a CIR ratio of 140% to achieve, respectively, a near 100% throughput percentage with a 0.0035% loss rate and an approximate 100% throughput percentage with a 0.0017% loss rate. However, the exemplar CIoT and MIoT applications required a CIR ratio of 120% and 100%, respectively, to reach a 100% throughput percentage without any packet loss. With the proper CIR settings for the P4 meters, the proposed transport network slicing mechanism can enforce the committed rates and fulfill the latency and reliability requirements for 5G MIoT, CIoT, and MBB applications in both TCP and UDP.
APA, Harvard, Vancouver, ISO, and other styles
11

Park, Seok-Hwan, Osvaldo Simeone, and Shlomo Shamai (Shitz). "Robust Baseband Compression Against Congestion in Packet-Based Fronthaul Networks Using Multiple Description Coding." Entropy 21, no. 4 (April 24, 2019): 433. http://dx.doi.org/10.3390/e21040433.

Full text
Abstract:
In modern implementations of Cloud Radio Access Network (C-RAN), the fronthaul transport network will often be packet-based and it will have a multi-hop architecture built with general-purpose switches using network function virtualization (NFV) and software-defined networking (SDN). This paper studies the joint design of uplink radio and fronthaul transmission strategies for a C-RAN with a packet-based fronthaul network. To make an efficient use of multiple routes that carry fronthaul packets from remote radio heads (RRHs) to cloud, as an alternative to more conventional packet-based multi-route reception or coding, a multiple description coding (MDC) strategy is introduced that operates directly at the level of baseband signals. MDC ensures an improved quality of the signal received at the cloud in conditions of low network congestion, i.e., when more fronthaul packets are received within a tolerated deadline. The advantages of the proposed MDC approach as compared to the traditional path diversity scheme are validated via extensive numerical results.
APA, Harvard, Vancouver, ISO, and other styles
12

ŞİMŞEK, Mehmet, Nurettin Doğan, and Muhammet Ali Akcayol. "A New Packet Scheduling Algorithm for Real-Time Multimedia Streaming." Network Protocols and Algorithms 9, no. 1-2 (June 30, 2017): 28. http://dx.doi.org/10.5296/npa.v9i1-2.12410.

Full text
Abstract:
Delivering the real-time services over converged networks is a big challenge. Real-time services need to high Quality of Service (QoS). For this purpose, bandwidth reservation and packet prioritization techniques are used. Thus, real-time data packets can be reached to their targets with minimum delays and losses. But, this situation creates unintended consequences for other internet services such as HTTP and FTP. In this case, establishing a balance between the real-time services and the other services is a must. In this study we introduce a new research question: how to transport real-time multimedia IP packets just in time? Just in time means that transportation of the packets neither early, nor late. For this purpose we developed a scheduling/prioritizing algorithm called just in time transport (JITT). Following a cross-layer design approach, JITT controls delay and jitter over whole communication path. We evaluated JITT on the different simulations and one experimental testbed for performance analysis. Our findings support that JITT provides stable delay and low jitter and transports the packets nearly just in time.
APA, Harvard, Vancouver, ISO, and other styles
13

Miruta, Radu-Dinel, Cosmin Stanuica, and Eugen Borcoci. "New Fields in Classifying Algorithms for Content Awareness." International Journal of Information Technology and Web Engineering 7, no. 2 (April 2012): 1–15. http://dx.doi.org/10.4018/jitwe.2012040101.

Full text
Abstract:
The content aware (CA) packet classification and processing at network level is a new approach leading to significant increase of delivery quality of the multimedia traffic in Internet. This paper presents a solution for a new multi-dimensional packet classifier of an edge router, based on content - related new fields embedded in the data packets. The technique is applicable to content aware networks. The classification algorithm is using three new packet fields named Virtual Content Aware Network (VCAN), Service Type (STYPE), and U (unicast/multicast) which are part of the Content Awareness Transport Information (CATI) header. A CATI header is inserted into the transmitted data packets at the Service/Content Provider server side, in accordance with the media service definition, and enables the content awareness features at a new overlay Content Aware Network layer. The functionality of the CATI header within the classification process is then analyzed. Two possibilities are considered: the adaptation of the Lucent Bit vector algorithm and, respectively, of the tuple space search, in order to respond to the suggested multi-fields classifier. The results are very promising and they prove that theoretical model of inserting new packet fields for content aware classification can be implemented and can work in a real time classifier.
APA, Harvard, Vancouver, ISO, and other styles
14

Liu, Qinghua, Fenfen Ke, Zhihua Liu, and Jiaxin Zeng. "Loss-Aware CMT-Based Multipathing Scheme for Efficient Data Delivery to Heterogeneous Wireless Networks." International Journal of Digital Multimedia Broadcasting 2019 (February 20, 2019): 1–8. http://dx.doi.org/10.1155/2019/9474057.

Full text
Abstract:
With the rapid development of wireless networks, multiple network interfaces are gradually being designed into more and more mobile devices. When it comes to data delivery, Stream Control Transmission Protocol (SCTP)-based Concurrent Multipath Transfer (CMT) has proven to be quite useful solution for multiple home networks, and it could become the key transport protocol for the next generation of wireless communications. The CMT delay caused by data rearrangement has been noticed by researchers, but they have seldom considered the frequent occurrence of packet loss that occurs in the high-loss networks. In this paper, we proposed an original loss-aware solution for multipath concurrent transmission (CMT-LA) that achieves the following goals: (1) identifying packet loss on all paths, (2) distributing packets adaptively across multiple available paths according to their packet loss and loss variation, and (3) maintaining the features of bandwidth aggregation and parallel transmission of CMT while improving the throughput performance. The results of our simulations showed that the proposed CMT-LA reduces reordering delay and unnecessary fast retransmissions, thereby demonstrating that CMT-LA is a more efficient data delivery scheme than classic CMT.
APA, Harvard, Vancouver, ISO, and other styles
15

Lee, Kwang-Koog, Hosong Lee, Youngwuk Lee, and Kitae Jeong. "Reliable Methods of Interoperability between Packet Transport Networks and IP Networks." Journal of the Institute of Electronics and Information Engineers 51, no. 10 (October 25, 2014): 34–40. http://dx.doi.org/10.5573/ieie.2014.51.10.034.

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

Klinkowski, Mirosław. "Latency-Aware DU/CU Placement in Convergent Packet-Based 5G Fronthaul Transport Networks." Applied Sciences 10, no. 21 (October 22, 2020): 7429. http://dx.doi.org/10.3390/app10217429.

Full text
Abstract:
The 5th generation mobile networks (5G) based on virtualized and centralized radio access networks will require cost-effective and flexible solutions for satisfying high-throughput and latency requirements. The next generation fronthaul interface (NGFI) architecture is one of the main candidates to achieve it. In the NGFI architecture, baseband processing is split and performed in radio (RU), distributed (DU), and central (CU) units. The mentioned entities are virtualized and performed on general-purpose processors forming a processing pool (PP) facility. Given that the location of PPs may be spread over the network and the PPs have limited capacity, it leads to the optimization problem concerning the placement of DUs and CUs. In the NGFI network scenario, the radio data between the RU, DU, CU, and a data center (DC)—in which the traffic is aggregated—are transmitted in the form of packets over a convergent packet-switched network. Because the packet transmission is nondeterministic, special attention should be put on ensuring the appropriate quality of service (QoS) levels for the latency-sensitive traffic flows. In this paper, we address the latency-aware DU and CU placement (LDCP) problem in NGFI. LDCP concerns the placement of DU/CU entities in PP nodes for a given set of demands assuming the QoS requirements of traffic flows that are related to their latency. To this end, we make use of mixed integer linear programming (MILP) in order to formulate the LDCP optimization problem and to solve it. To assure that the latency requirements are satisfied, we apply a reliable latency model, which is included in the MILP model as a set of constraints. To assess the effectiveness of the MILP method and analyze the network performance, we run a broad set of experiments in different network scenarios.
APA, Harvard, Vancouver, ISO, and other styles
17

Roman, Cristian, Ruizhi Liao, Peter Ball, and Shumao Ou. "Mobility and Network Selection in Heterogeneous Wireless Networks: User Approach and Implementation." Network Protocols and Algorithms 8, no. 2 (July 21, 2016): 107. http://dx.doi.org/10.5296/npa.v8i2.9327.

Full text
Abstract:
The Intelligent Transport Systems (ITS) wireless infrastructure needs to support various safety and non-safety services for both autonomous and non-autonomous vehicles.The existing wireless infrastructures can already be used for communicating with different mobile entities at various monetary costs.A packet scheduler, included in a shim layer between the network layer and the medium access (MAC) layer, which is able to schedule packets between uncoordinated Radio Access Technologies (RATs) without modification of the wireless standards, has been devised and its performance evaluated.In this paper, we focus on the influence of mobility type in heterogeneous wireless networks.Three cases are considered based on the mobility in the city: walking, cycling, and driving. Realistic simulations are performed by generating mobility traces of Oxford from Google Maps and overlaying the real locations of existing WiFi Access Points. Results demonstrate that the shim layer approach can accommodate different user profiles and can be a useful abstraction to support Intelligent Transport Systems where there is no coordination between different wireless operators.
APA, Harvard, Vancouver, ISO, and other styles
18

Wang, Chunzhi, Zaoning Wang, Xing Li, Sha Guan, and Ruoxi Wang. "Serial Combination Optimization Method of Packet Transport Network." Wireless Communications and Mobile Computing 2021 (October 18, 2021): 1–10. http://dx.doi.org/10.1155/2021/5495425.

Full text
Abstract:
Packet transport network (PTN) has problems such as waste of resources and low network stability due to the excessive complexity of the existing network or improper network architecture design. The optimization of the transport networks can not only make the network structure more reasonable but also reduce all kinds of unexpected scenarios in the network operation, improving the network efficiency and reducing the failure rate. This research will be optimized from three aspects. (1) In order to solve the problem of the same active and standby routing in the existing network, an optimization algorithm for the same active and standby routing of LSP is proposed. The essence of the optimization algorithm is to search the existing routing using the K -shortest path (KSP) between two network nodes as protection routing for LSP protection. (2) Aiming at the link with a high CIR bandwidth occupancy rate, a method is completed without adding optical fibers and other physical resources; an optimization method for the committed information rate bandwidth occupancy rate based on the KSP algorithm is proposed. (3) When the PTN ring formation rate is low, the security of the PTN is seriously reduced. In order to solve the problem of low ring formation rate in the network, this paper proposes a ring formation rate optimization scheme for PTN access layer equipment based on network elements accounting income. Through the experimental verification on the mobile PTN in one city, Hubei Province, the combination optimization method can improve the network LSP protection rate by 24%, the CIR bandwidth occupancy rate is reduced by 13.82%, and the nonring forming rate was reduced by 17.9%. This method improved network stability, reducing the risk of failure in service transportation effectively.
APA, Harvard, Vancouver, ISO, and other styles
19

De Coninck, Quentin. "The packet number space debate in multipath QUIC." ACM SIGCOMM Computer Communication Review 52, no. 3 (July 30, 2022): 2–9. http://dx.doi.org/10.1145/3561954.3561956.

Full text
Abstract:
With a standardization process that attracted much interest, QUIC can been seen as the next general-purpose transport protocol. Still, it does not provide true multipath support yet, missing some use cases that Multipath TCP addresses. To fill that gap, the IETF recently adopted a Multipath proposal merging several proposed designs. While it focuses on its core components, there still remains one major design issue: the amount of packet number spaces that should be used. This paper provides experimental results with two different Multipath QUIC implementations based on NS3 simulations to understand the impact of using one packet number space per path or a single packet number space for the whole connection. Our results show that using one packet number space per path makes Multipath QUIC more resilient to the receiver's heuristics to acknowledge packets and detect duplicates.
APA, Harvard, Vancouver, ISO, and other styles
20

Nightingale, James, Qi Wang, and Christos Grecos. "Performance Evaluation of Concurrent Multipath Video Streaming in Multihomed Mobile Networks." International Journal of Digital Multimedia Broadcasting 2013 (2013): 1–20. http://dx.doi.org/10.1155/2013/319594.

Full text
Abstract:
High-quality real-time video streaming to users in mobile networks is challenging due to the dynamically changing nature of the network paths, particularly the limited bandwidth and varying end-to-end delay. In this paper, we empirically investigate the performance of multipath streaming in the context of multihomed mobile networks. Existing schemes that make use of the aggregated bandwidth of multiple paths can overcome bandwidth limitations on a single path but suffer an efficiency penalty caused by retransmission of lost packets in reliable transport schemes or path switching overheads in unreliable transport schemes. This work focuses on the evaluation of schemes to permit concurrent use of multiple paths to deliver video streams. A comprehensive streaming framework for concurrent multipath video streaming is proposed and experimentally evaluated, using current state-of-the-art H.264 Scalable Video Coding (H.264/SVC) and the next generation High Efficiency Video Coding (HEVC) standards. It provides a valuable insight into the benefit of using such schemes in conjunction with encoder specific packet prioritisation mechanisms for quality-aware packet scheduling and scalable streaming. The remaining obstacles to deployment of concurrent multipath schemes are identified, and the challenges in realising HEVC based concurrent multipath streaming are highlighted.
APA, Harvard, Vancouver, ISO, and other styles
21

Iovanna, Paola, Francesco Testa, Roberto Sabella, Alberto Bianchi, Marzio Puleri, Mauro Rudi Casanova, and Angelo Germoni. "Packet–Optical Integration Nodes for Next Generation Transport Networks." Journal of Optical Communications and Networking 4, no. 10 (September 28, 2012): 821. http://dx.doi.org/10.1364/jocn.4.000821.

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

Maksic, Natasa, and Aleksandra Smiljanic. "Platform for capacity reservation in IP networks." Serbian Journal of Electrical Engineering 10, no. 1 (2013): 103–11. http://dx.doi.org/10.2298/sjee1301103m.

Full text
Abstract:
The fast development of multimedia devices and services causes the need for increase of the transport capacity of packet networks. OSPF-TE uses both the information about network topology and the link utilization when finding the routing path. Accordingly, it might find path even in the cases when the shortest path routing would cause overloaded link and dropped packets. In this paper we develop the platform for capacity reservation in IP networks. We implement OSPF-TE protocol as an extension of the existing OSPF. In addition, the basic functionalities of the reservation protocol and the user interface are implemented. We present the simulation environment for the verification of our implementation and for the analysis of various routing algorithms based on the information conveyed by OSPF-TE.
APA, Harvard, Vancouver, ISO, and other styles
23

Buenrostro-Mariscal, Raymundo, Pedro C. Santana-Mancilla, Osval Antonio Montesinos-López, Mabel Vazquez-Briseno, and Juan Ivan Nieto-Hipolito. "Prioritization-Driven Congestion Control in Networks for the Internet of Medical Things: A Cross-Layer Proposal." Sensors 23, no. 2 (January 13, 2023): 923. http://dx.doi.org/10.3390/s23020923.

Full text
Abstract:
Real-life implementation of the Internet of Things (IoT) in healthcare requires sufficient quality of service (QoS) to transmit the collected data successfully. However, unsolved challenges in prioritization and congestion issues limit the functionality of IoT networks by increasing the likelihood of packet loss, latency, and high-power consumption in healthcare systems. This study proposes a priority-based cross-layer congestion control protocol called QCCP, which is managed by communication devices’ transport and medium access control (MAC) layers. Unlike existing methods, the novelty of QCCP is how it estimates and resolves wireless channel congestion because it does not generate control packets, operates in a distributed manner, and only has a one-bit overhead. Furthermore, at the same time, QCCP offers packet scheduling considering each packet’s network load and QoS. The results of the experiments demonstrated that with a 95% confidence level, QCCP achieves sufficient performance to support the QoS requirements for the transmission of health signals. Finally, the comparison study shows that QCCP outperforms other TCP protocols, with 64.31% higher throughput, 18.66% less packet loss, and 47.87% less latency.
APA, Harvard, Vancouver, ISO, and other styles
24

Wu, Gan-Hua, Hui-Jie Yang, and Jia-Hui Pan. "Efficient priority queueing routing strategy on networks of mobile agents." Modern Physics Letters B 32, no. 09 (March 30, 2018): 1850137. http://dx.doi.org/10.1142/s0217984918501373.

Full text
Abstract:
As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in–first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.
APA, Harvard, Vancouver, ISO, and other styles
25

Papan, Jozef, Pavel Segec, Oleksandra Yeremenko, Ivana Bridova, and Michal Hodon. "A New Bit Repair Fast Reroute Mechanism for Smart Sensors IoT Network Infrastructure." Sensors 20, no. 18 (September 14, 2020): 5230. http://dx.doi.org/10.3390/s20185230.

Full text
Abstract:
Today’s IP networks are experiencing a high increase in used and connected Internet of Things (IoT) devices and related deployed critical services. This puts increased demands on the reliability of underlayer transport networks. Therefore, modern networks must meet specific qualitative and quantitative parameters to satisfy customer service demands in line with the most common requirements of network fault tolerance and minimal packet loss. After a router or link failure within the transport network, the network convergence process begins. This process can take an unpredictable amount of time, usually depending on the size, the design of the network and the routing protocol used. Several solutions have been developed to address these issues, where one of which is the group of so-called Fast ReRoute (FRR) mechanisms. A general feature of these mechanisms is the fact that the resilience to network connectivity failures is addressed by calculating a pre-prepared alternative path. The path serves as a backup in the event of a network failure. This paper presents a new Bit Repair (B-REP) FRR mechanism that uses a special BIER header field (Bit-String) to explicitly indicate an alternative path used to route the packet. B-REP calculates an alternative path in advance as a majority of existing FRR solutions. The advantage of B-REP is the ability to define an alternative hop-by-hop path with full repair coverage throughout the network, where, unlike other solutions, we propose the use of a standardized solution for this purpose. The area of the B-REP application is communication networks working on the principle of packet switching, which use some link-state routing protocol. Therefore, B-REP can be successfully used in the IoT solutions especially in the field of ensuring communication from sensors in order to guarantee a minimum packet loss during data transmission.
APA, Harvard, Vancouver, ISO, and other styles
26

Wang, Xin Ying. "Building New Reliable Wireless Network by Using Distributed Control." Applied Mechanics and Materials 84-85 (August 2011): 160–66. http://dx.doi.org/10.4028/www.scientific.net/amm.84-85.160.

Full text
Abstract:
With the development of the pioneering deployments in multi-hop wireless networks, although the relative research have not proven successful. The performance of routing and transport is often unstable due to contention induced packet losses, especially when the network is large and the offered load is high. A reliable wireless network architecture by using distributed control for large-scale multi-hop wireless networks has been present in this paper, The design objective is to optimize the control performance. This control performance is a complex function of the network parameters, such as throughput, packet delay and packet loss probabilities. The goal of optimizing the control performance imposes implicit tradeoffs on the wireless network design as opposed to the explicit tradeoffs typical in wireless data and voice applications. Our analysis suggests that our approach will deliver improved service to users while greatly reducing support effort and cost.
APA, Harvard, Vancouver, ISO, and other styles
27

Kanellopoulos, Dimitris N., and Ali H. Wheeb. "Simulated Performance of TFRC, DCCP, SCTP, and UDP Protocols Over Wired Networks." International Journal of Interdisciplinary Telecommunications and Networking 12, no. 4 (October 2020): 88–103. http://dx.doi.org/10.4018/ijitn.2020100107.

Full text
Abstract:
Multimedia applications impose different QoS requirements (e.g., bounded end-to-end delay and jitter) and need an enhanced transport layer protocol that should handle packet loss, minimize errors, manage network congestion, and transmit efficiently. Across an IP network, the transport layer protocol provides data transmission and affects the QoS provided to the application on hand. The most common transport layer protocols used by Internet applications are TCP and UDP. There are also advanced transport layer protocols such as DCCP and TFRC. The authors evaluated the performance of UDP, DCCP, SCTP, and TFRC over wired networks for three traffic flows: data transmission, video streaming, and voice over IP. The evaluation criteria were throughput, end-to-end delay, and packet loss ratio. They compared their performance to learn in which traffic flow/service each of these protocols functions better than the others. The throughput of SCTP and TFRC is better than UDP. DCCP is superior to SCTP and TFRC in terms of end-to-end delay. SCTP is suitable for Internet applications that require high bandwidth.
APA, Harvard, Vancouver, ISO, and other styles
28

Chumchu, Prawit, Roksana Boreli, and Aruna Seneviratne. "A Model-based Scalable Reliable Multicast Transport Protocol for Satellite Networks." Journal of Communications Software and Systems 1, no. 1 (April 6, 2017): 24. http://dx.doi.org/10.24138/jcomss.v1i1.313.

Full text
Abstract:
In this paper, we design a new scalable reliable multicast transport protocol for satellite networks (RMT). This paper is the extensions of paper in [18]. The proposed protocoldoes not require inspection and/or interception of packets at intermediate nodes. The protocol would not require anymodification of satellites, which could be bent-pipe satellites or onboard processing satellites. The proposed protocol is divided in 2 parts: error control part and congestion control part. In error control part, we intend to solve feedback implosion and improve scalability by using a new hybrid of ARQ (Auto Repeat Request) and adaptive forward error correction (AFEC). The AFEC algorithm adapts proactive redundancy levels following the number of receivers and average packet loss rate. This leads to a number of transmissions and the number of feedback signals are virtually independent of the number of receivers. Therefore, wireless link utilization used by the proposed protocol is virtually independent of the number of multicast receivers. In congestion control part, the proposed protocol employs a new window-based congestion control scheme, which is optimized for satellite networks. To be fair to the other traffics, the congestion control mimics congestion control in the wellknown Transmission Control Protocol (TCP) which relies on “packet conservation” principle. To reduce feedback implosion, only a few receivers, ACKers, are selected to report the receiving status. In addition, in order to avoid “drop-to-zero” problem, we use a new simple wireless loss filter algorithm. This loss filter algorithm significantly reduces the probability of the congestion window size to be unnecessarily reduced because of common wireless losses. Furthermore, to improve achievable throughput, we employ slow start threshold adaptation based on estimated bandwidth. The congestion control also deals with variations in network conditions by dynamically electing ACKers.
APA, Harvard, Vancouver, ISO, and other styles
29

Y. Anad Alsaleem, Maan, Naors Y. Anad Alsaleem, and Nawfal Ali Zakar. "Network Performance Analysis Based on Network Simulator NS-2." Ibn AL- Haitham Journal For Pure and Applied Science 31, no. 2 (September 12, 2018): 222. http://dx.doi.org/10.30526/31.2.1951.

Full text
Abstract:
NS-2 is a tool to simulate networks and events that occur per packet sequentially based on time and are widely used in the research field. NS-2 comes with NAM (Network Animator) that produces a visual representation it also supports several simulation protocols. The network can be tested end-to-end. This test includes data transmission, delay, jitter, packet-loss ratio and throughput. The Performance Analysis simulates a virtual network and tests for transport layer protocols at the same time with variable data and analyzes simulation results based on the network simulator NS-2.
APA, Harvard, Vancouver, ISO, and other styles
30

Mohsin Saadoon, Intisar, Maha Ali Hussein, and Farah Neamah Abbas. "Review of Parameters in Routing Protocols in Vehicular Ad-hoc Networks." Journal La Multiapp 3, no. 2 (March 31, 2022): 44–51. http://dx.doi.org/10.37899/journallamultiapp.v3i2.604.

Full text
Abstract:
Vehicular Ad_hoc Network (VANET) is a sophisticated elegance of devoted cellular network that permits automobiles to intelligently communicate for different roadside infrastructure. VANETs bring with it some of demanding situations associated with Quality of Service (QoS) and performance. QoS relies upon on many parameters which includes packet transport ratio, bandwidth, postpone variance, records latency, etc. This paper, discuss numerous troubles associated with latency records, bandwidth usage, and transport of packet in VANETs. The demanding situations have been recognized in offering security, reliability and confidentiality of posted records. Finally, numerous packages of VANETs also are introduced in the modern computing scenario.
APA, Harvard, Vancouver, ISO, and other styles
31

Ghim, C. M., E. Oh, K. I. Goh, B. Kahng, and D. Kim. "Packet transport along the shortest pathways in scale-free networks." European Physical Journal B - Condensed Matter 38, no. 2 (March 1, 2004): 193–99. http://dx.doi.org/10.1140/epjb/e2004-00113-2.

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

Kanakia, Hemant, and Partho P. Mishra. "Packet video transport in ATM networks with single-bit feedback." Multimedia Systems 4, no. 6 (December 1, 1996): 370–80. http://dx.doi.org/10.1007/s005300050038.

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

Kumazoe, Kazumi, Kenji Kawahara, Tetsuya Takine, and Yuji Oie. "Analysis of packet loss in transport layer over ATM networks." International Journal of Communication Systems 10, no. 4 (July 1997): 181–92. http://dx.doi.org/10.1002/(sici)1099-1131(199707/08)10:4<181::aid-dac336>3.0.co;2-z.

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

Jurnal, Redaksi Tim. "KAJIAN PERBANDINGAN PERFORMANSI ROUTING PROTOCOL RIPNG, OSPFV3 DAN EIGRPV6 PADA JARINGAN IPV6." KILAT 7, no. 1 (December 3, 2018): 56–65. http://dx.doi.org/10.33322/kilat.v7i1.105.

Full text
Abstract:
The main purpose of IP next generation version 6 or called IPv6 is to meet the needs of IP addresses for the long term. With the presence of IPv6 it is also necessary routing protocol that supports IPv6 network. Routing protocols work to connect between networks, and choose paths or routes to reach other networks. There are three types of routing protocols that already support IPv6 services. Among other types of distance vector (RIPng), link-state (OSPFv3) and hybrid (EIGRPv6). This final project is designed to know the performance of the three types of routing protocols on IPv6 network. Testing is done by analyzing routing update process, ICMPv6 packet analysis and testing by sending Real-time Transport Protocol (RTP) packet in the form of audio video stream sent via server and accessed through client. In the simulation and analysis results using GNS3 (Graphic Network Simulator 3) and wireshark found that the OSPFv3 performance testing is better than EIGRPv6 and RIPng when performing routing updates or when link down occurs. Then the data analysis of test results with the delivery of Real-time Transport Protocol package so that it can be concluded that OSPFv3 algorithm better than EIGRPv6 and RIPng in terms of delay, packet loss, throughput and jitter.
APA, Harvard, Vancouver, ISO, and other styles
35

Hailu, Dawit Hadush, Gebrehiwet Gebrekrstos Lema, Gebremichael T. Tesfamariam, and Tole Sutikno. "Integrated hybrid optical networking for 5G access networks." Indonesian Journal of Electrical Engineering and Computer Science 17, no. 3 (March 1, 2020): 1647. http://dx.doi.org/10.11591/ijeecs.v17.i3.pp1647-1656.

Full text
Abstract:
Today, deployment of optical fiber has offered large transmission capacity which cannot be efficiently utilized by the electronic switches. Rather, Integrated Hybrid Optical Network (IHON) is a promising approach which combines both packet and circuit switching techniques. As a result, it achieves efficient utilization of the bulk capacity and guarantees absolute Quality of Service (QoS) by optimizing the advantages of the two switching schemes while diminishing their disadvantages. Transpacket has developed a Fusion node implementing IHON principles in Ethernet for the data plane. Hence, this paper investigates and evaluates IHON network for 5G access networks. The simulated results and numerical analysis confirm that the Packet Delay Variation (PDV), Delay and Packet Loss Ratio (PLR) of Guaranteed Service Transport. (GST) traffic in IHON network met the requirements of 5G mobile fronthaul using CPRI. The number of nodes in the network limits the maximum separation distance between Base Band Unit. (BBU) and Remote Radio Head (RRH), link length; for increasing the number of nodes, the link length decreases. In addition to this, we verified how the leftover capacity of fusion node can be used to carry the low priority packets and how the GST traffic can have deterministic characteristics on a single wavelength by delaying it with Fixed Delay Line (FDL). For example, for L<sup>SM</sup><sub>1GE</sub>=0.3 the added Statistical Multiplexing (SM) traffic increases the 10GE wavelength utilization up to 89% without any losses and with SM PLR=1<em>E</em><sup>−03</sup> up to 92% utilization.
APA, Harvard, Vancouver, ISO, and other styles
36

KAMAMURA, Shohei, Rie HAYASHI, Hiroki DATE, Hiroshi YAMAMOTO, Takashi MIYAMURA, Yoshihiko UEMATSU, and Kouichi GENDA. "Recommendation-Based Bandwidth Calendaring for Packet Transport Network." IEICE Transactions on Communications E100.B, no. 1 (2017): 122–30. http://dx.doi.org/10.1587/transcom.2016ebp3126.

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

Salman, Salman, Jafaruddin Gusti Amri Ginting, and Reni Dyah Wahyuningrum. "Analisis Unjuk Kerja TCP Window Size 64k Menggunakan Algoritma TCP New Reno pada Jaringan Wired dan Wireless." RESISTOR (Elektronika Kendali Telekomunikasi Tenaga Listrik Komputer) 4, no. 1 (May 22, 2021): 55. http://dx.doi.org/10.24853/resistor.4.1.55-68.

Full text
Abstract:
Kemacetan jaringan merupakan masalah serius di jaringan internet yang dapat menimbulkan peningkatan jumlah packet loss. Kemacetan juga dapat menjadi beban jaringan sehingga dapat memperlambat koneksi jika tidak ditangani dengan baik, bahkan dapat menyebabkan kelumpuhan dalam jaringan . Transport Control Protocol (TCP) menyediakan mekanisme transfer data yang dapat diandalkan (reliable), sehingga aliran data yang dibaca TCP receiver tidak rusak, tanpa duplikasi, dan berurutan. Pada penelitian ini, penulis menguji kualitas pengiriman data Transport Control Protocol (TCP) Window Size 64K menggunakan Algoritma TCP New Reno pada jaringan kabel Fast Ethernet dan Wireless 802.11n. Penelitian ini bertujuan untuk mengatasi kemacetan pada jaringan wired dan wireless dengan menggunakan TCP Window Size 64K dan Algoritma TCP New Reno dan membandingkan hasil dari parameter Quality of Service (QoS) yang akan diuji diantaranya adalah throughput, delay, jitter, dan packet loss. Proses simulasi penelitian ini menggunakan Software Riverbed sebagai simulator untuk merancang dan mencari nilai parameter Quality of Service (QoS) pada jaringan wired dan wireless tersebut. Hasil dari penelitian ini menunjukkan bahwa throughput dan delay yang dihasilkan pada jaringan Wireless 802.11n memiliki performa yang lebih baik daripada Wired Fast Ethernet dengan nilai throughput 13050,6 bit/sec dan nilai delay 0,000253344 sec. Adapun jaringan Wired Fast Ethernet memiliki performa jitter dan packet loss yang lebih baik daripada Wireless 802.11n dengan nilai jitter 0,0000000000003 sec dan nilai packet loss 0%.Kata Kunci: Kabel Fast Ethernet, Wireless 802.11n, TCP Window Size 64K, TCP New Reno, Quality of Service (QoS). Congestion Network congestion is a serious problem in internet networks that can cause an increase in the number of packet loss. Congestion can also become a burden on the network so that it can slow down the connection if not handled properly, and can even cause paralysis in the network. The Transport Control Protocol (TCP) provides a reliable data transfer mechanism, so that the data streams that are read by the TCP receiver are not damaged, without duplication, and sequential. In this study, the authors simulated using TCP Window Size 64K with the New Reno TCP Algorithm on Wired Fast Ethernet and Wireless 802.11n. This study conducted a simulation to solve congestion on wired and wireless networks and then compared the results of the Quality of Service (QoS) parameters tested, including throughput, delay, jitter, and packet loss. The simulation process of this research uses Riverbed Software as a simulator to design and find the QoS parameter values on the wired and wireless networks. The results of this study indicate that the resulting throughput and delay on the Wireless 802.11n network has better performance than Wired Fast Ethernet with a throughput value of 13050.6 bits / sec and a delay value of 0.000253344 sec. The Wired Fast Ethernet network has better jitter and packet loss performance than Wireless 802.11n with a jitter value of 0.0000000000003 sec and a packet loss value of 0%.
APA, Harvard, Vancouver, ISO, and other styles
38

Sharif, Atif, Vidyasagar M. Potdar, and A. J. D. Rathnayaka. "Dependency of Transport Functions on IEEE802.11 and IEEE802.15.4 MAC/PHY Layer Protocols for WSN." International Journal of Business Data Communications and Networking 6, no. 3 (July 2010): 1–30. http://dx.doi.org/10.4018/jbdcn.2010070101.

Full text
Abstract:
In WSN transport, layer protocol plays a significant role in maintaining the node’s energy budget. To find out the dependency of Transport layer on MAC/PHY layer, the authors have extensively tested various transport protocols using IEEE 802.11, IEEE 802.15.4 MAC/PHY protocols for WSN. For IEEE802.11 and IEEE802.15.4 with RTS/CTS ON the TCP variants has shown >80% packet delivery ratio and 5-20% packet loss, while for UDP it is around >63% and 19.54-35.18% respectively. On average 1-3% additional energy is consumed for packet retransmissions in IEEE 802.11 with RTS/CTS OFF whereas significant energy efficiency is observed in IEEE802.15.4 case. For IEEE 802.11 with RTS/CTS ON high throughput, low packet drop rate and increased E-2-E delay is observed, while for IEEE 802.15.4 improved power efficiency and jitter behavior is observed. This has led the foundation for the future development of the cross-layered energy efficient transport protocol for WSN.
APA, Harvard, Vancouver, ISO, and other styles
39

Mohammed, Hussaim, M. M. A. Hashem, and Palash Gupta. "AN EFFICIENT PACKET SCHEDULING ALGORITHM FOR 4G IP-BASED MOBILE NETWORKS." IIUM Engineering Journal 10, no. 1 (September 29, 2010): 31–48. http://dx.doi.org/10.31436/iiumej.v10i1.103.

Full text
Abstract:
Next generation mobile networks are expected to provide seamless personal mobile communication and quality of service (QoS). Lossless handoff is a key issue for providing the QoS. This paper presents 4G node B Architecture, a two-layer downlink queuing model and proposes a scheduling mechanism for providing lossless handoff and QoS in mobile networks, which exploit IP as a transport technology for transferring datagrams between base stations and the high-speed downlink packet access (HSDPA) at the radio layer. In order to reduce handoff packet dropping rate at the radio layer and packet forwarding rate at the IP layer and to provide high system performance, new scheduling algorithms are performed at both IP and radio layer, which exploit handoff priority scheduling principles and take into account buffer occupancy and channel conditions. Performance results obtained by computer simulation show that, by exploiting the downlink queuing model and scheduling algorithms, the system is able to provide low handoff packet dropping rate, low packet forwarding rate, and high downlink throughput.
APA, Harvard, Vancouver, ISO, and other styles
40

Zhang, Shuai, Man-Gui Liang, Zhong-Yuan Jiang, and Jia-Jing Wu. "Effective strategy of adding links for improving network transport efficiency on complex networks." International Journal of Modern Physics C 25, no. 06 (April 23, 2014): 1450014. http://dx.doi.org/10.1142/s0129183114500144.

Full text
Abstract:
In this paper, we propose an efficient strategy to enhance the network transport efficiency by adding links to the existing networks. In our proposed strategy, we consider both the node betweenness centrality (BC) and the shortest path length (L) as two important factors. The overall traffic capacity of a network system can be evaluated by the critical packet generating rate Rc. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy and the low-betweenness-first (LBF) strategy. This work is helpful for designing and optimizing of realistic networks.
APA, Harvard, Vancouver, ISO, and other styles
41

KIM, K. H., B. KAHNG, and D. KIM. "Packet Transport on Complex Networks With and Without Priority-Based Protocol." Journal of the Korean Physical Society 52, no. 12 (February 20, 2008): 189. http://dx.doi.org/10.3938/jkps.52.189.

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

Bjørnstad, S., R. Veisllari, D. Chen, F. Tonini, and C. Raffaelli. "Minimizing Delay and Packet Delay Variation in Switched 5G Transport Networks." Journal of Optical Communications and Networking 11, no. 4 (March 19, 2019): B49. http://dx.doi.org/10.1364/jocn.11.000b49.

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

Jeffay, K., D. L. Stone, and F. D. Smith. "Transport and display mechanisms for multimedia conferencing across packet-switched networks." Computer Networks and ISDN Systems 26, no. 10 (July 1994): 1281–304. http://dx.doi.org/10.1016/0169-7552(94)90102-3.

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

Ghaemi, Yashar, Hosam El-Ocla, Nitin Ramesh Yadav, Manisha Reddy Madana, Dheeraj Kurugod Raju, Vignesh Dhanabal, and Vishal Sheshadri. "Intelligent Transport System Using Time Delay-Based Multipath Routing Protocol for Vehicular Ad Hoc Networks." Sensors 21, no. 22 (November 19, 2021): 7706. http://dx.doi.org/10.3390/s21227706.

Full text
Abstract:
During the last decade, the research on Intelligent Transportation System (ITS) has improved exponentially in real-life scenarios to provide optimized transport network performance. It is a matter of importance that alert messages are delivered promptly to prevent vehicular traffic problems. The fact is an ITS system per se could be a part of a vehicular ad hoc network (VANET) which is an extension of a wireless network. In all sorts of wireless ad hoc networks, the network topology is subjected to change due to the mobility of network nodes; therefore, an existing explored route between two nodes could be demolished in a minor fraction of time. When it comes to the VANETs, the topology likely changes due to the high velocity of nodes. On the other hand, time is a crucial factor playing an important role in message handling between the network’s nodes. In this paper, we propose Time delay-based Multipath Routing (TMR) protocol that effectively identifies an optimized path for packet delivery to the destination vehicle with a minimal time delay. Our algorithm gives a higher priority to alert messages compared to normal messages. It also selects the routes with the short round-trip time (RTT) within the RTT threshold. As a result, our algorithm would realize two goals. Firstly, it would speed up the data transmission rate and deliver data packets, particularly warning messages, to the destination vehicle promptly and therefore avoid vehicular problems such as car accidents. Secondly, the TMR algorithm reduces the data traffic load, particularly of the normal messages, to alleviate the pressure on the network and therefore avoids network congestion and data collisions. This, in turn, lessens the packets’ retransmissions. To demonstrate the effectiveness of the proposed protocol, the TMR has been compared with the other protocols such as AOMDV, FF-AOMDV, EGSR, QMR, and ISR. Simulation results demonstrate that our proposed protocol proves its excellent performance compared to other protocols.
APA, Harvard, Vancouver, ISO, and other styles
45

Osman, Mohammed, and Josep Mangues-Bafalluy. "Hybrid SDN Performance: Switching between Centralized and Distributed Modes under Unreliable Control Communication Channels." Journal of Sensor and Actuator Networks 10, no. 3 (August 20, 2021): 57. http://dx.doi.org/10.3390/jsan10030057.

Full text
Abstract:
Software-defined networking generally assumes ideal control channels between controller and network nodes. This may not be the case in challenged environments that are becoming more common due to dense and reduced-coverage 5G deployments and use cases requiring cost-effective wireless transport networks. In this paper, we evaluate the impact on network performance of unreliable controller-to-node communication channels, propose a hybrid SDN (hSDN) solution that switches between centralized and distributed operational modes depending on network conditions, and evaluate this solution under a variety of network scenarios (e.g., link impairments or packet loss ratios) designed to assess its operational limits. The results show that the proposed solution substantially improved the aggregated throughput, particularly when control channel packet loss ratios increased, while only showing a slight increase in average latency (e.g., 28% throughput improvement for 20% control packet losses). This enables network operation in hard conditions under which a canonical centralized SDN control would result in a nonoperational network.
APA, Harvard, Vancouver, ISO, and other styles
46

Zhang, Jinhuan, Anfeng Liu, Peng Hu, and Jun Long. "A fuzzy-rule-based packet reproduction routing for sensor networks." International Journal of Distributed Sensor Networks 14, no. 4 (April 2018): 155014771877401. http://dx.doi.org/10.1177/1550147718774016.

Full text
Abstract:
It is a major challenge to transfer target sensing data efficiently to sink in Internet of things. The low-efficiency data transmission can cause low quality of service. To realize the emergent detection and periodic data gathering, the sensed data should be transferred to the sink efficiently and quickly. Recently, there are many related studies. However, there are few researches taking energy efficiency, transport delay, and network reliability into comprehensive consideration. In this article, a novel adaptive green and reliable routing scheme based on a fuzzy logic system is proposed in consideration of energy efficiency, end-to-end transport delay, and network transmission reliability. The key idea of the proposed scheme is to generate different number of renewed packet copies after certain steps according to the fuzzy inference. The fuzzy inference reflects the knowledge that the nodes in the region far to the sink and with more remaining energy initiate and transmit more packet copies concurrently by multiple routing paths to ensure the success rate of data transmission, whereas less. Thus, the high energy efficiency and low latency are obtained for data collection. Our analysis and simulation results show that adaptive green and reliable routing is more superior than the existing scheme.
APA, Harvard, Vancouver, ISO, and other styles
47

Zhao, Yong Xiang, and Chang Jia Chen. "A Congestion Control Protocol in P2P Networks." Applied Mechanics and Materials 29-32 (August 2010): 1241–45. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.1241.

Full text
Abstract:
Many of current P2P application tend to use UDP as their transport protocol. Since UDP does not provide congestion control mechanism, the developers of these applications have to decide how frequently to send UDP packet individually. It is necessary to provide a common congestion control protocol specially design for P2P networks. This paper proposes a protocol for such propose and use simulation to valid it
APA, Harvard, Vancouver, ISO, and other styles
48

Hailu, Dawit Hadush. "QoS Performance of Integrated Hybrid Optical Network in Mobile Fronthual Networks." Indonesian Journal of Electrical Engineering and Computer Science 7, no. 1 (July 1, 2017): 189. http://dx.doi.org/10.11591/ijeecs.v7.i1.pp189-204.

Full text
Abstract:
<p>Cloud Radio Access Network (C-RAN) has emerged as a promising solution to meet the ever-growing capacity demand and reduce the cost of mobile network components. In such network, the mobile operator’s Remote Radio Head (RRH) and Base Band Unit (BBU) are often separated and the connection between them has very tight timing and latency requirements. To employ packet-based network for C-RAN fronthaul, the carried fronthaul traffic are needed to achieve the requirements of fronthaul streams. For this reason, the aim of this paper is focused on investigating and evaluating the feasibility of Integrated Hybrid Optical Network (IHON) networks for mobile fronthaul. TransPacket AS (www.transpacket.com) develops a fusion switching that efficiently serves both Guaranteed Service Transport (GST) traffic with absolute priority and packet switched Statistical Multiplexing (SM) best effort traffic. We verified how the leftover capacity of fusion node can be used to carry the low priority packets and how the GST traffic can have deterministic characteristics on a single wavelength by delaying it with Fixed Delay Line (FDL). For example, for L<sub>1GE </sub><sup>SM</sup> =0.3 the added SM traffic increases the 10GE wavelength utilization up to 89% without any losses and with SM PLR=1E<sup>-03</sup> up to 92% utilization. The simulated results and numerical analysis confirm that the PDV and PLR of GST traffic in Ethernet network meet the requirements of mobile fronthaul using CPRI. For Ethernet network, the number of nodes in the network limits the maximum separation distance between BBU and RRH (link length); for increasing the number of nodes, the link length decreases. Consequently, Radio over Ethernet (RoE) traffic should receive the priority and Quality of Service (QoS) HP can provide. On the other hand, Low Priority (LP) classes are not sensitive to QoS metrics and should be used for transporting time insensitive applications and services.</p>
APA, Harvard, Vancouver, ISO, and other styles
49

Joskowicz, Jose, and Rafael Sotelo. "A Model for Video Quality Assessment Considering Packet Loss for Broadcast Digital Television Coded in H.264." International Journal of Digital Multimedia Broadcasting 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/242531.

Full text
Abstract:
This paper presents a model to predict video quality perceived by the broadcast digital television (DTV) viewer. We present how noise on DTV can introduce individual transport stream (TS) packet losses at the receiver. The type of these errors is different than the produced on IP networks. Different scenarios of TS packet loss are analyzed, including uniform and burst distributions. The results show that there is a high variability on the perceived quality for a given percentage of packet loss and type of error. This implies that there is practically no correlation between the type of error or the percentage of packets loss and the perceived degradation. A new metric is introduced, theweighted percentageof slice loss, which takes into account the affected slice type in each lost TS packet. We show that this metric is correlated with the video quality degradation. A novel parametric model for video quality estimation is proposed, designed, and verified based on the results of subjective tests in SD and HD. The results were compared to a standard model used in IP transmission scenarios. The proposed model improves Pearson Correlation and root mean square error between the subjective and the predicted MOS.
APA, Harvard, Vancouver, ISO, and other styles
50

Prasetyo, Inung Bagus, Mahar Faiqurahman, and Zamah Sari. "Rancang Bangun Control dan Monitoring Sensor Node WSN Menggunakan Protokol Message Queue Telemetry Transport (MQTT)." Jurnal Repositor 2, no. 1 (January 4, 2020): 15. http://dx.doi.org/10.22219/repositor.v2i1.476.

Full text
Abstract:
The WSN network is increasingly gaining attention because of the potential for new and attractive solutions in the field of industrial automation, asset processing, environmental preparation and others. But there are some problems in building the WSN network. Sensor nodes must manage small, cost-effective, low-resource, node sensors must be managed properly with WSN networks Managing WSN networks, can be done by controlling sensor nodes such as giving commands to data transmission activities and monitoring to determine the condition of sensor nodes. The MQTT protocol with the type of publishing / subscription communication is designed with characteristics similar to the characteristics of the WSN network, which are simple, lightweight, energy efficient and easy to implement.In this study, a server will be implemented that can control and monitor the sensors of the WSN network node using the MQTT protocol. Then RTT parameters are used, Qo parameters include Delay, Jitter, Throughput, Packet Loss and sensor node memory condition parameters when using the MQTT protocol. The RTT and QoS scenarios use variations in data size of 16,32,48,64,80 and 96 bytes. Monitoring memory nodes, performing for 1 minute with a total of 30 data transmissions. The RTT parameter testing results are quite stable. QoS testing is very good with stable delay, jitter, increasing throughput, and 0% of data lost when packet loss testing. The Test Memory node sensor, shows erratic results.
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!

To the bibliography