• 제목/요약/키워드: End-to-End Throughput

검색결과 262건 처리시간 0.022초

NetDraino: Saving Network Resources via Selective Packet Drops

  • Lee, Jin-Kuk;Shin, Kang-G.
    • Journal of Computing Science and Engineering
    • /
    • 제1권1호
    • /
    • pp.31-55
    • /
    • 2007
  • Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

STI-CMP 공정 적용을 위한 연마 정지점 고찰 (A Study of End Point Detection Measurement for STI-CMP Applications)

  • 김상용;서용진
    • 한국전기전자재료학회논문지
    • /
    • 제14권3호
    • /
    • pp.175-184
    • /
    • 2001
  • In this study, the improved throughput and stability in device fabrication could be obtained by applying CMP process to STi structue in 0.18 um semiconductor device. To employ the CMP process in STI structure, the Reverse Moat Process used to be added after STI Fill, as a result, the process became more complex and the defect were seriously increased than they had been,. Removal rate of each thin film in STI CMP was not uniform, so, the device must have been affected. That is, in case of excessive CMP, the damage on the active area was occurred, and in the case of insufficient CMP nitride remaining was happened on that area. Both of them deteriorated device characteristics. As a solution to these problems, the development of slurry having high removal rate and high oxide to nitride selectivity has been studied. The process using this slurry afford low defect levels, improved yield, and a simplified process flow. In this study, we evaluated the 'High Selectivity Slurry' to do a global planarization without reverse moat step, and also we evaluated EPD(Eend Point Detection) system with which 'in-situ end point detection' is possible.

  • PDF

Enhanced OLSR Routing Protocol Using Link-Break Prediction Mechanism for WSN

  • Jaggi, Sukhleen;Wasson, Er. Vikas
    • Industrial Engineering and Management Systems
    • /
    • 제15권3호
    • /
    • pp.259-267
    • /
    • 2016
  • In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

A Proxy Acknowledgement Mechanism for TCP Variants in Mobile Ad Hoc Networks

  • Oo, May Zin;Othman, Mazliza;O'Farrell, Timothy
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.238-245
    • /
    • 2016
  • A sequence number checking technique is proposed to improve the performance of TCP connections in mobile ad hoc networks. While a TCP connection is initialized, a routing protocol takes the responsibility for checking the hop count between a source and destination pair. If the hop count is greater than a predefined value, the routing protocol decides to use a proxy node. The responsibility of a proxy node is to check the correctness of data packets and inform the missing packets by sending an acknowledgement from a proxy node to the source node. By doing so, the source node is able to retransmit any missing packet in advance without waiting until an end-to-end acknowledgement is received from the destination. Simulation results show that the proposed mechanism is able to increase throughput up to 55% in static network and decrease routing overhead up to 95%in mobile network.

A Study on an Adaptive AQM Using Queue Length Variation

  • Seol, Jeong-Hwan;Lee, Ki-Young
    • Journal of information and communication convergence engineering
    • /
    • 제6권1호
    • /
    • pp.19-23
    • /
    • 2008
  • The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

Interference-limited Resource Allocation in Cognitive Radio Networks with Primary User Protection.

  • Mui, Nguyen Van;Hong, Choong-Seon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(A)
    • /
    • pp.352-354
    • /
    • 2011
  • The performance of multihop cognitive radio networks (CRN) can be improved significantly by using multiple channels in spectrum underlay fashion. However, interference due to the sharing of common radio channel and congestion due to the contention among those flows that share the same links become an obstacle to meet this challenge. How to control efficiently congestion and allocate power optimally to obtain a high end-to-end throughput is a key objective in this work. We reexamined the Network Utility Maximum (NUM) problem with a new primary outage constraint and proposed a novel resource allocation strategy to solve it effectively and efficiently.

Optimal Stochastic Policies in a network coding capable Ad Hoc Networks

  • Oh, Hayoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4389-4410
    • /
    • 2014
  • Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

Associativity-Based On-Demand Multi-Path Routing In Mobile Ad Hoc Networks

  • Rehman, Shafqat Ur;Song, Wang-Cheol;Park, Gyung-Leen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권5호
    • /
    • pp.475-491
    • /
    • 2009
  • This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

가상 버퍼를 이용한 공평성을 지원하는 확장된 FRED 기법 (Extended FRED(Fair Random Early Detection) Method with Virtual Buffer)

  • 우희경;김종덕
    • 한국정보처리학회논문지
    • /
    • 제6권11S호
    • /
    • pp.3269-3277
    • /
    • 1999
  • To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

  • PDF

VHF 대양 네트워크를 위한 Ad-hoc 기반 다중접속기법 (Ad-hoc based Multiple Access Scheme for VHF Oceanic Network)

  • 구자열;백호기;임재성
    • 한국항공운항학회지
    • /
    • 제21권1호
    • /
    • pp.15-22
    • /
    • 2013
  • In oceanic flight routes, HF radio and satellite data links have weather restrictions, long propagation delay and low data throughput. In this paper, we propose oceanic aeronautical communications scheme in the VHF band based on ad-hoc communication. The proposed scheme organizes autonomously a multi-hop network that is divided into multiple local network using aircraft to fly long-distance communication and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. In addition, several algorithms to apply spatial reuse of transmission to multi-hop long range communication environments have been proposed. The proposed system proves performance improvement on delay time as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.