اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOscillations with TCP-like Flow Control in Networks of Queues
360
0
0.0
(
0
)
نشر من قبل
Aleksandrs Slivkins
تاريخ النشر
2008
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flows path are empty and decreases the injection rate when some server is congested. We show that if each servers congestion is governed by the arriving traffic at the server then the system can *oscillate*. This is in contrast to previous work on flow control where congestion was modeled as a function of the flow injection rates and the system was shown to converge to a steady state that maximizes an overall network utility.
قيم البحث
اقرأ أيضاً
Tens of thousands of parent companies control millions of subsidiaries through long chains of intermediary entities in global corporate networks. Conversely, tens of millions of entities are directly held by sole owners. We propose an algorithm for i
dentification of ultimate controlling entities in such networks that unifies direct and indirect control and allows for continuous interpolation between the two concepts via a factor damping long paths. By exploiting onion-like properties of ownership networks the algorithm scales linearly with the network size and handles circular ownership by design. We apply it to the universe of 4.2 mln UK companies and 4 mln of their holders to understand the distribution of control in the country. Furthermore, we provide the first independent evaluation of the control identification results. We reveal that the proposed $alpha$-ICON algorithm identifies more than 96% of beneficiary entities from the evaluation set and supersedes the existing approaches reported in the literature. We refer the superiority of $alpha$-ICON algorithm to its ability to correctly identify the parents long away from their subsidiaries in the network.
Ad-hoc Social Network (ASNET), which explores social connectivity between users of mobile devices, is becoming one of the most important forms of todays internet. In this context, maximum bandwidth utilization of intermediate nodes in resource scarce
environments is one of the challenging tasks. Traditional Transport Control Protocol (TCP) uses the round trip time mechanism for sharing bandwidth resources between users. However, it does not explore socially-aware properties between nodes and cannot differentiate effectively between various types of packet losses in wireless networks. In this paper, a socially-aware congestion avoidance protocol, namely TIBIAS, which takes advantage of similarity matching social properties among intermediate nodes, is proposed to improve the resource efficiency of ASNETs. TIBIAS performs efficient data transfer over TCP. During the course of bandwidth resource allocation, it gives high priority for maximally matched interest similarity between different TCP connections on ASNET links. TIBIAS does not require any modification at lower layers or on receiver nodes. Experimental results show that TIBIAS performs better as compared against existing protocols, in terms of link utilization, unnecessary reduction of the congestion window, throughput and retransmission ratio.
Low-power and lossy networks (LLNs) enable diverse applications integrating many resource-constrained embedded devices, often requiring interconnectivity with existing TCP/IP networks as part of the Internet of Things. But TCP has received little att
ention in LLNs due to concerns about its overhead and performance, leading to LLN-specific protocols that require specialized gateways for interoperability. We present a systematic study of a well-designed TCP stack in IEEE 802.15.4-based LLNs, based on the TCP protocol logic in FreeBSD. Through careful implementation and extensive experiments, we show that modern low-power sensor platforms are capable of running full-scale TCP and that TCP, counter to common belief, performs well despite the lossy nature of LLNs. By carefully studying the interaction between the transport and link layers, we identify subtle but important modifications to both, achieving TCP goodput within 25% of an upper bound (5-40x higher than prior results) and low-power operation commensurate to CoAP in a practical LLN application scenario. This suggests that a TCP-based transport layer, seamlessly interoperable with existing TCP/IP networks, is viable and performant in LLNs.
With the proliferation of mobile computing devices, the demand for continuous network connectivity regardless of physical location has spurred interest in the use of mobile ad hoc networks. Since Transmission Control Protocol (TCP) is the standard ne
twork protocol for communication in the internet, any wireless network with Internet service need to be compatible with TCP. TCP is tuned to perform well in traditional wired networks, where packet losses occur mostly because of congestion. However, TCP connections in Ad-hoc mobile networks are plagued by problems such as high bit error rates, frequent route changes, multipath routing and temporary network partitions. The throughput of TCP over such connection is not satisfactory, because TCP misinterprets the packet loss or delay as congestion and invokes congestion control and avoidance algorithm. In this research, the performance of TCP in Adhoc mobile network with high Bit Error rate (BER) and mobility is studied and investigated. Simulation model is implemented and experiments are performed using the Network Simulatior 2 (NS2).
In a hybrid PON/xDSL access network, multiple Customer Premise Equipment (CPE) nodes connect over individual Digital Subscriber Lines (DSLs) to a drop-point device. The drop-point device, which is typically reverse powered from the customer, is co-lo
cated with an Optical Network Unit (ONU) of the Passive Optical Network (PON). We demonstrate that the drop-point experiences very high buffer occupancies when no flow control or standard Ethernet PAUSE frame flow control is employed. In order to reduce the buffer occupancies in the drop-point, we introduce two gated flow control protocols that extend the polling-based PON medium access control to the DSL segments between the CPEs and the ONUs. We analyze the timing of the gated flow control mechanisms to specify the latest possible time instant when CPEs can start the DSL upstream transmissions so that the ONU can forward the upstream transmissions at the full PON upstream transmission bit rate. Through extensive simulations for a wide range of bursty traffic models, we find that the gated flow control mechanisms, specifically, the ONU and CPE grant sizing policies, enable effective control of the maximum drop-point buffer occupancies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
