A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS

Kenji Sakamoto, Yoshiyuki Nishino, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In MPLS(MultiProtocol Label Switching), VC-merge(Virtual Circuit-merge) is known as a scalable technique to reduce the total number of VC. However, in the conventional VC-merge capable switch, the number of reassembly buffers greatly increases as switch size grows large. In this paper, we propose a VC-merge capable switch with less buffer requirement. In the proposed model, we can reduce the number of reassembly buffers and decrease the access speed of buffer memory since we can share reassembly buffers between the cells arrived at all input ports by controller. We compare the packet loss probability and the mean system delay performance of the proposed model with those of the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decreases on the order of O(N) and the access speed of buffer memory becomes low. Therefore, the proposed model is effective in MPLS.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages40-44
Number of pages5
Volume1
Publication statusPublished - 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: 2001 Nov 252001 Nov 29

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period01/11/2501/11/29

Fingerprint

Labels
Switches
Networks (circuits)
Data storage equipment
Packet loss
computer simulation
Controllers
Computer simulation
speed

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Sakamoto, K., Nishino, Y., & Sasase, I. (2001). A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 40-44)

A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS. / Sakamoto, Kenji; Nishino, Yoshiyuki; Sasase, Iwao.

Conference Record / IEEE Global Telecommunications Conference. Vol. 1 2001. p. 40-44.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakamoto, K, Nishino, Y & Sasase, I 2001, A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS. in Conference Record / IEEE Global Telecommunications Conference. vol. 1, pp. 40-44, IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States, 01/11/25.
Sakamoto K, Nishino Y, Sasase I. A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS. In Conference Record / IEEE Global Telecommunications Conference. Vol. 1. 2001. p. 40-44
Sakamoto, Kenji ; Nishino, Yoshiyuki ; Sasase, Iwao. / A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS. Conference Record / IEEE Global Telecommunications Conference. Vol. 1 2001. pp. 40-44
@inproceedings{c273343603134c7da114a9ee4bf7c52d,
title = "A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS",
abstract = "In MPLS(MultiProtocol Label Switching), VC-merge(Virtual Circuit-merge) is known as a scalable technique to reduce the total number of VC. However, in the conventional VC-merge capable switch, the number of reassembly buffers greatly increases as switch size grows large. In this paper, we propose a VC-merge capable switch with less buffer requirement. In the proposed model, we can reduce the number of reassembly buffers and decrease the access speed of buffer memory since we can share reassembly buffers between the cells arrived at all input ports by controller. We compare the packet loss probability and the mean system delay performance of the proposed model with those of the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decreases on the order of O(N) and the access speed of buffer memory becomes low. Therefore, the proposed model is effective in MPLS.",
author = "Kenji Sakamoto and Yoshiyuki Nishino and Iwao Sasase",
year = "2001",
language = "English",
volume = "1",
pages = "40--44",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS

AU - Sakamoto, Kenji

AU - Nishino, Yoshiyuki

AU - Sasase, Iwao

PY - 2001

Y1 - 2001

N2 - In MPLS(MultiProtocol Label Switching), VC-merge(Virtual Circuit-merge) is known as a scalable technique to reduce the total number of VC. However, in the conventional VC-merge capable switch, the number of reassembly buffers greatly increases as switch size grows large. In this paper, we propose a VC-merge capable switch with less buffer requirement. In the proposed model, we can reduce the number of reassembly buffers and decrease the access speed of buffer memory since we can share reassembly buffers between the cells arrived at all input ports by controller. We compare the packet loss probability and the mean system delay performance of the proposed model with those of the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decreases on the order of O(N) and the access speed of buffer memory becomes low. Therefore, the proposed model is effective in MPLS.

AB - In MPLS(MultiProtocol Label Switching), VC-merge(Virtual Circuit-merge) is known as a scalable technique to reduce the total number of VC. However, in the conventional VC-merge capable switch, the number of reassembly buffers greatly increases as switch size grows large. In this paper, we propose a VC-merge capable switch with less buffer requirement. In the proposed model, we can reduce the number of reassembly buffers and decrease the access speed of buffer memory since we can share reassembly buffers between the cells arrived at all input ports by controller. We compare the packet loss probability and the mean system delay performance of the proposed model with those of the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decreases on the order of O(N) and the access speed of buffer memory becomes low. Therefore, the proposed model is effective in MPLS.

UR - http://www.scopus.com/inward/record.url?scp=0035681406&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035681406&partnerID=8YFLogxK

M3 - Conference contribution

VL - 1

SP - 40

EP - 44

BT - Conference Record / IEEE Global Telecommunications Conference

ER -