Filters








1,648 Hits in 3.6 sec

Modelling the Reassembly Buffer in a Connectionless Server [chapter]

Geert J. Heijenk, Ignas G. Niemegeers
1995 Performance Modelling and Evaluation of ATM Networks  
The CLS stores cells of a packet in a reassembly buffer until the last one has been received, and forwards all cells of the packet at once.  ...  Furthermore, we assume that a cell is the last one of a packet with probability p. For the system model, we assume a finite reassembly buffer with a length of n cells.  ...  In our model, after the loss of a batch of cells, which will actually result in packet loss, new cells of the packet will be stored in the buffer until the last cell of the packet arrives.  ... 
doi:10.1007/978-0-387-34881-0_31 fatcat:dppiebhih5h3bgjmswhqm4xc4e

Packet Loss Minimization in Load-Balancing Switch [chapter]

Yury Audzevich, Levente Bodrog, Yoram Ofek, Miklós Telek
2010 Lecture Notes in Computer Science  
Based on the presented analysis we account the ways to minimize the mentioned packet loss.  ...  In the following the mathematical model for joint input/central stage packet loss evaluation will be presented.  ...  The transmission process of cells through the switch is also well reported in [1] . Packets are reassembled at re-sequencing and reassembly unit (RRU) back to data cells arriving to outputs.  ... 
doi:10.1007/978-3-642-13568-2_4 fatcat:4gdeynz32zfrvlykrsnq24ku24

CQPPS: A scalable multi‐path switch fabric without back pressure

Boyan Pan, Qingqing Zhou, Guo Chen
2021 IET Communications  
to prevent cell loss in the switch fabrics.  ...  By allowing potential cell loss in the switch fabrics and slightly higher light-load delay, CQPPS achieves loss rate orders of magnitudes lower than back pressure schemes, and high-load delay 10 times  ...  'Fake' cells are dropped in the reassembling buffer and true cells are reassembled to original packets. Since there is no closed-loop flow control, cells may be dropped in the SMs.  ... 
doi:10.1049/cmu2.12236 fatcat:eos6exttyzcr7l7ofo6duqycjm

Reconsidering fragmentation and reassembly

Girish P. Chandranmenon, George Varghese
1998 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98  
We reconsider several issues related to fragmentation and reassembly in IP. W e rst reconsider reassembly.  ...  In GIR, we coalesce the fragments at an intermediate router in order to use the largest sized packets on its outgoing interface.  ...  Since ATM networks use a small cell size, larger data packets have t o b e fragmented into cells and reassembled at the boundaries of the network.  ... 
doi:10.1145/277697.277703 dblp:conf/podc/ChandranmenonV98 fatcat:ggrikbdqh5bklavr74ftvxkoay

An implementation for ATM Adaptation Layer 5

M.S Obaidat, V Cassod
2002 Computer Communications  
If the Segmentation and Reassembly (SAR) interface to memory is not of ®xed latency, further cycle loss could be introduced. q  ...  It was found that in order to achieve a good performance, the minimum recommended packet size should be 0.5 KB. This is a reasonable packet size for IP over ATM.  ...  This is due to variable packet size during simulation, which in turn leads to variable clock cycle loss in padding (Table 2) .  ... 
doi:10.1016/s0140-3664(02)00026-9 fatcat:uunaubp7ujawroczy4v3bgeb2a

Efficient Variable Length Block Switching Mechanism

Jaidhar C.D., A.V Reddy
2007 International Journal of Computers Communications & Control  
It has the following drawbacks: (a) Fragmented packets are reassembled at the Crosspoint Buffer (CB). Hence, minimum buffer requirement at each crosspoint is twice the maximum size of the block.  ...  (b) Reassembly circuit at each crosspoint adds the cost of the switch.  ...  There is a possibility for packet loss due to the restricted CB size. To prevent packet loss completely, larger CB is needed, but CB size is inversely proportional to switch size.  ... 
doi:10.15837/ijccc.2007.3.2359 fatcat:gl7rdpgndjbjhpwvdrphgrd4qe

Performance analysis of broadcast WDM networks under IP traffic

Martin W. McKinnon, Harry G. Perros, George N. Rouskas
1999 Performance evaluation (Print)  
Variable length IP packets are segmented at the transmitting end, the fixed-size segments are transmitted in slots specified by the schedule and are then reassembled into the original packet at the receiving  ...  The segments are then individually transmitted over the broadcast star to the destination node, where they are reassembled into the original packet at the MAC layer before they are passed to the IP layer  ...  Furthermore, no losses can occur at a reassembly queue, since this queue can accommodate a packet of maximum size.  ... 
doi:10.1016/s0166-5316(99)00031-0 fatcat:d62jdr2b6zcmfckcywvm3tfome

ANALYSIS OF A DYNAMIC ASSIGNMENT QUEUEING MODEL WITH POISSON CLUSTER ARRIVAL PROCESSES

Toshihisa Ozawa, Takuya Asaka
1998 Journal of the Operations Research Society of Japan  
We derive an approxirnation ofthe packet Ioss probability by using a deeomposition method and a] asymptotic of t;he cell loss probability.  ...  Furthermore, by reading packet destination addresses directly from the first cells of the packets, they can also route and forward the packets by high-speed cell-by-cell processing without reassembling  ...  [O, n) and that ofcells lost during the same interval, A packet is assumed to be lest when at least one cell of the packet is lost, Let bSK) and bSK) be the packet loss probability and the cell loss probability  ... 
doi:10.15807/jorsj.41.196 fatcat:jnouboqesnbwjjt2n2l37mf2ba

Wormhole IP over (connectionless) ATM

M.G.H. Katevenis, Iakovos Mavroidis, G. Sapountzis, E. Kalyvianaki, Ioannis Mavroidis, G. Glykopoulos
2001 IEEE/ACM Transactions on Networking  
High-speed switches and routers internally operate using fixed-size cells or segments; variable-size packets are segmented and later reassembled.  ...  Connectionless ATM was proposed to quickly carry IP packets segmented into cells (AAL5) using a number of hardware-managed ATM VCs. We show that this is analogous to wormhole routing.  ...  In conclusion, the loss of one cell results in the corruption or loss of one IP packet--an unavoidable fact anyway--plus loss of an additional packet when the lost cell was a tail cell.  ... 
doi:10.1109/90.958332 fatcat:gu7dolm3nnea7ov3u4f5j6qpnq

Asynchronous vs synchronous input-queued switches

Andrea Bianco, Davide Cuda, Paolo Giaccone
2014 Computer Communications  
Furthermore, variable size packets (as in the traffic present in the Internet) require rather complex segmentation and reassembly processes and some switching capacity is lost due to partial filling of  ...  minimum-size packet.  ...  Even when the asynchronous operation leads to performance losses in comparison with synchronous cell switching, these losses are limited, and may be smaller than the losses due to the segmentation/reassembly  ... 
doi:10.1016/j.comcom.2014.07.007 fatcat:rtqik4kitfbqjkhcnvlqx7ivru

Asynchronous vs Synchronous Input-Queued Switches

Andrea Bianco, Davide Cuda, Paolo Giaccone, Fabio Neri
2010 2010 IEEE Global Telecommunications Conference GLOBECOM 2010  
Furthermore, variable size packets (as in the traffic present in the Internet) require rather complex segmentation and reassembly processes and some switching capacity is lost due to partial filling of  ...  minimum-size packet.  ...  Even when the asynchronous operation leads to performance losses in comparison with synchronous cell switching, these losses are limited, and may be smaller than the losses due to the segmentation/reassembly  ... 
doi:10.1109/glocom.2010.5683642 dblp:conf/globecom/BiancoCGN10 fatcat:cn6thbf7ijdzlakbktf6h3uc4m

A Comparison of ATM Stream Merging Techniques [chapter]

M. Baldi, D. Bergamasco, S. Gai, D. Malagrinò
1998 IFIP Advances in Information and Communication Technology  
In A TM networks route aggregation implies stream merging: cells from different incoming streams are switched to the same outgoing link and labeled with the same stream identifier.  ...  If an EOM cell gets lost, the reassembly buffer associated with one of the packets being reassembled will not be released anymore.  ...  Destinations distinguish cells belonging to different packets thanks to the MID field and properly reassemble incoming packets, even if their cells got interleaved.  ... 
doi:10.1007/978-0-387-35388-3_13 fatcat:f6sjez43dvbgfp6jrhvtf5zy6e

A data labelling technique for high-performance protocol processing and its consequences

David C. Feldmeier
1993 Conference proceedings on Communications architectures, protocols and applications - SIGCOMM '93  
Reordering and reassembly of data before processing can reduce communication system performance as seen by the application.  ...  We show how chunks can be used for efficient fragmentation/reassembly and compare chunks with other fragmentation systems.  ...  Route changes that occur during communication also can cause packet disordering, because the first packet sent along the new route may arrive before the last packet sent along the old route.  ... 
doi:10.1145/166237.166254 dblp:conf/sigcomm/Feldmeier93 fatcat:ilpj2bnsajgtpo6xvbeznsbfma

Design of virtual channel queue in an ATM broadband terminal adaptor

H.J. Chao, D.E. Smith
1992 [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications  
Various possible error conditions, such as cell losses in the ATM network and the VCQ buffer overflow, are considered. Corresponding solutions are proposed and included in the VCQ designs.  ...  In this paper, we first study, through computer simulations, the buffer size requirement of a sharedmemory VCQ for different numbers of virtual channels at various packet loss probabilities.  ...  Therefore, MIDs can be used to reassemble the arrived cells into a complete packet.  ... 
doi:10.1109/infcom.1992.263587 dblp:conf/infocom/ChaoS92 fatcat:alch65eifngc3njxthmdt3k2gy

Multi-Gbps HTTP traffic analysis in commodity hardware based on local knowledge of TCP streams

Carlos Vega, Paula Roquero, Javier Aracil
2017 Computer Networks  
.), with no reassembly of the underlying TCP connection, which severely restricts the traffic analysis throughput.  ...  Such techniques provide performance evaluation statistics which are indistinguishable from the single-threaded alternative with full TCP connection reassembly.  ...  Furthermore, Figure 9b represents the packet loss that Tshark suffered when traffic was injected at 10 Gbps speed during an online measurement experiment similar to those in section 3.2.3.  ... 
doi:10.1016/j.comnet.2017.01.001 fatcat:wnuf7kgomjejvmrfedzf2bmhoe
« Previous Showing results 1 — 15 out of 1,648 results