著者

KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on fundamentals of electronics, communications and computer sciences (ISSN:09168508)

巻号頁・発行日

vol.E79.A, no.11, pp.1768-1773, 1996-11

---

Fairness is one of the important notion for programming language, such as process algebras like CCS, that includes con[currency (or parallelism) and nondeterminism. This ensures that while repeatedly choosing among a set of alterna-tives, no alternative will be postponed forever. However, the fairness does not mention at what frequency these alternatives are selected. In this paper, we propose a quantitative fairness,which is called economic-oriented fairness, to each alternatives.This fairness ensures that the expected number of selection for each alternatives are same. We give a condition for probability assignment of selection of each alternative to be satisfied for economic-oriented fairness. First we show a simple probability assignment rule. In this assignment, between any two alternatives,if an alternative is selected TL times and the other m times then the probability to select the former alternative is (m+1)/(n+1) times the probability for the latter. We prove that this assignment satisfies the condition of economic-oriented fairness. For a model of the economic-oriented fairness, we adopt a probabilistic process algebra. Finally, we elaborate with two process models of the economic-oriented fairness. The first one is a server and client model, where each client communicates only with the server, but not among them. In this model, the expected number of communication by each client are equal. The second model considers communication between two processes. In practice, a process has several subprocesses. Each subprocess communicates via a communication port. In the second model, there is economic-oriented fairness where the expected number of communications via each communication port are equal.

著者

Komain PIBULYAROJANA KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E80.B, no.1, pp.116-126, 1997-01

---

Banyan networks are used in multiprocessor computer applications for an ATM switching. In this paper, we study the continuous blocking of the the first n-stage which makes the performance of the banyan networks decrease. We use the 2-dilated banyan networks into the banyan networks to remove the the continuous blocking of the the first n-stage. We call the new networks as the hybrid dilated banyan networks. We explain how to analyze the throughput of this networks at each stage. Based on the analysis of input rate and output rate at each stage, we can design the hybrid dilated banyan networks with the desirable output rate. The result of analysis shows the hybrid dilated banyan networks have higher performance and feasibility than the banyan networks.

著者

PIBULYAROJANA Komain KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E80.B, no.12, pp.1816-1818, 1997-12

---

Many switching networks are currently designed to support ATM architectures. In this letter, we propose the performance improvement of a network called hybrid dilated banyan network with bypasses at the stage of 4×2 re-arrangeable output switch. Our letter also includes the performance analysis of the improved hybrid dilated banyan network.

著者

CHEN Hongbing KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E81.B, no.1, pp.45-57, 1998-01

---

The Optimal Packet Length (OPL) in packet-switched communication systems has been studied in the literature from various aspects. In this paper, we consider the trade-off between packet length and data transmission delay in a high-speed communication system. To simplify the analysis of the mean data transmission de[ay, the model is limited to a point-to-point communication system, in which each node complies with the OSI reference model. In order to study the relationship between the OPL and the number of modules performing each protocol, two model communication systems are discussed. In one each node contains two layered protocol modules, and in the other three. Moreover, for both models, the mean data transmission delay is analyzed for two cases depending on whether or not the DLC layer or the network layer performs retransmissions. After studying the OPL which minimizes the mean data transmission delay in each case, we discuss the relationships between the OPLs and the various protocol parameters.

著者

SUN Zhenqiang KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E82.B, no.9, pp.1432-1438, 1999-09

---

This paper presents the generator polynomial matrices and the upper bound on the constraint length of punctured convolutional codes (PCCs), respectively. By virtue of these properties, we provide the puncturing realizations of the good known nonsystematic and systematic high rate CCs.

著者

PIBULYAROJANA Komain KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E83.B, no.7, pp.1474-1487, 2000-07

---

Banyan networks and their improved switches such as 2-dilated banyan networks are usually constructed by a self-routing mechanism, and provide a high multiplexing transmission capacity to ATM networks.Due to cell blocking in the switching elements in these banyan networks, however, cell loss is occurred and then the throughput of each network is decreased.To improve this problem, we have introduced bypasses to the original and the 2-dilated banyan networks.This paper focuses on the position of the bypasses in these banyan networks and proposes the one-bypass-connection methods in order to minimize cell transfer delay caused by the bypasses.We also analyze output rate of each network and show that the bypass method gives network designers flexible selections for network performance and transfer delay.

著者

OHZAHATA Satoshi KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E84.B, no.4, pp.752-759, 2001-04

---

Mobile IP can provide macro mobility for a mobile node (MN) instead of the original IP communication. Since the orignal Mobile IP does not consider micro mobility, it can not avoid handoff latency. The latency causes packets loss or large variations of the delivery times. To prevent it, several methods are proposed to improve the orignal Mobile IP handoff method. In our previous work, we proposed the fast registration method which enabled an MN to have two communication routes from the home agent (HA), and realized lower latency in the handoff procedures by the doublecasting on the two communication routes. But, the simulation results also show that the proposed method still has large overhead. This paper presents a seamless handoff method, which improves the fast registration method. In the method, the MN can know the first and second suitable base stations for the communications through information from the MAC media. The control helps for seamless handoff in case that the MN must frequently change its current base station (BS). The computer simulations for Constant Bit Rate (CBR) over real-time transport protocol (RTP) flow shows that the proposed method provides no handoff latency with low overhead even if the MN must occur frequcnt handoffs in a second.

著者

SUN Zhenqiang KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E84.B, no.5, pp.1319-1327, 2001-05

---

In the wireless asynchronous transfer mode (ATM) networks, a custom data link control (DLC) layer protocol with stronger error correction ability is needed for mitigating the affect of radio channel errors. This paper applies punctured turbo code schemes to the protection of the header and various payloads in wireless ATM cell, which are realized by the combination of programmable interleaving and puncturing. Their performance is analyzed for Rayleigh fading channel, which shows more significant reduction in cell loss rate (CLR) than the previous systems. Our proposal also provides good balance designs for CLR and the payload bit error rate (BER), and offers potential for future evolutionary improvement of the wireless ATM codingscheme.

著者

OHZAHATA Satoshi KIMURA Shigetomo EBIHARA Yoshihiko KAWASHIMA Konosuke

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E90.B, no.8, pp.2070-2080, 2007-08

被引用文献数

1 2

---

In this paper we propose a cross-layer retransmission control for TCP communication over a wireless link. With our proposed control, a retransmission delay for lost packet is reduced, packet losses in the wireless link are eliminated and all packets are delivered in the correct order. No change is required to TCP itself or to the sender. Our proposed method is implemented in a queue between the media access control (MAC) layer and logical link layer in a base station, and is designed to assist local retransmission control in the MAC layer. Computer simulations show that our proposed method can maximally use the bandwidth of the wireless link under high bit error rates conditions with conventional TCP control. The fairness problem of TCP communication between connections with different bit error rates in a wireless link is also improved, and MAC level fairness is also controllable.