Comparison Study Of Packet Classification Algorithms In Wired Networks
نویسندگان
چکیده
منابع مشابه
Optimisation of Power Consumption in Wired Packet Networks
Over 500 million host computers, three billion PCs and mobile devices consume over a billion kilowatts of electricity. As part of this “system” computer networks consume an increasing amount of energy, and help reduce energy expenditure from other sources through E-Work, E-Commerce and E-Learning. Traditionally, network design seeks to minimise network cost and maximise quality of service (QoS)...
متن کاملPacket Classification Algorithms
This paper deals with packet classification in computer networks. Classification is the key task in many networking devices, most notably packet filters – firewalls. This paper therefore concerns the area of computer security. The paper is focused on high-speed networks with the bandwidth of 100Gb/s and beyond. General-purpose processors cannot be used in such cases, because their performance i...
متن کاملAlgorithms for Packet Classification
The process of categorizing packets into “flows” in an Internet router is called packet classification. All packets belonging to the same flow obey a pre-defined rule and are processed in a similar manner by the router. For example, all packets with the same source and destination IP addresses may be defined to form a flow. Packet classification is needed for non “best-effort” services, such as...
متن کاملIdentification of Packet Losses in TCP Over Wired & Wireless Networks
We propose a robust end-to-end loss differentiation scheme to identify the packet losses due to congestion for TCP connections over wired/wireless networks. We use the measured RTT values in determining whether the cause of packet loss is due to congestion over wired path or regular bit errors over wireless paths. The classification should be as accurate as possible to achieve high throughput a...
متن کاملOnline Packet Scheduling with Hard Deadlines in Wired Networks
The problem of online job or packet scheduling with hard deadlines has been studied extensively in the single hop setting, whereas it is notoriously difficult in the multihop setting. This difficulty stems from the fact that packet scheduling decisions at each hop influences and are influenced by decisions on other hops and only a few provably efficient online scheduling algorithms exist in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF EDUCATION AND SCIENCE
سال: 2012
ISSN: 2664-2530
DOI: 10.33899/edusj.2012.59000