The Experts below are selected from a list of 16329 Experts worldwide ranked by ideXlab platform
Walid Dabbous - One of the best experts on this subject based on the ideXlab platform.
-
survey and taxonomy of ip Address lookup algorithms
IEEE Network, 2001Co-Authors: M A Ruizsanchez, Ernst W Biersack, Walid DabbousAbstract:Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast IP Address lookup in the routers, which uses the packet's Destination Address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. IP Address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance IP Address lookup have been proposed. We present a survey of state-of-the-art IP Address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.
-
Survey and taxonomy of ip Address lookup algorithms
2001Co-Authors: Miguel Á. Ruiz-sánchez, Ernst W Biersack, Walid Dabbous, Inria Sophia Antipolis, Sophia AntipolisAbstract:he primary role of routers is to forward packets toward their final Destinations. To this purpose, a router must decide for each incoming packet where to send it next. More exactly, the forwarding decision consists of finding the Address of the next-hop router as well as the egress port through which the packet should be sent. This forwarding information is stored in a forwarding table that the router computes based on the information gathered by routing protocols. To consult the forwarding table, the router uses the packet’s Destination Address as a key; this operation is called Address lookup. Once the forwarding information is retrieved, the router can transfer the packet from the incoming link to the appropriate outgoing link, in a process called switching. The exponential growth of the Internet has stressed its routing system. While the data rates of links have kept pace with the increasing traffic, it has been difficult for the packet processing capacity of routers to keep up with these increased data rates. Specifically, the Address lookup operation is a major bottleneck in the forwarding performance of today’s routers. This article presents a survey of the latest algorithms for efficient IP Address lookup. We start by tracing the evolution of the IP Addressing architecture. The Addressing architecture is of fundamental importance to the routing architecture, and reviewing it will help us to understand the Address lookup problem. The Classful Addressing Scheme In IPv4, IP Addresses are 32 bits long and, when broken up into 4 groups of 8 bits, are normally represented as four decimal numbers separated by dots. For example, the Address 10000010_01010110_00010000_01000010 corresponds in dotted-decimal notation to 130.86.16.66. One of the fundamental objectives of the Internet Protocol is to interconnect networks, so routing on a network basis was a natural choice (rather than routing on a host basis). Thus
Junliang Xue - One of the best experts on this subject based on the ideXlab platform.
-
location and interpretation of Destination Addresses on handwritten chinese envelopes
Pattern Recognition Letters, 2001Co-Authors: Junliang Xue, Xiaoqing Ding, Changsong Liu, Rui Zhang, Weiwei QianAbstract:Abstract Virtually all mail sorting machines currently used in China only recognize post code and ignore the useful Destination Address information on the envelopes. This paper discusses how to efficiently utilize such important information on handwritten Chinese envelopes in order to improve the sorting performance. For this purpose, two particular problems are Addressed, respectively. One is the location of Destination Address block (DAB) on the envelope, and a new bottom-up location method is described in detail. The other is the interpretation of handwritten Chinese Destination Address strings. We present our effort on using as many geometric constraints as possible in the string segmentation. Then a novel Address interpretation algorithm with global optimization is proposed. It combines the segmentation, recognition and Address context information by the best-path search. The effectiveness of the proposed algorithms is fully demonstrated by our experiments on real envelopes.
-
Destination Address block location on handwritten chinese envelope
International Conference on Document Analysis and Recognition, 1999Co-Authors: Junliang Xue, Xiaoqing Ding, Changsong Liu, Shiyan Pan, Hongwei KongAbstract:Handwritten Chinese envelopes have three obvious characteristics: handwritten text lines are the main part of the envelope image; there is no distinct border between the Destination Address block (DAB) and sender Address block (SAB); and handwritten Chinese characters are composed of complicated strokes with more freedom. A method for segmenting the envelope image into several candidate DABs and selecting the best one as the DAB is not yet suitable for handwritten Chinese envelopes. This paper presents a new method of DAB location on envelopes based on extraction of text lines, according to the characteristics of handwritten Chinese envelopes. Our method divides the DAB location problem into several simpler sub-problems and solves them respectively. Experimental results of extraction rate for DAB and average processing time on 500 samples directly sampled from mail sorting machines shows that this method is effective and takes less CPU time.
Weiwei Qian - One of the best experts on this subject based on the ideXlab platform.
-
location and interpretation of Destination Addresses on handwritten chinese envelopes
Pattern Recognition Letters, 2001Co-Authors: Junliang Xue, Xiaoqing Ding, Changsong Liu, Rui Zhang, Weiwei QianAbstract:Abstract Virtually all mail sorting machines currently used in China only recognize post code and ignore the useful Destination Address information on the envelopes. This paper discusses how to efficiently utilize such important information on handwritten Chinese envelopes in order to improve the sorting performance. For this purpose, two particular problems are Addressed, respectively. One is the location of Destination Address block (DAB) on the envelope, and a new bottom-up location method is described in detail. The other is the interpretation of handwritten Chinese Destination Address strings. We present our effort on using as many geometric constraints as possible in the string segmentation. Then a novel Address interpretation algorithm with global optimization is proposed. It combines the segmentation, recognition and Address context information by the best-path search. The effectiveness of the proposed algorithms is fully demonstrated by our experiments on real envelopes.
Abdallah Shami - One of the best experts on this subject based on the ideXlab platform.
-
On-demand scheduling for concurrent multipath transfer using the stream control transmission protocol
Journal of Network and Computer Applications, 2015Co-Authors: T. Daniel Wallace, Khalim Amjad Meerja, Abdallah ShamiAbstract:Disparate path characteristics and a constrained receive buffer can frustrate the promised performance gains of concurrent multipath transfer (CMT). Known as the receive buffer blocking problem, out-of-order arrivals disrupt the sender's ability to transmit new packets while buffering delays ensue at the multihomed receiver. To mitigate this effect, earlier work used scheduling algorithms that assigned new packets to the receiver's Destination Address with the lowest delay. Unfortunately, this approach is not always successful; and in some cases, even a simpler method will achieve better results.Our research suggests that congestion and flow control-standard elements of the stream control transmission protocol (SCTP)-counteract the scheduling process. Since congestion and flow control dictate when packets are actually transmitted to a Destination Address, making a scheduling decision prior to a transmission opportunity can be ineffective.In this paper, we propose an on-demand scheduler (ODS); a scheduling approach for CMT that waits for a transmission opportunity before assigning a packet to one of the receiver's Destination Addresses. In some circumstances, however, ODS will enable one Destination Address to monopolize shared resources, such as the receive buffer (RBUF). To circumvent this issue we have also developed a new congestion window update policy for CMT. When compared to previous scheduling algorithms, ODS and our new update policy can significantly improve throughput for CMT under delay and bandwidth-based disparity.
M A Ruizsanchez - One of the best experts on this subject based on the ideXlab platform.
-
survey and taxonomy of ip Address lookup algorithms
IEEE Network, 2001Co-Authors: M A Ruizsanchez, Ernst W Biersack, Walid DabbousAbstract:Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast IP Address lookup in the routers, which uses the packet's Destination Address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. IP Address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance IP Address lookup have been proposed. We present a survey of state-of-the-art IP Address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.