The Experts below are selected from a list of 1380 Experts worldwide ranked by ideXlab platform
Min Huang - One of the best experts on this subject based on the ideXlab platform.
-
ACO-inspired ICN Routing mechanism with Mobility support
Applied Soft Computing, 2017Co-Authors: Xingwei Wang, Min HuangAbstract:Abstract Nowadays, Information-Centric Networking (ICN) has been accepted as a promising paradigm in which users retrieve named content with information-centric communication mode rather than finding IP address with host-centric communication mode. Although ICN routing has attracted much attention from researchers, the current proposals cannot effectively and intelligently solve the mobility problem in a self-adaptive and self-organizing manner. In this paper, we introduce Ant Colony Optimization (ACO) into ICN and propose a novel ACO-inspired ICN Routing mechanism with Mobility support (AIRM) to retrieve the content no matter where it moves. At first, a continuous pheromone updating strategy inspired by alcohol volatilization model is devised to conduct the forwarding of interest ant. Secondly, we determine which Outgoing Interfaces can be used to forward interest ant, propose a computation scheme to obtain the forwarding probability, and select an Outgoing Interface to forward interest ant by roulette model. Thirdly, the detailed design on AIRM is presented to address mobility while retrieving the closest content copy. Finally, we evaluate the proposed AIRM, and the simulation results show that AIRM not only solves the mobility problem effectively but also has better performance than existent schemes in terms of routing success rate, routing hop count, load balance degree and execution time.
Szabolcs Szilágyi - One of the best experts on this subject based on the ideXlab platform.
-
The Effects of Different Congestion Management Algorithms over Voip Performance
2015Co-Authors: Szabolcs SzilágyiAbstract:Abstract—This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the Outgoing Interface is busy with sending another packet. The main goal is to compare the performance of the following queuing mechanisms using
-
The Effects of Different Congestion Management Algorithms over Voip Performance
The Science and Information (SAI) Organization, 2015Co-Authors: Szabolcs SzilágyiAbstract:This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the Outgoing Interface is busy with sending another packet. The main goal is to compare the performance of the following queuing mechanisms using a laboratory environment: FIFO (First-In First-Out), CQ (Custom Queuing), PQ (Priority Queuing), WFQ (Weighted Fair Queuing), CBWFQ (Class Based Weighted Fair Queuing) and LLQ (Low Latency Queuing). The research is empirical and qualitative, the results are useful both in infocommunication and in education
-
Analysis of the algorithms for congestion management in computer networks
2014Co-Authors: Szabolcs SzilágyiAbstract:Abstract—This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the Outgoing Interface is busy with sending another packet. Our main goal is to compare the performance of the following queuing mechanisms: FIFO (First
-
Analysis of the algorithms for congestion management in computer networks
UT Press Publishing House, 2013Co-Authors: Szabolcs SzilágyiAbstract:This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the Outgoing Interface is busy with sending another packet. Our main goal is to compare the performance of the following queuing mechanisms: FIFO (First- In First-Out), CQ (Custom Queuing), PQ (Priority Queuing), WFQ (Weighted Fair Queuing), CBWFQ (Class Based Weighted Fair Queuing) and LLQ (Low Latency Queuing)
Xingwei Wang - One of the best experts on this subject based on the ideXlab platform.
-
ACO-inspired ICN Routing mechanism with Mobility support
Applied Soft Computing, 2017Co-Authors: Xingwei Wang, Min HuangAbstract:Abstract Nowadays, Information-Centric Networking (ICN) has been accepted as a promising paradigm in which users retrieve named content with information-centric communication mode rather than finding IP address with host-centric communication mode. Although ICN routing has attracted much attention from researchers, the current proposals cannot effectively and intelligently solve the mobility problem in a self-adaptive and self-organizing manner. In this paper, we introduce Ant Colony Optimization (ACO) into ICN and propose a novel ACO-inspired ICN Routing mechanism with Mobility support (AIRM) to retrieve the content no matter where it moves. At first, a continuous pheromone updating strategy inspired by alcohol volatilization model is devised to conduct the forwarding of interest ant. Secondly, we determine which Outgoing Interfaces can be used to forward interest ant, propose a computation scheme to obtain the forwarding probability, and select an Outgoing Interface to forward interest ant by roulette model. Thirdly, the detailed design on AIRM is presented to address mobility while retrieving the closest content copy. Finally, we evaluate the proposed AIRM, and the simulation results show that AIRM not only solves the mobility problem effectively but also has better performance than existent schemes in terms of routing success rate, routing hop count, load balance degree and execution time.
George Varghese - One of the best experts on this subject based on the ideXlab platform.
-
Reconsidering fragmentation and reassembly
1998Co-Authors: Girish P. Chandranmenon, George VargheseAbstract:We reconsider several issues related to fragmentation and reassembly in IP. We rst reconsider reassembly. Wedescribe a simple expected case optimization that improves reassembly performance to 38 instructions per fragment if the fragments arrive inFIFOorder (the same assumption made in header prediction) which has been implemented in the NetBSD kernel. Next, we introduce the new idea of Graceful Intermediate Reassembly (GIR), whichisageneralization of the existing IP mechanisms of destination and hop-by-hop reassembly. In GIR, we coalesce the fragments at an intermediate router in order to use the largest sized packets on its Outgoing Interface. We showthat GIR always outperforms hop-by-hop reassembly and can be implemented economically in routers with small processing and memory costs. We then reconsider fragmentation. Weshowthatavoiding fragmentation has costs of its own in terms of increased packet processing and/or round-trip delays. We describe measurements in which TCP performance improves after turning on fragmentation. For example, on Ethernet under NetBSD using a 536 byte segment size for TCP we get a throughput of only about 5.5Mb/s, whereas we get a throughputaof 8.45Mb/s using a segment size of 146
-
Reconsidering Fragmentation and Reassembly
1996Co-Authors: Girish P. Chandranmenon, George VargheseAbstract:We reconsider several issues related to fragmentation and reassembly in IP. We first reconsider reassembly. We describe a simple expected case optimization that improves reassembly performance to 38 instructions per fragment if the fragments arrive in FIFO order (the same assumption made in header prediction) which has been implemented in the NetBSD kernel. Next, we introduce the new idea of Graceful Intermediate Reassembly (GIR), which is a generalization of the existing IP mechanisms of destination and hop-by-hop reassembly. In GIR, we coalesce the fragments at an intermediate router in order to use the largest sized packets on its Outgoing Interface. We show that GIR always outperforms hop-by-hop reassembly and can be implemented economically in routers with small processing and memory costs. We then reconsider fragmentation. We show that avoiding fragmentation has costs of its own in terms of increased packet processing and/or round-trip delays. We describe measurements in which TC..
Rong Kai - One of the best experts on this subject based on the ideXlab platform.
-
the research of extending components gis the design to extend component using Outgoing Interface
Geo-information Science, 2003Co-Authors: Rong KaiAbstract:With rapid development of GIS in recent years, the trend of components GIS has become more and more popular But because of the encapsulation essence of the object oriented model, programmers can only use the Interfaces to communicate with the object without knowing anything about the realization details They will get into dilemma when they encounter those functions that GIS components can not realize In this circumstance, the Outgoing Interface defined by the GIS components can be used to extend the GIS components to realize those functions This article will introduce how to use the Outgoing Interface to customize the symbols in MapObjects and illustrate the mechanism of the process Meanwhile, the article will also introduce how to add an Outgoing Interface when developing GIS components Finally, the article discusses the possible trend of this mechanism
