نتایج جستجو برای: packet scheduling

تعداد نتایج: 107606  

2015
Shenglan Huang Ebroul Izquierdo Pengwei Hao

Network coding(NC) appears to bring substantial improvements in terms of throughput and delay in collaborative media streaming applications. A key aspect of NCdriven live peer-to-peer streaming is the packet scheduling policy. In previous peer-to-peer network, the buffer-map is widely used to pull or push packets from parent nodes to achieve data transmission. However, it often leads to undesir...

2005
Yung-Cheng Tu Meng Chang Chen Yeali S. Sun Wei-Kuan Shih

Providing end-to-end delay guarantees for delay sensitive applications is an important packet scheduling issue of routers. In this paper, to support end-to-end delay requirements, we propose a novel network scheduling scheme, called the Bulk Scheduling Scheme (BSS), built on top of existing schedulers of intermediate nodes without modifying transmission protocols on both sender and receiver sid...

2003
Takashi YAMAGUCHI Ken-ichi BABA Masayuki MURATA

In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced...

2002
Yao Liang

packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...

1995
James D. Salehi James F. Kurose Don Towsley

In this paper, we present further results in processor-cache affinity scheduling of parallel network protocol processing, in a setting in which protocol processing executes on the multiprocessor host concurrently with a general workload of non-protocol activity. In earlier work [31, 32] we evaluated affinity-based scheduling of receive-side protocol processing under two parallelization approach...

2008
Ying Yan Hao Yu Lars Dittmann

Recent research activities about hybrid optical wireless networks become attractive. In this paper, we provide an overview on integration of an Ethernet passive optical network (EPON) and a worldwide interoperability for microwave access (WiMAX) network. Gateway node that integrates both optical scheduling and wireless scheduling functions gains most interests. We promote a question: how the sc...

2010
Galen Sasaki Luca Macchiarulo Ke Wang Xiaojiang Liu Chong Li Jingze Chen

In this thesis, we present an analytical framework to provide statistical end-ta-end delay guarantees to network traffic with a novel packet scheduling scheme, namely the Global multi-hop Scheduling (GMS). We first introduce background literature, then present the framework and performance analysis of this proposed scheduling mechanism, which considers bandwidth resources at both upstream and d...

2004
Jing Jiang

This dissertation focuses on downlink multi-antenna transmission with packet scheduling in a wireless packet data network. The topic is viewed as a critical system design problem for future high-speed packet networks requiring extremely high spectral efficiency. Our aim is to illustrate the interaction between transmission schemes at the physical layer and scheduling algorithms at the medium ac...

2004
Michael J. Neely Eytan Modiano

We consider the fundamental delay bounds for scheduling packets in an N × N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the be...

1997
Eytan Modiano

This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the sec...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید